./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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_cd633a7e-c595-4193-9b27-697cc83fce35/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_cd633a7e-c595-4193-9b27-697cc83fce35/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_cd633a7e-c595-4193-9b27-697cc83fce35/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_cd633a7e-c595-4193-9b27-697cc83fce35/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_cd633a7e-c595-4193-9b27-697cc83fce35/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_cd633a7e-c595-4193-9b27-697cc83fce35/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-635dfa2 [2018-12-02 02:34:10,828 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 02:34:10,829 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 02:34:10,835 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 02:34:10,835 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 02:34:10,835 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 02:34:10,836 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 02:34:10,837 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 02:34:10,837 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 02:34:10,838 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 02:34:10,838 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 02:34:10,838 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 02:34:10,839 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 02:34:10,839 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 02:34:10,840 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 02:34:10,840 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 02:34:10,841 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 02:34:10,841 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 02:34:10,842 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 02:34:10,843 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 02:34:10,843 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 02:34:10,844 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 02:34:10,845 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 02:34:10,845 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 02:34:10,845 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 02:34:10,846 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 02:34:10,846 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 02:34:10,847 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 02:34:10,847 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 02:34:10,847 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 02:34:10,848 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 02:34:10,848 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 02:34:10,848 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 02:34:10,848 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 02:34:10,849 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 02:34:10,849 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 02:34:10,849 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_cd633a7e-c595-4193-9b27-697cc83fce35/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-02 02:34:10,856 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 02:34:10,857 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 02:34:10,857 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 02:34:10,857 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 02:34:10,857 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 02:34:10,857 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 02:34:10,858 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 02:34:10,858 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 02:34:10,858 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 02:34:10,858 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 02:34:10,858 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 02:34:10,858 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 02:34:10,858 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 02:34:10,858 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 02:34:10,858 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 02:34:10,859 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 02:34:10,859 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 02:34:10,859 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 02:34:10,859 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 02:34:10,859 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 02:34:10,859 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 02:34:10,859 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-02 02:34:10,859 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-02 02:34:10,859 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-02 02:34:10,859 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 02:34:10,859 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 02:34:10,860 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 02:34:10,860 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 02:34:10,860 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 02:34:10,860 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 02:34:10,860 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 02:34:10,860 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 02:34:10,860 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 02:34:10,860 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 02:34:10,860 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 02:34:10,860 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 02:34:10,860 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_cd633a7e-c595-4193-9b27-697cc83fce35/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-12-02 02:34:10,878 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 02:34:10,887 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 02:34:10,890 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 02:34:10,891 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 02:34:10,891 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 02:34:10,892 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_cd633a7e-c595-4193-9b27-697cc83fce35/bin-2019/utaipan/../../sv-benchmarks/c/memsafety-ext3/getNumbers4_true-valid-memsafety.c [2018-12-02 02:34:10,935 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cd633a7e-c595-4193-9b27-697cc83fce35/bin-2019/utaipan/data/b98f974e6/8861adb276044204937cd9a4d4245439/FLAGdbbf92b60 [2018-12-02 02:34:11,285 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 02:34:11,286 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_cd633a7e-c595-4193-9b27-697cc83fce35/sv-benchmarks/c/memsafety-ext3/getNumbers4_true-valid-memsafety.c [2018-12-02 02:34:11,290 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cd633a7e-c595-4193-9b27-697cc83fce35/bin-2019/utaipan/data/b98f974e6/8861adb276044204937cd9a4d4245439/FLAGdbbf92b60 [2018-12-02 02:34:11,678 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_cd633a7e-c595-4193-9b27-697cc83fce35/bin-2019/utaipan/data/b98f974e6/8861adb276044204937cd9a4d4245439 [2018-12-02 02:34:11,680 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 02:34:11,681 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 02:34:11,682 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 02:34:11,682 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 02:34:11,685 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 02:34:11,685 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:34:11" (1/1) ... [2018-12-02 02:34:11,687 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53e7e914 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:34:11, skipping insertion in model container [2018-12-02 02:34:11,688 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:34:11" (1/1) ... [2018-12-02 02:34:11,692 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 02:34:11,703 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 02:34:11,794 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 02:34:11,802 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 02:34:11,814 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 02:34:11,827 INFO L195 MainTranslator]: Completed translation [2018-12-02 02:34:11,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:34:11 WrapperNode [2018-12-02 02:34:11,827 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 02:34:11,828 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 02:34:11,828 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 02:34:11,828 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 02:34:11,834 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:34:11" (1/1) ... [2018-12-02 02:34:11,839 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:34:11" (1/1) ... [2018-12-02 02:34:11,843 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 02:34:11,843 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 02:34:11,844 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 02:34:11,844 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 02:34:11,877 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:34:11" (1/1) ... [2018-12-02 02:34:11,878 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:34:11" (1/1) ... [2018-12-02 02:34:11,880 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:34:11" (1/1) ... [2018-12-02 02:34:11,881 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:34:11" (1/1) ... [2018-12-02 02:34:11,888 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:34:11" (1/1) ... [2018-12-02 02:34:11,892 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:34:11" (1/1) ... [2018-12-02 02:34:11,893 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:34:11" (1/1) ... [2018-12-02 02:34:11,894 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 02:34:11,894 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 02:34:11,894 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 02:34:11,895 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 02:34:11,895 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:34:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cd633a7e-c595-4193-9b27-697cc83fce35/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-12-02 02:34:11,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 02:34:11,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 02:34:11,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 02:34:11,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 02:34:11,925 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers3 [2018-12-02 02:34:11,925 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers3 [2018-12-02 02:34:11,925 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers2 [2018-12-02 02:34:11,925 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers2 [2018-12-02 02:34:11,925 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers4 [2018-12-02 02:34:11,926 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers4 [2018-12-02 02:34:11,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 02:34:11,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 02:34:11,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 02:34:11,926 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 02:34:11,926 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 02:34:11,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-02 02:34:11,926 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers [2018-12-02 02:34:11,926 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers [2018-12-02 02:34:12,114 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 02:34:12,115 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-12-02 02:34:12,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:34:12 BoogieIcfgContainer [2018-12-02 02:34:12,115 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 02:34:12,115 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 02:34:12,115 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 02:34:12,117 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 02:34:12,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:34:11" (1/3) ... [2018-12-02 02:34:12,118 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d214793 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:34:12, skipping insertion in model container [2018-12-02 02:34:12,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:34:11" (2/3) ... [2018-12-02 02:34:12,118 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d214793 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:34:12, skipping insertion in model container [2018-12-02 02:34:12,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:34:12" (3/3) ... [2018-12-02 02:34:12,119 INFO L112 eAbstractionObserver]: Analyzing ICFG getNumbers4_true-valid-memsafety.c [2018-12-02 02:34:12,125 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 02:34:12,129 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-12-02 02:34:12,138 INFO L257 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2018-12-02 02:34:12,152 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 02:34:12,152 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-02 02:34:12,152 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 02:34:12,152 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 02:34:12,152 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 02:34:12,152 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 02:34:12,152 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 02:34:12,152 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 02:34:12,161 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2018-12-02 02:34:12,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-02 02:34:12,166 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:34:12,167 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:34:12,168 INFO L423 AbstractCegarLoop]: === Iteration 1 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-02 02:34:12,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:34:12,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1830459948, now seen corresponding path program 1 times [2018-12-02 02:34:12,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:34:12,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:34:12,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:34:12,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:34:12,207 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:34:12,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:34:12,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:34:12,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:34:12,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 02:34:12,314 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:34:12,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 02:34:12,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:34:12,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:34:12,325 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 3 states. [2018-12-02 02:34:12,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:34:12,370 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2018-12-02 02:34:12,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:34:12,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-12-02 02:34:12,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:34:12,377 INFO L225 Difference]: With dead ends: 68 [2018-12-02 02:34:12,377 INFO L226 Difference]: Without dead ends: 63 [2018-12-02 02:34:12,378 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-12-02 02:34:12,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-02 02:34:12,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-02 02:34:12,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-02 02:34:12,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2018-12-02 02:34:12,400 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 12 [2018-12-02 02:34:12,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:34:12,400 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2018-12-02 02:34:12,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 02:34:12,400 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2018-12-02 02:34:12,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-02 02:34:12,401 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:34:12,401 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:34:12,401 INFO L423 AbstractCegarLoop]: === Iteration 2 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-02 02:34:12,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:34:12,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1830459949, now seen corresponding path program 1 times [2018-12-02 02:34:12,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:34:12,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:34:12,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:34:12,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:34:12,402 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:34:12,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:34:12,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:34:12,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:34:12,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 02:34:12,516 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:34:12,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 02:34:12,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 02:34:12,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 02:34:12,518 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 4 states. [2018-12-02 02:34:12,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:34:12,592 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-12-02 02:34:12,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 02:34:12,593 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-12-02 02:34:12,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:34:12,593 INFO L225 Difference]: With dead ends: 66 [2018-12-02 02:34:12,593 INFO L226 Difference]: Without dead ends: 66 [2018-12-02 02:34:12,594 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-12-02 02:34:12,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-02 02:34:12,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2018-12-02 02:34:12,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-02 02:34:12,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2018-12-02 02:34:12,598 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 12 [2018-12-02 02:34:12,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:34:12,598 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-12-02 02:34:12,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 02:34:12,599 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-12-02 02:34:12,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-02 02:34:12,599 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:34:12,599 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:34:12,599 INFO L423 AbstractCegarLoop]: === Iteration 3 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-02 02:34:12,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:34:12,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1967365176, now seen corresponding path program 1 times [2018-12-02 02:34:12,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:34:12,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:34:12,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:34:12,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:34:12,600 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:34:12,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:34:12,684 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:34:12,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:34:12,684 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 02:34:12,685 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 16 with the following transitions: [2018-12-02 02:34:12,686 INFO L205 CegarAbsIntRunner]: [0], [1], [99], [107], [108], [110], [112], [118], [120], [122], [124], [125], [126], [128] [2018-12-02 02:34:12,704 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 02:34:12,705 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 02:34:12,827 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 02:34:12,827 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-12-02 02:34:12,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:34:12,833 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 02:34:12,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:34:12,833 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cd633a7e-c595-4193-9b27-697cc83fce35/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-12-02 02:34:12,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:34:12,840 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 02:34:12,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:34:12,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:34:12,897 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-12-02 02:34:12,916 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:12,923 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-12-02 02:34:12,978 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:12,981 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:12,982 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:12,987 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-12-02 02:34:13,048 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:13,049 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:13,051 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:13,052 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:13,054 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:13,055 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:13,057 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:13,063 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 76 [2018-12-02 02:34:13,150 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:13,151 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:13,152 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:13,152 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:13,153 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:13,155 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:13,155 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:13,157 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:13,157 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:13,158 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:13,159 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-12-02 02:34:13,160 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 02:34:13,193 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:13,195 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:13,198 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:13,199 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:13,200 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:13,200 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:13,201 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:13,202 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-12-02 02:34:13,203 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 02:34:13,251 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 02:34:13,288 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:13,288 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:13,289 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:13,290 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:13,291 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:13,291 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 63 [2018-12-02 02:34:13,319 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:13,319 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:13,320 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:13,321 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:13,321 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:13,322 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:13,323 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:13,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2018-12-02 02:34:13,324 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 02:34:13,335 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:13,357 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:13,379 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:13,382 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:13,383 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 45 treesize of output 55 [2018-12-02 02:34:13,404 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:13,410 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:13,411 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:13,412 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:13,413 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:13,413 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 59 [2018-12-02 02:34:13,458 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:13,459 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:13,460 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:13,461 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:13,461 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:13,462 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:13,463 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 41 [2018-12-02 02:34:13,463 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-02 02:34:13,473 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:13,482 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:13,499 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:13,509 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:13,523 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-12-02 02:34:13,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2018-12-02 02:34:13,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-12-02 02:34:13,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2018-12-02 02:34:13,535 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:13,536 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 27 treesize of output 72 [2018-12-02 02:34:13,537 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-02 02:34:13,556 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:13,563 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:13,569 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:13,580 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:13,609 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-12-02 02:34:13,609 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:84, output treesize:53 [2018-12-02 02:34:13,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:34:13,698 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 02:34:13,771 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:34:13,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 02:34:13,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2018-12-02 02:34:13,785 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 02:34:13,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 02:34:13,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 02:34:13,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-12-02 02:34:13,786 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 10 states. [2018-12-02 02:34:13,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:34:13,950 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-12-02 02:34:13,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 02:34:13,951 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-12-02 02:34:13,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:34:13,951 INFO L225 Difference]: With dead ends: 69 [2018-12-02 02:34:13,951 INFO L226 Difference]: Without dead ends: 69 [2018-12-02 02:34:13,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-12-02 02:34:13,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-02 02:34:13,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-12-02 02:34:13,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-02 02:34:13,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2018-12-02 02:34:13,955 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 15 [2018-12-02 02:34:13,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:34:13,955 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2018-12-02 02:34:13,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 02:34:13,955 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-12-02 02:34:13,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 02:34:13,956 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:34:13,956 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-12-02 02:34:13,956 INFO L423 AbstractCegarLoop]: === Iteration 4 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-02 02:34:13,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:34:13,956 INFO L82 PathProgramCache]: Analyzing trace with hash 189347113, now seen corresponding path program 1 times [2018-12-02 02:34:13,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:34:13,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:34:13,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:34:13,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:34:13,957 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:34:13,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:34:13,992 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-02 02:34:13,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:34:13,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 02:34:13,992 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:34:13,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 02:34:13,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 02:34:13,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 02:34:13,993 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 6 states. [2018-12-02 02:34:14,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:34:14,051 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2018-12-02 02:34:14,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 02:34:14,051 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-12-02 02:34:14,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:34:14,052 INFO L225 Difference]: With dead ends: 68 [2018-12-02 02:34:14,052 INFO L226 Difference]: Without dead ends: 68 [2018-12-02 02:34:14,052 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-12-02 02:34:14,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-02 02:34:14,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-02 02:34:14,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-02 02:34:14,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2018-12-02 02:34:14,055 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 26 [2018-12-02 02:34:14,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:34:14,055 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2018-12-02 02:34:14,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 02:34:14,055 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-12-02 02:34:14,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 02:34:14,056 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:34:14,056 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-12-02 02:34:14,056 INFO L423 AbstractCegarLoop]: === Iteration 5 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-02 02:34:14,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:34:14,056 INFO L82 PathProgramCache]: Analyzing trace with hash 189347114, now seen corresponding path program 1 times [2018-12-02 02:34:14,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:34:14,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:34:14,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:34:14,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:34:14,057 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:34:14,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:34:14,081 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:34:14,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:34:14,081 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 02:34:14,081 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-12-02 02:34:14,082 INFO L205 CegarAbsIntRunner]: [0], [1], [27], [35], [38], [99], [105], [107], [108], [112], [116], [117], [118], [120], [121], [122], [124], [125], [126], [128] [2018-12-02 02:34:14,083 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 02:34:14,083 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 02:34:14,126 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 02:34:14,126 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-12-02 02:34:14,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:34:14,128 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 02:34:14,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:34:14,128 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cd633a7e-c595-4193-9b27-697cc83fce35/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-12-02 02:34:14,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:34:14,136 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 02:34:14,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:34:14,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:34:14,160 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:34:14,161 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 02:34:14,195 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:34:14,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 02:34:14,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-02 02:34:14,210 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 02:34:14,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 02:34:14,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 02:34:14,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-02 02:34:14,210 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 7 states. [2018-12-02 02:34:14,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:34:14,225 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2018-12-02 02:34:14,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 02:34:14,225 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-12-02 02:34:14,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:34:14,226 INFO L225 Difference]: With dead ends: 73 [2018-12-02 02:34:14,226 INFO L226 Difference]: Without dead ends: 73 [2018-12-02 02:34:14,226 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-12-02 02:34:14,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-02 02:34:14,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2018-12-02 02:34:14,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-02 02:34:14,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-12-02 02:34:14,231 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 26 [2018-12-02 02:34:14,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:34:14,231 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-12-02 02:34:14,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 02:34:14,231 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-12-02 02:34:14,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-02 02:34:14,232 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:34:14,232 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-12-02 02:34:14,232 INFO L423 AbstractCegarLoop]: === Iteration 6 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-02 02:34:14,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:34:14,232 INFO L82 PathProgramCache]: Analyzing trace with hash -378498171, now seen corresponding path program 2 times [2018-12-02 02:34:14,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:34:14,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:34:14,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:34:14,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:34:14,233 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:34:14,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:34:14,274 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:34:14,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:34:14,274 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 02:34:14,274 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 02:34:14,275 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 02:34:14,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:34:14,275 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cd633a7e-c595-4193-9b27-697cc83fce35/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-12-02 02:34:14,283 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 02:34:14,283 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 02:34:14,302 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-12-02 02:34:14,302 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 02:34:14,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:34:14,309 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-12-02 02:34:14,312 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:14,312 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 0 case distinctions, treesize of input 21 treesize of output 27 [2018-12-02 02:34:14,318 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:14,319 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:14,319 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 23 treesize of output 37 [2018-12-02 02:34:14,323 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:14,324 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:14,324 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:14,325 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 51 [2018-12-02 02:34:14,328 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:14,329 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:14,330 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:14,331 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:14,332 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:14,333 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 27 treesize of output 72 [2018-12-02 02:34:14,334 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 02:34:14,352 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:14,363 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:14,369 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:14,375 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:14,389 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-12-02 02:34:14,398 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:14,403 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-12-02 02:34:14,440 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:14,441 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:14,441 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-12-02 02:34:14,460 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:14,461 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:14,461 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:14,462 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:14,470 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:14,471 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 62 [2018-12-02 02:34:14,496 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:14,496 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:14,497 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:14,497 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:14,498 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:14,498 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:14,499 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-12-02 02:34:14,499 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 02:34:14,508 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:14,514 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:14,529 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:14,530 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:14,531 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:14,536 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-12-02 02:34:14,582 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:14,582 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:14,583 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:14,583 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:14,584 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:14,585 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 43 treesize of output 66 [2018-12-02 02:34:14,607 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:14,608 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:14,608 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:14,609 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:14,609 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:14,610 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:14,610 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:14,611 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-12-02 02:34:14,611 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-02 02:34:14,621 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:14,637 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:14,638 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:14,639 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:14,639 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:14,641 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:14,641 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:14,642 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:14,647 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 41 treesize of output 76 [2018-12-02 02:34:14,702 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:14,703 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:14,704 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:14,704 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:14,705 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:14,706 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:14,706 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:14,708 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:14,708 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:14,709 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:14,709 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-12-02 02:34:14,710 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-02 02:34:14,737 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:14,737 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:14,738 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:14,739 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:14,739 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:14,740 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:14,740 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:14,741 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:14,741 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-12-02 02:34:14,742 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-02 02:34:14,754 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:14,769 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 02:34:14,781 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:14,786 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:14,798 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-12-02 02:34:14,798 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:84, output treesize:53 [2018-12-02 02:34:14,922 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-02 02:34:14,922 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 02:34:15,036 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 18 [2018-12-02 02:34:15,085 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 18 [2018-12-02 02:34:15,094 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 18 [2018-12-02 02:34:15,158 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-02 02:34:15,172 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 02:34:15,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [7] total 17 [2018-12-02 02:34:15,172 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:34:15,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 02:34:15,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 02:34:15,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2018-12-02 02:34:15,173 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 7 states. [2018-12-02 02:34:15,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:34:15,354 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2018-12-02 02:34:15,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 02:34:15,355 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-12-02 02:34:15,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:34:15,355 INFO L225 Difference]: With dead ends: 71 [2018-12-02 02:34:15,355 INFO L226 Difference]: Without dead ends: 71 [2018-12-02 02:34:15,356 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-12-02 02:34:15,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-02 02:34:15,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-12-02 02:34:15,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-02 02:34:15,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-12-02 02:34:15,358 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 29 [2018-12-02 02:34:15,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:34:15,359 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-12-02 02:34:15,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 02:34:15,359 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-12-02 02:34:15,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 02:34:15,359 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:34:15,359 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-12-02 02:34:15,360 INFO L423 AbstractCegarLoop]: === Iteration 7 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-02 02:34:15,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:34:15,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1151458565, now seen corresponding path program 1 times [2018-12-02 02:34:15,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:34:15,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:34:15,361 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 02:34:15,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:34:15,361 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:34:15,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:34:15,394 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:34:15,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:34:15,394 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 02:34:15,395 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-12-02 02:34:15,395 INFO L205 CegarAbsIntRunner]: [0], [1], [27], [35], [36], [40], [99], [105], [107], [108], [112], [116], [117], [118], [120], [121], [122], [124], [125], [126], [128] [2018-12-02 02:34:15,396 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 02:34:15,396 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 02:34:15,435 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 02:34:15,435 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-12-02 02:34:15,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:34:15,439 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 02:34:15,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:34:15,439 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cd633a7e-c595-4193-9b27-697cc83fce35/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-12-02 02:34:15,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:34:15,445 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 02:34:15,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:34:15,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:34:15,471 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:34:15,471 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 02:34:15,515 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:34:15,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 02:34:15,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-02 02:34:15,530 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 02:34:15,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 02:34:15,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 02:34:15,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-02 02:34:15,531 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 8 states. [2018-12-02 02:34:15,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:34:15,547 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2018-12-02 02:34:15,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 02:34:15,548 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2018-12-02 02:34:15,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:34:15,548 INFO L225 Difference]: With dead ends: 76 [2018-12-02 02:34:15,548 INFO L226 Difference]: Without dead ends: 76 [2018-12-02 02:34:15,548 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-12-02 02:34:15,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-02 02:34:15,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2018-12-02 02:34:15,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-02 02:34:15,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2018-12-02 02:34:15,551 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 30 [2018-12-02 02:34:15,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:34:15,551 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2018-12-02 02:34:15,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 02:34:15,551 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2018-12-02 02:34:15,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-02 02:34:15,552 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:34:15,552 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-12-02 02:34:15,552 INFO L423 AbstractCegarLoop]: === Iteration 8 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-02 02:34:15,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:34:15,552 INFO L82 PathProgramCache]: Analyzing trace with hash -387148320, now seen corresponding path program 2 times [2018-12-02 02:34:15,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:34:15,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:34:15,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:34:15,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:34:15,553 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:34:15,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:34:15,587 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:34:15,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:34:15,587 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 02:34:15,587 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 02:34:15,587 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 02:34:15,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:34:15,587 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cd633a7e-c595-4193-9b27-697cc83fce35/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-12-02 02:34:15,594 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 02:34:15,595 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 02:34:15,614 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-12-02 02:34:15,614 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 02:34:15,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:34:15,619 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 84 treesize of output 74 [2018-12-02 02:34:15,635 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:15,646 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 71 treesize of output 78 [2018-12-02 02:34:15,719 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:15,721 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:15,723 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:15,731 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 65 treesize of output 80 [2018-12-02 02:34:15,810 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:15,811 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:15,811 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:15,812 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:15,813 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:15,813 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 55 treesize of output 75 [2018-12-02 02:34:15,840 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:15,840 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:15,841 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:15,842 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:15,842 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:15,843 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:15,843 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:15,844 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 35 treesize of output 81 [2018-12-02 02:34:15,846 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-12-02 02:34:15,847 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 02:34:15,861 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:15,875 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:15,903 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:15,904 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:15,906 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:15,906 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:15,909 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:15,909 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:15,911 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:15,918 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 53 treesize of output 85 [2018-12-02 02:34:16,002 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:16,002 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:16,003 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:16,004 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:16,004 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:16,005 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:16,005 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:16,006 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 54 treesize of output 85 [2018-12-02 02:34:16,009 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-12-02 02:34:16,009 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 02:34:16,026 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:16,059 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:16,065 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:16,066 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:16,067 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:16,068 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:16,069 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:16,070 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:16,072 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:16,073 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:16,075 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:16,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 99 [2018-12-02 02:34:16,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 97 [2018-12-02 02:34:16,096 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-12-02 02:34:16,175 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:16,175 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:16,176 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:16,177 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:16,177 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:16,178 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 55 treesize of output 83 [2018-12-02 02:34:16,178 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 02:34:16,233 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-02 02:34:16,304 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-02 02:34:16,382 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-12-02 02:34:16,483 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:16,483 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:16,484 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 63 treesize of output 70 [2018-12-02 02:34:16,514 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:16,515 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:16,516 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:16,517 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:16,518 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:16,518 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 44 treesize of output 71 [2018-12-02 02:34:16,546 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:16,547 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:16,547 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:16,548 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:16,549 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:16,549 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:16,550 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 35 treesize of output 81 [2018-12-02 02:34:16,553 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-12-02 02:34:16,553 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-02 02:34:16,569 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:16,586 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:16,602 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:16,707 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-12-02 02:34:16,801 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-12-02 02:34:16,910 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-12-02 02:34:16,911 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 5 variables, input treesize:84, output treesize:405 [2018-12-02 02:34:17,089 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-12-02 02:34:17,090 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 02:34:17,163 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-12-02 02:34:17,178 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 02:34:17,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [8] total 10 [2018-12-02 02:34:17,178 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:34:17,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 02:34:17,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:34:17,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-12-02 02:34:17,178 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 3 states. [2018-12-02 02:34:17,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:34:17,200 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2018-12-02 02:34:17,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:34:17,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-12-02 02:34:17,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:34:17,200 INFO L225 Difference]: With dead ends: 73 [2018-12-02 02:34:17,200 INFO L226 Difference]: Without dead ends: 73 [2018-12-02 02:34:17,201 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-12-02 02:34:17,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-02 02:34:17,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-12-02 02:34:17,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-02 02:34:17,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2018-12-02 02:34:17,203 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 33 [2018-12-02 02:34:17,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:34:17,203 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2018-12-02 02:34:17,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 02:34:17,204 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2018-12-02 02:34:17,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-02 02:34:17,204 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:34:17,204 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-12-02 02:34:17,204 INFO L423 AbstractCegarLoop]: === Iteration 9 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-02 02:34:17,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:34:17,204 INFO L82 PathProgramCache]: Analyzing trace with hash -387148319, now seen corresponding path program 1 times [2018-12-02 02:34:17,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:34:17,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:34:17,205 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 02:34:17,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:34:17,205 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:34:17,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:34:17,233 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:34:17,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:34:17,233 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 02:34:17,233 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 34 with the following transitions: [2018-12-02 02:34:17,233 INFO L205 CegarAbsIntRunner]: [0], [1], [27], [35], [36], [41], [99], [105], [107], [108], [112], [116], [117], [118], [120], [121], [122], [124], [125], [126], [128] [2018-12-02 02:34:17,234 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 02:34:17,234 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 02:34:17,264 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 02:34:17,264 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-12-02 02:34:17,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:34:17,266 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 02:34:17,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:34:17,266 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cd633a7e-c595-4193-9b27-697cc83fce35/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-12-02 02:34:17,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:34:17,273 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 02:34:17,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:34:17,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:34:17,302 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:34:17,302 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 02:34:17,358 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:34:17,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 02:34:17,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2018-12-02 02:34:17,373 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 02:34:17,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 02:34:17,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 02:34:17,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-02 02:34:17,374 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 9 states. [2018-12-02 02:34:17,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:34:17,393 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-12-02 02:34:17,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 02:34:17,393 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-12-02 02:34:17,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:34:17,394 INFO L225 Difference]: With dead ends: 78 [2018-12-02 02:34:17,394 INFO L226 Difference]: Without dead ends: 78 [2018-12-02 02:34:17,394 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-12-02 02:34:17,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-02 02:34:17,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2018-12-02 02:34:17,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-02 02:34:17,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2018-12-02 02:34:17,396 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 33 [2018-12-02 02:34:17,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:34:17,397 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2018-12-02 02:34:17,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 02:34:17,397 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2018-12-02 02:34:17,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-02 02:34:17,397 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:34:17,397 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-12-02 02:34:17,397 INFO L423 AbstractCegarLoop]: === Iteration 10 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-02 02:34:17,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:34:17,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1133876442, now seen corresponding path program 2 times [2018-12-02 02:34:17,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:34:17,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:34:17,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:34:17,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:34:17,398 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:34:17,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:34:17,430 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:34:17,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:34:17,430 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 02:34:17,430 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 02:34:17,430 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 02:34:17,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:34:17,430 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cd633a7e-c595-4193-9b27-697cc83fce35/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-12-02 02:34:17,437 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 02:34:17,437 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 02:34:17,452 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-12-02 02:34:17,452 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 02:34:17,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:34:17,458 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-12-02 02:34:17,460 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:17,460 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 0 case distinctions, treesize of input 21 treesize of output 27 [2018-12-02 02:34:17,463 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:17,463 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:17,464 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 23 treesize of output 37 [2018-12-02 02:34:17,466 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:17,467 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:17,467 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:17,468 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 51 [2018-12-02 02:34:17,470 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:17,471 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:17,472 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:17,472 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:17,473 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:17,473 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 27 treesize of output 72 [2018-12-02 02:34:17,474 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 02:34:17,490 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:17,499 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:17,506 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:17,513 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:17,525 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-12-02 02:34:17,535 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:17,539 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-12-02 02:34:17,575 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:17,577 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:17,578 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:17,583 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-12-02 02:34:17,625 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:17,626 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:17,627 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:17,627 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:17,628 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:17,628 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 43 treesize of output 66 [2018-12-02 02:34:17,650 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:17,650 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:17,651 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:17,651 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:17,652 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:17,652 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:17,653 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:17,653 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-12-02 02:34:17,654 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 02:34:17,664 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:17,680 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:17,680 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:17,682 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:17,682 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:17,686 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:17,687 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:17,688 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:17,692 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 41 treesize of output 76 [2018-12-02 02:34:17,749 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:17,750 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:17,750 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:17,751 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:17,752 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:17,752 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:17,753 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:17,753 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 52 [2018-12-02 02:34:17,753 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 02:34:17,777 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:17,777 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:17,778 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:17,778 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:17,779 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:17,779 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:17,780 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:17,781 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:17,782 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:17,782 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:17,783 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:17,783 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 39 treesize of output 53 [2018-12-02 02:34:17,784 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-02 02:34:17,802 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 02:34:17,817 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 02:34:17,837 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:17,838 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:17,839 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 45 treesize of output 55 [2018-12-02 02:34:17,855 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:17,856 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:17,857 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:17,857 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:17,858 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:17,858 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 59 [2018-12-02 02:34:17,878 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:17,878 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:17,879 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:17,879 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:17,880 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:17,880 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:17,881 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 41 [2018-12-02 02:34:17,881 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-02 02:34:17,890 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:17,895 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:17,903 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:17,908 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:17,923 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-12-02 02:34:17,923 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:84, output treesize:53 [2018-12-02 02:34:17,994 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-12-02 02:34:17,995 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 02:34:18,099 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-12-02 02:34:18,113 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 02:34:18,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [9] total 15 [2018-12-02 02:34:18,114 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:34:18,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 02:34:18,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 02:34:18,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-12-02 02:34:18,114 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand 5 states. [2018-12-02 02:34:18,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:34:18,160 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2018-12-02 02:34:18,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 02:34:18,160 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-12-02 02:34:18,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:34:18,161 INFO L225 Difference]: With dead ends: 75 [2018-12-02 02:34:18,161 INFO L226 Difference]: Without dead ends: 75 [2018-12-02 02:34:18,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-12-02 02:34:18,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-02 02:34:18,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-12-02 02:34:18,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-02 02:34:18,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2018-12-02 02:34:18,163 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 36 [2018-12-02 02:34:18,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:34:18,163 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2018-12-02 02:34:18,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 02:34:18,163 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2018-12-02 02:34:18,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-02 02:34:18,163 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:34:18,163 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-12-02 02:34:18,164 INFO L423 AbstractCegarLoop]: === Iteration 11 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-02 02:34:18,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:34:18,164 INFO L82 PathProgramCache]: Analyzing trace with hash -69292150, now seen corresponding path program 1 times [2018-12-02 02:34:18,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:34:18,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:34:18,164 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 02:34:18,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:34:18,164 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:34:18,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:34:18,198 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-12-02 02:34:18,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:34:18,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 02:34:18,198 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:34:18,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 02:34:18,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 02:34:18,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 02:34:18,199 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 6 states. [2018-12-02 02:34:18,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:34:18,255 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2018-12-02 02:34:18,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 02:34:18,255 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2018-12-02 02:34:18,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:34:18,255 INFO L225 Difference]: With dead ends: 74 [2018-12-02 02:34:18,255 INFO L226 Difference]: Without dead ends: 74 [2018-12-02 02:34:18,256 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-12-02 02:34:18,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-02 02:34:18,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-12-02 02:34:18,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-02 02:34:18,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2018-12-02 02:34:18,258 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 45 [2018-12-02 02:34:18,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:34:18,259 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2018-12-02 02:34:18,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 02:34:18,259 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2018-12-02 02:34:18,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-02 02:34:18,260 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:34:18,260 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-12-02 02:34:18,260 INFO L423 AbstractCegarLoop]: === Iteration 12 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-02 02:34:18,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:34:18,260 INFO L82 PathProgramCache]: Analyzing trace with hash -69292149, now seen corresponding path program 1 times [2018-12-02 02:34:18,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:34:18,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:34:18,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:34:18,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:34:18,261 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:34:18,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:34:18,302 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 02:34:18,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:34:18,303 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 02:34:18,303 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 46 with the following transitions: [2018-12-02 02:34:18,303 INFO L205 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-12-02 02:34:18,304 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 02:34:18,304 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 02:34:18,340 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 02:34:18,340 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-12-02 02:34:18,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:34:18,341 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 02:34:18,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:34:18,341 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cd633a7e-c595-4193-9b27-697cc83fce35/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-12-02 02:34:18,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:34:18,347 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 02:34:18,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:34:18,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:34:18,372 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 02:34:18,372 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 02:34:18,435 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 02:34:18,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 02:34:18,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2018-12-02 02:34:18,450 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 02:34:18,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 02:34:18,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 02:34:18,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-02 02:34:18,451 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 10 states. [2018-12-02 02:34:18,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:34:18,476 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2018-12-02 02:34:18,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 02:34:18,476 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2018-12-02 02:34:18,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:34:18,477 INFO L225 Difference]: With dead ends: 79 [2018-12-02 02:34:18,477 INFO L226 Difference]: Without dead ends: 79 [2018-12-02 02:34:18,477 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-12-02 02:34:18,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-02 02:34:18,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2018-12-02 02:34:18,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-02 02:34:18,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2018-12-02 02:34:18,480 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 45 [2018-12-02 02:34:18,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:34:18,480 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-12-02 02:34:18,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 02:34:18,480 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-12-02 02:34:18,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-02 02:34:18,481 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:34:18,481 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-12-02 02:34:18,481 INFO L423 AbstractCegarLoop]: === Iteration 13 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-02 02:34:18,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:34:18,481 INFO L82 PathProgramCache]: Analyzing trace with hash -912931504, now seen corresponding path program 2 times [2018-12-02 02:34:18,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:34:18,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:34:18,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:34:18,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:34:18,482 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:34:18,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:34:18,538 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 02:34:18,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:34:18,539 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 02:34:18,539 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 02:34:18,539 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 02:34:18,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:34:18,539 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cd633a7e-c595-4193-9b27-697cc83fce35/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-12-02 02:34:18,544 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 02:34:18,544 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 02:34:18,560 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-12-02 02:34:18,560 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 02:34:18,562 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:34:18,565 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-12-02 02:34:18,568 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:18,569 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 0 case distinctions, treesize of input 21 treesize of output 27 [2018-12-02 02:34:18,571 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:18,572 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:18,572 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 23 treesize of output 37 [2018-12-02 02:34:18,574 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:18,575 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:18,576 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:18,577 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 51 [2018-12-02 02:34:18,582 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:18,583 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:18,584 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:18,584 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:18,585 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:18,585 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 27 treesize of output 72 [2018-12-02 02:34:18,586 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 02:34:18,601 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:18,609 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:18,615 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:18,622 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:18,635 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-12-02 02:34:18,646 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:18,655 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-12-02 02:34:18,690 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:18,691 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:18,692 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-12-02 02:34:18,710 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:18,711 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:18,711 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:18,712 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:18,712 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:18,713 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 62 [2018-12-02 02:34:18,733 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:18,734 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:18,735 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:18,736 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:18,736 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:18,737 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:18,737 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-12-02 02:34:18,738 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 02:34:18,747 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:18,752 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:18,768 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:18,769 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:18,770 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:18,775 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-12-02 02:34:18,817 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:18,817 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:18,818 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:18,819 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:18,820 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:18,820 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:18,821 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:18,826 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 76 [2018-12-02 02:34:18,880 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:18,881 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:18,881 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:18,882 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:18,883 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:18,883 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:18,884 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:18,884 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 52 [2018-12-02 02:34:18,884 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-02 02:34:18,911 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:18,911 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:18,912 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:18,912 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:18,913 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:18,913 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:18,914 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:18,915 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:18,916 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:18,916 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:18,917 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:18,917 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 39 treesize of output 53 [2018-12-02 02:34:18,917 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 02:34:18,936 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 02:34:18,955 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:18,955 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:18,956 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:18,956 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:18,957 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:18,957 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 63 [2018-12-02 02:34:18,978 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:18,979 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:18,980 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:18,980 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:18,981 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:18,981 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:18,982 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:18,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2018-12-02 02:34:18,983 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-02 02:34:18,991 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:19,001 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:19,010 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:19,015 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:19,026 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-12-02 02:34:19,026 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:84, output treesize:53 [2018-12-02 02:34:19,152 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-12-02 02:34:19,152 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 02:34:19,256 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-02 02:34:19,311 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-12-02 02:34:19,346 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 18 [2018-12-02 02:34:19,364 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 15 [2018-12-02 02:34:19,420 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-12-02 02:34:19,435 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 02:34:19,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [10] total 20 [2018-12-02 02:34:19,435 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:34:19,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 02:34:19,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 02:34:19,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2018-12-02 02:34:19,436 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 7 states. [2018-12-02 02:34:19,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:34:19,655 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-12-02 02:34:19,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 02:34:19,656 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-12-02 02:34:19,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:34:19,656 INFO L225 Difference]: With dead ends: 77 [2018-12-02 02:34:19,656 INFO L226 Difference]: Without dead ends: 77 [2018-12-02 02:34:19,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2018-12-02 02:34:19,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-02 02:34:19,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-12-02 02:34:19,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-02 02:34:19,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2018-12-02 02:34:19,658 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 48 [2018-12-02 02:34:19,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:34:19,658 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-12-02 02:34:19,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 02:34:19,658 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-12-02 02:34:19,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-02 02:34:19,659 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:34:19,659 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-12-02 02:34:19,659 INFO L423 AbstractCegarLoop]: === Iteration 14 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-02 02:34:19,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:34:19,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1763894402, now seen corresponding path program 1 times [2018-12-02 02:34:19,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:34:19,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:34:19,660 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 02:34:19,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:34:19,664 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:34:19,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:34:19,702 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 02:34:19,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:34:19,702 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 02:34:19,702 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 50 with the following transitions: [2018-12-02 02:34:19,702 INFO L205 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-12-02 02:34:19,703 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 02:34:19,703 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 02:34:19,741 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 02:34:19,741 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-12-02 02:34:19,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:34:19,742 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 02:34:19,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:34:19,742 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cd633a7e-c595-4193-9b27-697cc83fce35/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-12-02 02:34:19,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:34:19,750 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 02:34:19,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:34:19,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:34:19,783 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 02:34:19,783 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 02:34:19,842 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 02:34:19,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 02:34:19,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 13 [2018-12-02 02:34:19,856 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 02:34:19,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 02:34:19,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 02:34:19,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-02 02:34:19,857 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 11 states. [2018-12-02 02:34:19,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:34:19,874 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2018-12-02 02:34:19,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 02:34:19,875 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2018-12-02 02:34:19,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:34:19,875 INFO L225 Difference]: With dead ends: 82 [2018-12-02 02:34:19,875 INFO L226 Difference]: Without dead ends: 82 [2018-12-02 02:34:19,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 90 SyntacticMatches, 6 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-02 02:34:19,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-02 02:34:19,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2018-12-02 02:34:19,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-02 02:34:19,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2018-12-02 02:34:19,877 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 49 [2018-12-02 02:34:19,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:34:19,877 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2018-12-02 02:34:19,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 02:34:19,877 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2018-12-02 02:34:19,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-02 02:34:19,877 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:34:19,877 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-12-02 02:34:19,878 INFO L423 AbstractCegarLoop]: === Iteration 15 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-02 02:34:19,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:34:19,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1239445561, now seen corresponding path program 2 times [2018-12-02 02:34:19,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:34:19,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:34:19,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:34:19,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:34:19,878 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:34:19,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:34:19,917 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 02:34:19,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:34:19,918 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 02:34:19,918 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 02:34:19,918 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 02:34:19,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:34:19,918 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cd633a7e-c595-4193-9b27-697cc83fce35/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-12-02 02:34:19,925 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 02:34:19,925 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 02:34:19,941 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-12-02 02:34:19,941 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 02:34:19,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:34:19,946 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 84 treesize of output 74 [2018-12-02 02:34:19,959 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:19,966 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 71 treesize of output 78 [2018-12-02 02:34:20,026 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:20,028 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:20,029 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:20,037 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 65 treesize of output 80 [2018-12-02 02:34:20,123 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:20,124 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:20,125 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:20,126 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:20,127 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:20,128 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 55 treesize of output 75 [2018-12-02 02:34:20,155 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:20,156 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:20,156 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:20,157 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:20,157 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:20,158 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:20,159 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:20,159 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 35 treesize of output 81 [2018-12-02 02:34:20,162 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-12-02 02:34:20,163 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 02:34:20,179 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:20,194 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:20,225 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:20,226 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:20,228 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:20,229 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:20,232 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:20,233 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:20,235 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:20,242 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 53 treesize of output 85 [2018-12-02 02:34:20,336 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:20,337 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:20,337 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:20,338 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:20,339 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:20,339 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:20,340 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:20,340 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 54 treesize of output 85 [2018-12-02 02:34:20,342 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-12-02 02:34:20,343 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 02:34:20,359 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:20,389 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:20,390 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:20,391 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:20,391 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:20,392 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:20,393 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:20,394 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:20,395 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:20,396 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:20,397 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:20,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 99 [2018-12-02 02:34:20,404 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 93 treesize of output 87 [2018-12-02 02:34:20,404 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-02 02:34:20,452 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:20,453 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:20,453 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:20,454 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:20,455 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:20,455 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:20,456 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:20,457 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:20,457 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:20,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 97 [2018-12-02 02:34:20,463 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-12-02 02:34:20,529 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-02 02:34:20,595 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-02 02:34:20,675 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-12-02 02:34:20,773 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:20,774 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:20,775 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 63 treesize of output 70 [2018-12-02 02:34:20,801 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:20,802 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:20,803 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:20,804 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:20,805 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:20,805 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 44 treesize of output 71 [2018-12-02 02:34:20,829 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:20,829 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:20,830 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:20,830 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:20,831 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:20,832 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:20,832 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 35 treesize of output 81 [2018-12-02 02:34:20,834 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-12-02 02:34:20,834 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-02 02:34:20,848 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:20,861 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:20,874 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:20,969 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-12-02 02:34:21,064 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-12-02 02:34:21,163 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-12-02 02:34:21,164 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 5 variables, input treesize:84, output treesize:405 [2018-12-02 02:34:21,390 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-12-02 02:34:21,391 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 02:34:21,442 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-12-02 02:34:21,457 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 02:34:21,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [11] total 13 [2018-12-02 02:34:21,457 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:34:21,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 02:34:21,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:34:21,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2018-12-02 02:34:21,458 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand 3 states. [2018-12-02 02:34:21,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:34:21,481 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2018-12-02 02:34:21,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:34:21,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-12-02 02:34:21,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:34:21,481 INFO L225 Difference]: With dead ends: 79 [2018-12-02 02:34:21,481 INFO L226 Difference]: Without dead ends: 79 [2018-12-02 02:34:21,482 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-12-02 02:34:21,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-02 02:34:21,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-12-02 02:34:21,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-02 02:34:21,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2018-12-02 02:34:21,484 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 52 [2018-12-02 02:34:21,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:34:21,484 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2018-12-02 02:34:21,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 02:34:21,484 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2018-12-02 02:34:21,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-02 02:34:21,485 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:34:21,485 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-12-02 02:34:21,485 INFO L423 AbstractCegarLoop]: === Iteration 16 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-02 02:34:21,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:34:21,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1239445560, now seen corresponding path program 1 times [2018-12-02 02:34:21,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:34:21,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:34:21,486 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 02:34:21,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:34:21,486 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:34:21,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:34:21,534 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 02:34:21,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:34:21,534 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 02:34:21,534 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 53 with the following transitions: [2018-12-02 02:34:21,534 INFO L205 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-12-02 02:34:21,536 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 02:34:21,536 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 02:34:21,575 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 02:34:21,575 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-12-02 02:34:21,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:34:21,576 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 02:34:21,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:34:21,577 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cd633a7e-c595-4193-9b27-697cc83fce35/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-12-02 02:34:21,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:34:21,585 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 02:34:21,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:34:21,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:34:21,617 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 02:34:21,617 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 02:34:21,671 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 02:34:21,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 02:34:21,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2018-12-02 02:34:21,685 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 02:34:21,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 02:34:21,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 02:34:21,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-02 02:34:21,686 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand 12 states. [2018-12-02 02:34:21,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:34:21,708 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2018-12-02 02:34:21,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 02:34:21,708 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 52 [2018-12-02 02:34:21,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:34:21,709 INFO L225 Difference]: With dead ends: 84 [2018-12-02 02:34:21,709 INFO L226 Difference]: Without dead ends: 84 [2018-12-02 02:34:21,709 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-12-02 02:34:21,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-02 02:34:21,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2018-12-02 02:34:21,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-02 02:34:21,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2018-12-02 02:34:21,711 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 52 [2018-12-02 02:34:21,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:34:21,712 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2018-12-02 02:34:21,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 02:34:21,712 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2018-12-02 02:34:21,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-02 02:34:21,712 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:34:21,712 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-12-02 02:34:21,713 INFO L423 AbstractCegarLoop]: === Iteration 17 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-02 02:34:21,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:34:21,713 INFO L82 PathProgramCache]: Analyzing trace with hash -981573021, now seen corresponding path program 2 times [2018-12-02 02:34:21,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:34:21,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:34:21,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:34:21,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:34:21,714 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:34:21,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:34:21,770 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 02:34:21,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:34:21,770 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 02:34:21,770 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 02:34:21,770 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 02:34:21,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:34:21,770 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cd633a7e-c595-4193-9b27-697cc83fce35/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-12-02 02:34:21,777 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 02:34:21,777 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 02:34:21,794 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-12-02 02:34:21,795 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 02:34:21,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:34:21,799 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-12-02 02:34:21,801 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:21,801 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 0 case distinctions, treesize of input 21 treesize of output 27 [2018-12-02 02:34:21,803 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:21,804 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:21,804 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 23 treesize of output 37 [2018-12-02 02:34:21,806 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:21,807 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:21,808 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:21,808 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 51 [2018-12-02 02:34:21,811 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:21,814 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:21,815 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:21,815 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:21,816 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:21,817 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 27 treesize of output 72 [2018-12-02 02:34:21,817 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 02:34:21,834 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:21,844 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:21,850 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:21,855 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:21,867 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-12-02 02:34:21,876 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:21,881 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-12-02 02:34:21,919 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:21,921 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:21,922 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:21,926 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-12-02 02:34:21,967 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:21,968 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:21,969 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:21,970 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:21,970 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:21,971 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 43 treesize of output 66 [2018-12-02 02:34:21,993 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:21,993 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:21,994 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:21,995 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:21,995 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:21,996 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:21,996 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:21,997 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-12-02 02:34:21,997 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 02:34:22,009 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:22,024 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:22,024 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:22,025 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:22,026 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:22,027 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:22,027 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:22,028 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:22,033 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 41 treesize of output 76 [2018-12-02 02:34:22,099 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:22,099 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:22,100 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:22,101 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:22,101 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:22,102 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:22,103 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:22,104 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:22,104 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:22,105 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:22,105 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-12-02 02:34:22,105 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 02:34:22,129 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:22,130 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:22,130 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:22,131 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:22,134 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:22,138 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:22,138 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:22,139 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:22,139 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-12-02 02:34:22,139 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-02 02:34:22,152 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:22,166 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 02:34:22,184 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:22,185 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:22,185 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 45 treesize of output 55 [2018-12-02 02:34:22,201 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:22,202 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:22,203 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:22,203 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:22,204 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:22,204 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 59 [2018-12-02 02:34:22,223 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:22,223 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:22,224 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:22,224 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:22,225 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:22,225 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:22,226 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 41 [2018-12-02 02:34:22,226 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-02 02:34:22,235 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:22,240 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:22,249 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:22,255 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:22,265 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-12-02 02:34:22,265 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:84, output treesize:53 [2018-12-02 02:34:22,348 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-12-02 02:34:22,348 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 02:34:22,456 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-12-02 02:34:22,470 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 02:34:22,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [12] total 18 [2018-12-02 02:34:22,470 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:34:22,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 02:34:22,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 02:34:22,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2018-12-02 02:34:22,471 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand 5 states. [2018-12-02 02:34:22,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:34:22,515 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2018-12-02 02:34:22,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 02:34:22,516 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2018-12-02 02:34:22,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:34:22,516 INFO L225 Difference]: With dead ends: 81 [2018-12-02 02:34:22,516 INFO L226 Difference]: Without dead ends: 81 [2018-12-02 02:34:22,516 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-12-02 02:34:22,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-02 02:34:22,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-12-02 02:34:22,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-02 02:34:22,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2018-12-02 02:34:22,519 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 55 [2018-12-02 02:34:22,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:34:22,519 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2018-12-02 02:34:22,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 02:34:22,520 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2018-12-02 02:34:22,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-02 02:34:22,520 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:34:22,520 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-12-02 02:34:22,521 INFO L423 AbstractCegarLoop]: === Iteration 18 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-02 02:34:22,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:34:22,521 INFO L82 PathProgramCache]: Analyzing trace with hash -965711231, now seen corresponding path program 1 times [2018-12-02 02:34:22,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:34:22,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:34:22,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 02:34:22,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:34:22,522 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:34:22,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:34:22,558 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-12-02 02:34:22,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:34:22,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 02:34:22,559 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:34:22,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 02:34:22,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 02:34:22,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 02:34:22,559 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 6 states. [2018-12-02 02:34:22,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:34:22,607 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2018-12-02 02:34:22,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 02:34:22,607 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-12-02 02:34:22,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:34:22,607 INFO L225 Difference]: With dead ends: 80 [2018-12-02 02:34:22,608 INFO L226 Difference]: Without dead ends: 80 [2018-12-02 02:34:22,608 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-12-02 02:34:22,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-02 02:34:22,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-12-02 02:34:22,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-02 02:34:22,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2018-12-02 02:34:22,609 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 64 [2018-12-02 02:34:22,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:34:22,610 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2018-12-02 02:34:22,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 02:34:22,610 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2018-12-02 02:34:22,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-02 02:34:22,610 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:34:22,610 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-12-02 02:34:22,610 INFO L423 AbstractCegarLoop]: === Iteration 19 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-02 02:34:22,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:34:22,611 INFO L82 PathProgramCache]: Analyzing trace with hash -965711230, now seen corresponding path program 1 times [2018-12-02 02:34:22,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:34:22,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:34:22,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:34:22,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:34:22,611 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:34:22,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:34:22,689 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 02:34:22,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:34:22,690 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 02:34:22,690 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 65 with the following transitions: [2018-12-02 02:34:22,690 INFO L205 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-12-02 02:34:22,691 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 02:34:22,691 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 02:34:22,744 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 02:34:22,744 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-12-02 02:34:22,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:34:22,746 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 02:34:22,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:34:22,746 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cd633a7e-c595-4193-9b27-697cc83fce35/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-12-02 02:34:22,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:34:22,756 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 02:34:22,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:34:22,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:34:22,788 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 02:34:22,788 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 02:34:22,852 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 02:34:22,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 02:34:22,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 13 [2018-12-02 02:34:22,867 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 02:34:22,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 02:34:22,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 02:34:22,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-02 02:34:22,867 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand 13 states. [2018-12-02 02:34:22,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:34:22,888 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2018-12-02 02:34:22,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 02:34:22,888 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 64 [2018-12-02 02:34:22,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:34:22,889 INFO L225 Difference]: With dead ends: 83 [2018-12-02 02:34:22,889 INFO L226 Difference]: Without dead ends: 83 [2018-12-02 02:34:22,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 118 SyntacticMatches, 10 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-02 02:34:22,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-02 02:34:22,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-12-02 02:34:22,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-02 02:34:22,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2018-12-02 02:34:22,890 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 64 [2018-12-02 02:34:22,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:34:22,890 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2018-12-02 02:34:22,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 02:34:22,890 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-12-02 02:34:22,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 02:34:22,891 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:34:22,891 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-12-02 02:34:22,891 INFO L423 AbstractCegarLoop]: === Iteration 20 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-02 02:34:22,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:34:22,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1653003107, now seen corresponding path program 2 times [2018-12-02 02:34:22,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:34:22,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:34:22,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:34:22,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:34:22,892 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:34:22,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:34:22,909 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-12-02 02:34:22,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:34:22,909 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 02:34:22,909 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 02:34:22,909 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 02:34:22,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:34:22,909 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cd633a7e-c595-4193-9b27-697cc83fce35/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-12-02 02:34:22,918 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 02:34:22,918 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 02:34:22,935 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-12-02 02:34:22,935 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 02:34:22,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:34:22,939 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-12-02 02:34:22,958 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:22,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 53 treesize of output 63 [2018-12-02 02:34:23,001 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:23,002 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:23,002 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-12-02 02:34:23,022 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:23,023 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:23,023 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:23,024 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:23,025 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:23,025 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 62 [2018-12-02 02:34:23,047 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:23,048 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:23,048 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:23,049 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:23,050 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:23,051 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:23,051 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-12-02 02:34:23,051 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 02:34:23,062 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:23,074 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:23,097 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:23,100 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:23,102 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:23,106 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-12-02 02:34:23,151 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:23,152 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:23,154 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:23,155 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:23,157 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:23,158 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:23,159 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:23,164 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 76 [2018-12-02 02:34:23,220 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:23,221 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:23,222 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:23,223 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:23,223 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:23,225 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:23,226 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:23,227 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:23,228 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:23,229 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:23,229 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-12-02 02:34:23,229 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 02:34:23,261 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:23,261 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:23,262 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:23,263 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:23,263 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:23,264 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:23,265 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:23,265 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-12-02 02:34:23,265 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 02:34:23,301 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 02:34:23,343 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:23,344 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:23,346 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:23,347 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:23,348 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:23,349 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 63 [2018-12-02 02:34:23,372 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:23,373 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:23,374 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:23,374 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:23,375 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:23,376 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:23,376 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:23,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2018-12-02 02:34:23,377 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-02 02:34:23,392 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:23,416 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:23,437 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:23,447 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:23,463 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-12-02 02:34:23,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2018-12-02 02:34:23,466 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-12-02 02:34:23,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2018-12-02 02:34:23,470 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:23,471 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 27 treesize of output 72 [2018-12-02 02:34:23,471 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-02 02:34:23,485 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:23,492 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:23,497 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:23,502 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:23,517 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-12-02 02:34:23,517 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:84, output treesize:53 [2018-12-02 02:34:23,635 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-12-02 02:34:23,635 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 02:34:23,716 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 18 [2018-12-02 02:34:23,759 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 18 [2018-12-02 02:34:23,762 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 18 [2018-12-02 02:34:23,811 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-12-02 02:34:23,826 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 02:34:23,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [4] total 14 [2018-12-02 02:34:23,826 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:34:23,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 02:34:23,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 02:34:23,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-12-02 02:34:23,827 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand 7 states. [2018-12-02 02:34:23,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:34:23,989 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2018-12-02 02:34:23,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 02:34:23,989 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2018-12-02 02:34:23,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:34:23,989 INFO L225 Difference]: With dead ends: 83 [2018-12-02 02:34:23,989 INFO L226 Difference]: Without dead ends: 83 [2018-12-02 02:34:23,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 124 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2018-12-02 02:34:23,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-02 02:34:23,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-12-02 02:34:23,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-02 02:34:23,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2018-12-02 02:34:23,991 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 67 [2018-12-02 02:34:23,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:34:23,991 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2018-12-02 02:34:23,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 02:34:23,991 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-12-02 02:34:23,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-02 02:34:23,992 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:34:23,992 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-12-02 02:34:23,992 INFO L423 AbstractCegarLoop]: === Iteration 21 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-02 02:34:23,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:34:23,992 INFO L82 PathProgramCache]: Analyzing trace with hash 296511237, now seen corresponding path program 1 times [2018-12-02 02:34:23,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:34:23,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:34:23,992 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 02:34:23,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:34:23,993 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:34:23,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:34:24,008 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-12-02 02:34:24,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:34:24,008 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 02:34:24,008 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 69 with the following transitions: [2018-12-02 02:34:24,008 INFO L205 CegarAbsIntRunner]: [0], [1], [3], [9], [11], [12], [15], [18], [20], [24], [25], [27], [33], [35], [36], [39], [42], [44], [48], [49], [51], [59], [60], [64], [99], [105], [107], [108], [112], [116], [117], [118], [119], [120], [121], [122], [123], [124], [125], [126], [128] [2018-12-02 02:34:24,009 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 02:34:24,009 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 02:34:24,054 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 02:34:24,054 INFO L272 AbstractInterpreter]: Visited 41 different actions 105 times. Merged at 19 different actions 53 times. Widened at 2 different actions 2 times. Performed 774 root evaluator evaluations with a maximum evaluation depth of 4. Performed 774 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-12-02 02:34:24,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:34:24,058 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 02:34:24,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:34:24,058 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cd633a7e-c595-4193-9b27-697cc83fce35/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-12-02 02:34:24,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:34:24,069 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 02:34:24,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:34:24,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:34:24,106 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-12-02 02:34:24,106 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 02:34:24,132 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-12-02 02:34:24,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 02:34:24,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-02 02:34:24,157 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 02:34:24,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 02:34:24,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 02:34:24,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-02 02:34:24,157 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand 5 states. [2018-12-02 02:34:24,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:34:24,167 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2018-12-02 02:34:24,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 02:34:24,168 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-12-02 02:34:24,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:34:24,168 INFO L225 Difference]: With dead ends: 92 [2018-12-02 02:34:24,169 INFO L226 Difference]: Without dead ends: 92 [2018-12-02 02:34:24,169 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-12-02 02:34:24,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-02 02:34:24,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2018-12-02 02:34:24,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-02 02:34:24,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2018-12-02 02:34:24,171 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 68 [2018-12-02 02:34:24,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:34:24,171 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2018-12-02 02:34:24,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 02:34:24,172 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2018-12-02 02:34:24,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-02 02:34:24,172 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:34:24,172 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-12-02 02:34:24,172 INFO L423 AbstractCegarLoop]: === Iteration 22 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-02 02:34:24,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:34:24,173 INFO L82 PathProgramCache]: Analyzing trace with hash 725066785, now seen corresponding path program 2 times [2018-12-02 02:34:24,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:34:24,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:34:24,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:34:24,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:34:24,173 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:34:24,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:34:24,195 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-12-02 02:34:24,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:34:24,195 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 02:34:24,195 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 02:34:24,195 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 02:34:24,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:34:24,196 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cd633a7e-c595-4193-9b27-697cc83fce35/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-12-02 02:34:24,203 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 02:34:24,203 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 02:34:24,224 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-12-02 02:34:24,224 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 02:34:24,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:34:24,228 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-12-02 02:34:24,234 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:24,250 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-12-02 02:34:24,252 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:24,256 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:24,263 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-12-02 02:34:24,274 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:24,278 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:24,284 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-12-02 02:34:24,337 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:24,338 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:24,339 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:24,341 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:24,342 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-12-02 02:34:24,346 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-12-02 02:34:24,346 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 02:34:24,366 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:24,387 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:24,389 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:24,390 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:24,391 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:24,393 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:24,394 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:24,396 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:24,401 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-12-02 02:34:24,404 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-12-02 02:34:24,404 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 02:34:24,453 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:24,454 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:24,455 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:24,457 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:24,458 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:24,458 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:24,460 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:24,461 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:24,462 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:24,466 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-12-02 02:34:24,466 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-12-02 02:34:24,515 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-02 02:34:24,561 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-02 02:34:24,624 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-12-02 02:34:24,644 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:24,646 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:24,647 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:24,649 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:24,649 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-12-02 02:34:24,654 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-12-02 02:34:24,654 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 02:34:24,663 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:24,672 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:24,727 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-12-02 02:34:24,792 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-12-02 02:34:24,795 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-12-02 02:34:24,804 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:24,807 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:24,808 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:24,810 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:24,811 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-12-02 02:34:24,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, 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-12-02 02:34:24,816 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-02 02:34:24,824 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:24,832 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:24,840 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:24,900 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-12-02 02:34:24,957 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-12-02 02:34:25,018 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-12-02 02:34:25,019 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 5 variables, input treesize:42, output treesize:261 [2018-12-02 02:34:25,149 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-12-02 02:34:25,149 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 02:34:25,204 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-12-02 02:34:25,218 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 02:34:25,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [5] total 7 [2018-12-02 02:34:25,218 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:34:25,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 02:34:25,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:34:25,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 02:34:25,219 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand 3 states. [2018-12-02 02:34:25,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:34:25,231 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2018-12-02 02:34:25,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:34:25,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2018-12-02 02:34:25,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:34:25,232 INFO L225 Difference]: With dead ends: 87 [2018-12-02 02:34:25,232 INFO L226 Difference]: Without dead ends: 87 [2018-12-02 02:34:25,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 02:34:25,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-02 02:34:25,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-12-02 02:34:25,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-02 02:34:25,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2018-12-02 02:34:25,233 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 73 [2018-12-02 02:34:25,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:34:25,234 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2018-12-02 02:34:25,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 02:34:25,234 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2018-12-02 02:34:25,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-02 02:34:25,234 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:34:25,234 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-12-02 02:34:25,234 INFO L423 AbstractCegarLoop]: === Iteration 23 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-02 02:34:25,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:34:25,234 INFO L82 PathProgramCache]: Analyzing trace with hash 725066786, now seen corresponding path program 1 times [2018-12-02 02:34:25,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:34:25,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:34:25,235 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 02:34:25,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:34:25,235 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:34:25,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:34:25,262 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-12-02 02:34:25,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:34:25,262 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 02:34:25,262 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 74 with the following transitions: [2018-12-02 02:34:25,262 INFO L205 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-12-02 02:34:25,264 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 02:34:25,264 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 02:34:25,304 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 02:34:25,305 INFO L272 AbstractInterpreter]: Visited 41 different actions 98 times. Merged at 16 different actions 47 times. Widened at 1 different actions 1 times. Performed 739 root evaluator evaluations with a maximum evaluation depth of 4. Performed 739 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-12-02 02:34:25,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:34:25,306 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 02:34:25,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:34:25,306 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cd633a7e-c595-4193-9b27-697cc83fce35/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-12-02 02:34:25,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:34:25,313 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 02:34:25,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:34:25,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:34:25,354 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-12-02 02:34:25,355 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 02:34:25,401 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-12-02 02:34:25,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 02:34:25,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-02 02:34:25,425 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 02:34:25,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 02:34:25,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 02:34:25,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-12-02 02:34:25,425 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand 6 states. [2018-12-02 02:34:25,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:34:25,438 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2018-12-02 02:34:25,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 02:34:25,438 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2018-12-02 02:34:25,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:34:25,439 INFO L225 Difference]: With dead ends: 96 [2018-12-02 02:34:25,439 INFO L226 Difference]: Without dead ends: 96 [2018-12-02 02:34:25,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 143 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-12-02 02:34:25,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-02 02:34:25,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2018-12-02 02:34:25,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-02 02:34:25,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2018-12-02 02:34:25,442 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 73 [2018-12-02 02:34:25,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:34:25,442 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2018-12-02 02:34:25,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 02:34:25,442 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2018-12-02 02:34:25,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-02 02:34:25,442 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:34:25,443 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] [2018-12-02 02:34:25,443 INFO L423 AbstractCegarLoop]: === Iteration 24 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-02 02:34:25,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:34:25,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1745733498, now seen corresponding path program 2 times [2018-12-02 02:34:25,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:34:25,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:34:25,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:34:25,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:34:25,444 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:34:25,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:34:25,473 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-12-02 02:34:25,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:34:25,474 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 02:34:25,474 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 02:34:25,474 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 02:34:25,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:34:25,474 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cd633a7e-c595-4193-9b27-697cc83fce35/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-12-02 02:34:25,481 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 02:34:25,481 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 02:34:25,502 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-12-02 02:34:25,502 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 02:34:25,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:34:25,506 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 46 treesize of output 42 [2018-12-02 02:34:25,516 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:25,520 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 39 treesize of output 52 [2018-12-02 02:34:25,552 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:25,555 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:25,557 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:25,562 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 39 treesize of output 60 [2018-12-02 02:34:25,570 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 2 case distinctions, treesize of input 56 treesize of output 59 [2018-12-02 02:34:25,621 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:25,621 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:25,622 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:25,623 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:25,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 40 treesize of output 40 [2018-12-02 02:34:25,625 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 02:34:25,652 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:25,653 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:25,653 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:25,654 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:25,656 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:25,657 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:25,657 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:25,658 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-12-02 02:34:25,658 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 02:34:25,683 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 02:34:25,714 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:25,715 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:25,716 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:25,716 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 31 treesize of output 46 [2018-12-02 02:34:25,734 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:25,735 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:25,735 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:25,736 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:25,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-02 02:34:25,736 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 02:34:25,745 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:25,761 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:25,782 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:25,783 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:25,783 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 34 treesize of output 47 [2018-12-02 02:34:25,785 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 35 treesize of output 42 [2018-12-02 02:34:25,800 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:25,800 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:25,801 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:25,802 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:25,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 25 [2018-12-02 02:34:25,802 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-02 02:34:25,813 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:25,820 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:25,834 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:25,841 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:25,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-12-02 02:34:25,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2018-12-02 02:34:25,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-12-02 02:34:25,859 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 25 treesize of output 39 [2018-12-02 02:34:25,862 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:25,862 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 27 treesize of output 60 [2018-12-02 02:34:25,862 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-02 02:34:25,873 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:25,879 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:25,888 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:25,892 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:25,903 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-12-02 02:34:25,904 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:67, output treesize:41 [2018-12-02 02:34:26,008 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-12-02 02:34:26,008 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 02:34:26,116 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-12-02 02:34:26,135 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 02:34:26,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [6] total 12 [2018-12-02 02:34:26,135 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:34:26,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 02:34:26,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 02:34:26,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-02 02:34:26,135 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand 5 states. [2018-12-02 02:34:26,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:34:26,185 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2018-12-02 02:34:26,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 02:34:26,186 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2018-12-02 02:34:26,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:34:26,186 INFO L225 Difference]: With dead ends: 91 [2018-12-02 02:34:26,186 INFO L226 Difference]: Without dead ends: 91 [2018-12-02 02:34:26,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-02 02:34:26,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-02 02:34:26,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-12-02 02:34:26,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-02 02:34:26,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2018-12-02 02:34:26,188 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 78 [2018-12-02 02:34:26,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:34:26,188 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2018-12-02 02:34:26,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 02:34:26,188 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2018-12-02 02:34:26,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-02 02:34:26,188 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:34:26,188 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-12-02 02:34:26,188 INFO L423 AbstractCegarLoop]: === Iteration 25 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-02 02:34:26,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:34:26,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1455442659, now seen corresponding path program 1 times [2018-12-02 02:34:26,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:34:26,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:34:26,189 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 02:34:26,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:34:26,189 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:34:26,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:34:26,221 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-12-02 02:34:26,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:34:26,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 02:34:26,222 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:34:26,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 02:34:26,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 02:34:26,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 02:34:26,222 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand 6 states. [2018-12-02 02:34:26,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:34:26,265 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2018-12-02 02:34:26,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 02:34:26,266 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2018-12-02 02:34:26,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:34:26,266 INFO L225 Difference]: With dead ends: 90 [2018-12-02 02:34:26,266 INFO L226 Difference]: Without dead ends: 90 [2018-12-02 02:34:26,266 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-12-02 02:34:26,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-02 02:34:26,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-12-02 02:34:26,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-02 02:34:26,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2018-12-02 02:34:26,268 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 87 [2018-12-02 02:34:26,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:34:26,269 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2018-12-02 02:34:26,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 02:34:26,269 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2018-12-02 02:34:26,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-02 02:34:26,269 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:34:26,269 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-12-02 02:34:26,269 INFO L423 AbstractCegarLoop]: === Iteration 26 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-02 02:34:26,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:34:26,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1455442660, now seen corresponding path program 1 times [2018-12-02 02:34:26,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:34:26,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:34:26,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:34:26,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:34:26,270 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:34:26,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:34:26,297 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-12-02 02:34:26,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:34:26,297 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 02:34:26,297 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 88 with the following transitions: [2018-12-02 02:34:26,297 INFO L205 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-12-02 02:34:26,298 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 02:34:26,298 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 02:34:26,347 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 02:34:26,347 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-12-02 02:34:26,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:34:26,349 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 02:34:26,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:34:26,349 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cd633a7e-c595-4193-9b27-697cc83fce35/bin-2019/utaipan/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 02:34:26,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:34:26,359 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 02:34:26,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:34:26,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:34:26,399 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-12-02 02:34:26,399 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 02:34:26,447 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-12-02 02:34:26,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 02:34:26,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-02 02:34:26,462 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 02:34:26,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 02:34:26,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 02:34:26,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-02 02:34:26,462 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand 7 states. [2018-12-02 02:34:26,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:34:26,479 INFO L93 Difference]: Finished difference Result 99 states and 103 transitions. [2018-12-02 02:34:26,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 02:34:26,480 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 87 [2018-12-02 02:34:26,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:34:26,480 INFO L225 Difference]: With dead ends: 99 [2018-12-02 02:34:26,480 INFO L226 Difference]: Without dead ends: 99 [2018-12-02 02:34:26,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 170 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-12-02 02:34:26,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-02 02:34:26,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2018-12-02 02:34:26,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-02 02:34:26,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2018-12-02 02:34:26,482 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 87 [2018-12-02 02:34:26,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:34:26,482 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2018-12-02 02:34:26,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 02:34:26,482 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2018-12-02 02:34:26,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-02 02:34:26,482 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:34:26,482 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 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-12-02 02:34:26,483 INFO L423 AbstractCegarLoop]: === Iteration 27 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-12-02 02:34:26,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:34:26,483 INFO L82 PathProgramCache]: Analyzing trace with hash -383950776, now seen corresponding path program 2 times [2018-12-02 02:34:26,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:34:26,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:34:26,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:34:26,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:34:26,483 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:34:26,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:34:26,515 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-12-02 02:34:26,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:34:26,516 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 02:34:26,516 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 02:34:26,516 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 02:34:26,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:34:26,516 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cd633a7e-c595-4193-9b27-697cc83fce35/bin-2019/utaipan/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 02:34:26,522 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 02:34:26,523 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 02:34:26,541 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-12-02 02:34:26,541 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 02:34:26,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:34:26,545 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 46 treesize of output 42 [2018-12-02 02:34:26,557 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:26,561 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 39 treesize of output 52 [2018-12-02 02:34:26,593 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:26,594 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:26,594 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 37 treesize of output 50 [2018-12-02 02:34:26,596 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 35 treesize of output 45 [2018-12-02 02:34:26,612 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:26,613 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:26,614 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:26,614 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:26,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 32 [2018-12-02 02:34:26,615 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 02:34:26,624 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:26,631 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:26,646 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:26,648 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:26,649 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:26,653 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 39 treesize of output 60 [2018-12-02 02:34:26,655 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 54 treesize of output 49 [2018-12-02 02:34:26,672 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:26,673 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:26,674 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:26,674 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:26,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 32 [2018-12-02 02:34:26,675 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 02:34:26,683 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:26,702 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:26,702 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:26,704 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:26,704 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:26,706 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:26,710 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 2 case distinctions, treesize of input 32 treesize of output 59 [2018-12-02 02:34:26,755 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:26,756 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:26,756 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:26,757 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:26,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 40 treesize of output 40 [2018-12-02 02:34:26,757 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 02:34:26,778 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:26,779 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:26,779 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:26,780 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:26,781 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:26,781 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:26,782 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:26,782 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-12-02 02:34:26,782 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-02 02:34:26,802 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:26,819 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 02:34:26,831 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:26,837 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:26,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-12-02 02:34:26,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2018-12-02 02:34:26,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-12-02 02:34:26,852 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 25 treesize of output 39 [2018-12-02 02:34:26,856 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:34:26,856 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 27 treesize of output 60 [2018-12-02 02:34:26,857 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-02 02:34:26,867 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:26,874 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:26,879 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:26,884 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:34:26,894 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-12-02 02:34:26,895 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:67, output treesize:41 [2018-12-02 02:34:27,030 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2018-12-02 02:34:27,030 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 02:34:27,136 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 18 [2018-12-02 02:34:27,196 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-02 02:34:27,216 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-02 02:34:27,265 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2018-12-02 02:34:27,280 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 02:34:27,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [7] total 17 [2018-12-02 02:34:27,280 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:34:27,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 02:34:27,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 02:34:27,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2018-12-02 02:34:27,280 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 7 states. [2018-12-02 02:34:27,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:34:27,431 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2018-12-02 02:34:27,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 02:34:27,431 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2018-12-02 02:34:27,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:34:27,432 INFO L225 Difference]: With dead ends: 95 [2018-12-02 02:34:27,432 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 02:34:27,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 173 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2018-12-02 02:34:27,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 02:34:27,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 02:34:27,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 02:34:27,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 02:34:27,433 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 92 [2018-12-02 02:34:27,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:34:27,433 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 02:34:27,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 02:34:27,433 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 02:34:27,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 02:34:27,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 02:34:27 BoogieIcfgContainer [2018-12-02 02:34:27,438 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 02:34:27,438 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 02:34:27,438 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 02:34:27,439 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 02:34:27,439 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:34:12" (3/4) ... [2018-12-02 02:34:27,442 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 02:34:27,448 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 02:34:27,449 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure getNumbers3 [2018-12-02 02:34:27,449 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure getNumbers2 [2018-12-02 02:34:27,449 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure getNumbers4 [2018-12-02 02:34:27,449 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 02:34:27,449 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure getNumbers [2018-12-02 02:34:27,454 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 39 nodes and edges [2018-12-02 02:34:27,454 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2018-12-02 02:34:27,454 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-12-02 02:34:27,455 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-02 02:34:27,480 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_cd633a7e-c595-4193-9b27-697cc83fce35/bin-2019/utaipan/witness.graphml [2018-12-02 02:34:27,480 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 02:34:27,481 INFO L168 Benchmark]: Toolchain (without parser) took 15800.23 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 501.7 MB). Free memory was 949.7 MB in the beginning and 913.5 MB in the end (delta: 36.2 MB). Peak memory consumption was 537.9 MB. Max. memory is 11.5 GB. [2018-12-02 02:34:27,482 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 02:34:27,482 INFO L168 Benchmark]: CACSL2BoogieTranslator took 145.51 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 938.9 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. [2018-12-02 02:34:27,482 INFO L168 Benchmark]: Boogie Procedure Inliner took 15.41 ms. Allocated memory is still 1.0 GB. Free memory was 938.9 MB in the beginning and 936.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 02:34:27,482 INFO L168 Benchmark]: Boogie Preprocessor took 50.77 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 936.2 MB in the beginning and 1.1 GB in the end (delta: -166.8 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2018-12-02 02:34:27,482 INFO L168 Benchmark]: RCFGBuilder took 220.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 35.2 MB). Peak memory consumption was 35.2 MB. Max. memory is 11.5 GB. [2018-12-02 02:34:27,482 INFO L168 Benchmark]: TraceAbstraction took 15322.65 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 393.7 MB). Free memory was 1.1 GB in the beginning and 913.5 MB in the end (delta: 154.3 MB). Peak memory consumption was 548.0 MB. Max. memory is 11.5 GB. [2018-12-02 02:34:27,482 INFO L168 Benchmark]: Witness Printer took 42.14 ms. Allocated memory is still 1.5 GB. Free memory is still 913.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 02:34:27,483 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 145.51 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 938.9 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 15.41 ms. Allocated memory is still 1.0 GB. Free memory was 938.9 MB in the beginning and 936.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.77 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 936.2 MB in the beginning and 1.1 GB in the end (delta: -166.8 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 220.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 35.2 MB). Peak memory consumption was 35.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15322.65 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 393.7 MB). Free memory was 1.1 GB in the beginning and 913.5 MB in the end (delta: 154.3 MB). Peak memory consumption was 548.0 MB. Max. memory is 11.5 GB. * Witness Printer took 42.14 ms. Allocated memory is still 1.5 GB. Free memory is still 913.5 MB. There was no memory consumed. 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: 43]: all allocated memory was freed For all program executions holds that all allocated memory was freed 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: 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, 15.2s OverallTime, 27 OverallIterations, 10 TraceHistogramMax, 1.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1326 SDtfs, 908 SDslu, 3287 SDs, 0 SdLazy, 1340 SolverSat, 68 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2399 GetRequests, 2092 SyntacticMatches, 36 SemanticMatches, 271 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 843 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred in iteration=26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.5s AbstIntTime, 11 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 27 MinimizatonAttempts, 25 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 11.6s InterpolantComputationTime, 2456 NumberOfCodeBlocks, 2129 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 3492 ConstructedInterpolants, 611 QuantifiedInterpolants, 2794584 SizeOfPredicates, 81 NumberOfNonLiveVariables, 5680 ConjunctsInSsa, 250 ConjunctsInUnsatCore, 69 InterpolantComputations, 26 PerfectInterpolantSequences, 4338/6066 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...