./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i --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_26d0c09a-1514-4829-8e92-5f506d595e6a/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_26d0c09a-1514-4829-8e92-5f506d595e6a/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_26d0c09a-1514-4829-8e92-5f506d595e6a/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_26d0c09a-1514-4829-8e92-5f506d595e6a/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_26d0c09a-1514-4829-8e92-5f506d595e6a/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_26d0c09a-1514-4829-8e92-5f506d595e6a/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 0b29929f70f48b1f1b1180a065dc51df3698b29b ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 12:11:07,583 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 12:11:07,584 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 12:11:07,591 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 12:11:07,591 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 12:11:07,592 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 12:11:07,593 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 12:11:07,594 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 12:11:07,595 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 12:11:07,595 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 12:11:07,596 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 12:11:07,596 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 12:11:07,597 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 12:11:07,597 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 12:11:07,598 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 12:11:07,599 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 12:11:07,599 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 12:11:07,600 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 12:11:07,602 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 12:11:07,603 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 12:11:07,603 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 12:11:07,604 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 12:11:07,606 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 12:11:07,606 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 12:11:07,606 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 12:11:07,607 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 12:11:07,608 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 12:11:07,608 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 12:11:07,609 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 12:11:07,609 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 12:11:07,610 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 12:11:07,610 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 12:11:07,610 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 12:11:07,610 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 12:11:07,611 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 12:11:07,611 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 12:11:07,612 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_26d0c09a-1514-4829-8e92-5f506d595e6a/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-02 12:11:07,620 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 12:11:07,620 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 12:11:07,621 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 12:11:07,621 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 12:11:07,621 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 12:11:07,621 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 12:11:07,622 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 12:11:07,622 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 12:11:07,622 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 12:11:07,622 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 12:11:07,622 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 12:11:07,622 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 12:11:07,622 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 12:11:07,623 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 12:11:07,623 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 12:11:07,623 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 12:11:07,623 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 12:11:07,623 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 12:11:07,623 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 12:11:07,624 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 12:11:07,624 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 12:11:07,624 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-02 12:11:07,624 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-02 12:11:07,624 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-02 12:11:07,624 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 12:11:07,624 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 12:11:07,624 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 12:11:07,624 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 12:11:07,625 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 12:11:07,625 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 12:11:07,625 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 12:11:07,625 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 12:11:07,625 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 12:11:07,625 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 12:11:07,625 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 12:11:07,625 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 12:11:07,625 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_26d0c09a-1514-4829-8e92-5f506d595e6a/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 -> 0b29929f70f48b1f1b1180a065dc51df3698b29b [2018-12-02 12:11:07,647 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 12:11:07,654 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 12:11:07,656 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 12:11:07,656 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 12:11:07,657 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 12:11:07,657 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_26d0c09a-1514-4829-8e92-5f506d595e6a/bin-2019/utaipan/../../sv-benchmarks/c/array-memsafety/openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-12-02 12:11:07,694 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_26d0c09a-1514-4829-8e92-5f506d595e6a/bin-2019/utaipan/data/5374d1e0d/be780cb40cf8415c859ef8388b68503d/FLAG81f9ced57 [2018-12-02 12:11:08,060 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 12:11:08,061 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_26d0c09a-1514-4829-8e92-5f506d595e6a/sv-benchmarks/c/array-memsafety/openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-12-02 12:11:08,067 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_26d0c09a-1514-4829-8e92-5f506d595e6a/bin-2019/utaipan/data/5374d1e0d/be780cb40cf8415c859ef8388b68503d/FLAG81f9ced57 [2018-12-02 12:11:08,437 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_26d0c09a-1514-4829-8e92-5f506d595e6a/bin-2019/utaipan/data/5374d1e0d/be780cb40cf8415c859ef8388b68503d [2018-12-02 12:11:08,442 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 12:11:08,443 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 12:11:08,444 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 12:11:08,444 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 12:11:08,446 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 12:11:08,447 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:11:08" (1/1) ... [2018-12-02 12:11:08,449 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a970fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:11:08, skipping insertion in model container [2018-12-02 12:11:08,449 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:11:08" (1/1) ... [2018-12-02 12:11:08,453 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 12:11:08,472 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 12:11:08,612 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 12:11:08,653 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 12:11:08,676 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 12:11:08,697 INFO L195 MainTranslator]: Completed translation [2018-12-02 12:11:08,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:11:08 WrapperNode [2018-12-02 12:11:08,697 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 12:11:08,698 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 12:11:08,698 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 12:11:08,698 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 12:11:08,703 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:11:08" (1/1) ... [2018-12-02 12:11:08,711 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:11:08" (1/1) ... [2018-12-02 12:11:08,716 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 12:11:08,716 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 12:11:08,716 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 12:11:08,716 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 12:11:08,721 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:11:08" (1/1) ... [2018-12-02 12:11:08,721 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:11:08" (1/1) ... [2018-12-02 12:11:08,723 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:11:08" (1/1) ... [2018-12-02 12:11:08,723 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:11:08" (1/1) ... [2018-12-02 12:11:08,728 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:11:08" (1/1) ... [2018-12-02 12:11:08,731 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:11:08" (1/1) ... [2018-12-02 12:11:08,732 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:11:08" (1/1) ... [2018-12-02 12:11:08,733 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 12:11:08,734 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 12:11:08,734 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 12:11:08,734 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 12:11:08,734 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:11:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_26d0c09a-1514-4829-8e92-5f506d595e6a/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 12:11:08,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 12:11:08,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 12:11:08,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 12:11:08,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 12:11:08,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 12:11:08,766 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 12:11:08,766 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 12:11:08,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 12:11:08,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-02 12:11:08,766 INFO L130 BoogieDeclarations]: Found specification of procedure cstpncpy [2018-12-02 12:11:08,766 INFO L138 BoogieDeclarations]: Found implementation of procedure cstpncpy [2018-12-02 12:11:08,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 12:11:08,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 12:11:08,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 12:11:08,955 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 12:11:08,955 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-02 12:11:08,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:11:08 BoogieIcfgContainer [2018-12-02 12:11:08,955 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 12:11:08,956 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 12:11:08,956 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 12:11:08,958 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 12:11:08,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 12:11:08" (1/3) ... [2018-12-02 12:11:08,959 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ebc673a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:11:08, skipping insertion in model container [2018-12-02 12:11:08,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:11:08" (2/3) ... [2018-12-02 12:11:08,959 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ebc673a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:11:08, skipping insertion in model container [2018-12-02 12:11:08,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:11:08" (3/3) ... [2018-12-02 12:11:08,961 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-12-02 12:11:08,968 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 12:11:08,972 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2018-12-02 12:11:08,981 INFO L257 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2018-12-02 12:11:08,995 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 12:11:08,995 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-02 12:11:08,995 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 12:11:08,995 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 12:11:08,995 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 12:11:08,995 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 12:11:08,995 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 12:11:08,995 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 12:11:09,004 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2018-12-02 12:11:09,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 12:11:09,009 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:11:09,010 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:11:09,011 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION]=== [2018-12-02 12:11:09,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:11:09,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1596257140, now seen corresponding path program 1 times [2018-12-02 12:11:09,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:11:09,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:11:09,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:11:09,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:11:09,046 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:11:09,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:11:09,115 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 12:11:09,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:11:09,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 12:11:09,117 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:11:09,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 12:11:09,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 12:11:09,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:11:09,135 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 3 states. [2018-12-02 12:11:09,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:11:09,186 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2018-12-02 12:11:09,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 12:11:09,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-02 12:11:09,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:11:09,193 INFO L225 Difference]: With dead ends: 60 [2018-12-02 12:11:09,193 INFO L226 Difference]: Without dead ends: 57 [2018-12-02 12:11:09,194 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 12:11:09,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-02 12:11:09,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-02 12:11:09,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-02 12:11:09,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2018-12-02 12:11:09,216 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 10 [2018-12-02 12:11:09,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:11:09,216 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2018-12-02 12:11:09,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 12:11:09,216 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2018-12-02 12:11:09,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 12:11:09,217 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:11:09,217 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:11:09,217 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION]=== [2018-12-02 12:11:09,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:11:09,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1596257139, now seen corresponding path program 1 times [2018-12-02 12:11:09,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:11:09,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:11:09,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:11:09,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:11:09,218 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:11:09,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:11:09,265 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 12:11:09,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:11:09,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 12:11:09,265 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:11:09,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 12:11:09,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 12:11:09,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:11:09,267 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand 4 states. [2018-12-02 12:11:09,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:11:09,278 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2018-12-02 12:11:09,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 12:11:09,279 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-02 12:11:09,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:11:09,279 INFO L225 Difference]: With dead ends: 56 [2018-12-02 12:11:09,279 INFO L226 Difference]: Without dead ends: 56 [2018-12-02 12:11:09,280 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 12:11:09,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-02 12:11:09,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-12-02 12:11:09,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-02 12:11:09,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2018-12-02 12:11:09,283 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 10 [2018-12-02 12:11:09,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:11:09,283 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2018-12-02 12:11:09,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 12:11:09,283 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2018-12-02 12:11:09,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-02 12:11:09,283 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:11:09,283 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:11:09,284 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION]=== [2018-12-02 12:11:09,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:11:09,284 INFO L82 PathProgramCache]: Analyzing trace with hash -218487363, now seen corresponding path program 1 times [2018-12-02 12:11:09,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:11:09,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:11:09,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:11:09,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:11:09,285 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:11:09,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:11:09,306 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 12:11:09,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:11:09,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 12:11:09,306 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:11:09,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 12:11:09,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 12:11:09,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:11:09,307 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 3 states. [2018-12-02 12:11:09,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:11:09,340 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-12-02 12:11:09,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 12:11:09,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-02 12:11:09,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:11:09,341 INFO L225 Difference]: With dead ends: 50 [2018-12-02 12:11:09,341 INFO L226 Difference]: Without dead ends: 50 [2018-12-02 12:11:09,341 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 12:11:09,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-02 12:11:09,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-12-02 12:11:09,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-02 12:11:09,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-12-02 12:11:09,344 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 13 [2018-12-02 12:11:09,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:11:09,344 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-12-02 12:11:09,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 12:11:09,344 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-12-02 12:11:09,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-02 12:11:09,344 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:11:09,344 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:11:09,345 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION]=== [2018-12-02 12:11:09,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:11:09,345 INFO L82 PathProgramCache]: Analyzing trace with hash -218487362, now seen corresponding path program 1 times [2018-12-02 12:11:09,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:11:09,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:11:09,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:11:09,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:11:09,346 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:11:09,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:11:09,367 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 12:11:09,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:11:09,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 12:11:09,367 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:11:09,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 12:11:09,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 12:11:09,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:11:09,368 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 3 states. [2018-12-02 12:11:09,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:11:09,392 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-12-02 12:11:09,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 12:11:09,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-02 12:11:09,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:11:09,393 INFO L225 Difference]: With dead ends: 44 [2018-12-02 12:11:09,393 INFO L226 Difference]: Without dead ends: 44 [2018-12-02 12:11:09,394 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 12:11:09,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-02 12:11:09,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-02 12:11:09,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-02 12:11:09,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-12-02 12:11:09,396 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 13 [2018-12-02 12:11:09,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:11:09,396 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-12-02 12:11:09,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 12:11:09,396 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-12-02 12:11:09,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 12:11:09,396 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:11:09,396 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:11:09,396 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION]=== [2018-12-02 12:11:09,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:11:09,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1112925276, now seen corresponding path program 1 times [2018-12-02 12:11:09,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:11:09,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:11:09,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:11:09,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:11:09,397 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:11:09,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:11:09,444 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 12:11:09,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:11:09,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:11:09,444 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:11:09,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:11:09,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:11:09,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:11:09,445 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 6 states. [2018-12-02 12:11:09,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:11:09,482 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2018-12-02 12:11:09,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 12:11:09,483 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-12-02 12:11:09,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:11:09,483 INFO L225 Difference]: With dead ends: 59 [2018-12-02 12:11:09,483 INFO L226 Difference]: Without dead ends: 55 [2018-12-02 12:11:09,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:11:09,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-02 12:11:09,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 44. [2018-12-02 12:11:09,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-02 12:11:09,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-12-02 12:11:09,486 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 21 [2018-12-02 12:11:09,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:11:09,486 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-12-02 12:11:09,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:11:09,486 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-12-02 12:11:09,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 12:11:09,486 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:11:09,486 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:11:09,487 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION]=== [2018-12-02 12:11:09,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:11:09,487 INFO L82 PathProgramCache]: Analyzing trace with hash -713272887, now seen corresponding path program 1 times [2018-12-02 12:11:09,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:11:09,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:11:09,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:11:09,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:11:09,487 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:11:09,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:11:09,581 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 12:11:09,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:11:09,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 12:11:09,581 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:11:09,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 12:11:09,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 12:11:09,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-02 12:11:09,582 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 10 states. [2018-12-02 12:11:09,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:11:09,680 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-12-02 12:11:09,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 12:11:09,680 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-12-02 12:11:09,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:11:09,681 INFO L225 Difference]: With dead ends: 43 [2018-12-02 12:11:09,681 INFO L226 Difference]: Without dead ends: 43 [2018-12-02 12:11:09,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-12-02 12:11:09,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-02 12:11:09,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-02 12:11:09,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-02 12:11:09,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-12-02 12:11:09,683 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 22 [2018-12-02 12:11:09,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:11:09,683 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-12-02 12:11:09,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 12:11:09,683 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-12-02 12:11:09,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 12:11:09,684 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:11:09,684 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:11:09,684 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION]=== [2018-12-02 12:11:09,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:11:09,684 INFO L82 PathProgramCache]: Analyzing trace with hash -713272886, now seen corresponding path program 1 times [2018-12-02 12:11:09,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:11:09,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:11:09,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:11:09,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:11:09,685 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:11:09,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:11:09,766 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 12:11:09,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:11:09,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 12:11:09,767 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:11:09,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 12:11:09,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 12:11:09,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-02 12:11:09,768 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 10 states. [2018-12-02 12:11:09,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:11:09,937 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-12-02 12:11:09,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 12:11:09,937 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-12-02 12:11:09,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:11:09,938 INFO L225 Difference]: With dead ends: 49 [2018-12-02 12:11:09,938 INFO L226 Difference]: Without dead ends: 49 [2018-12-02 12:11:09,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-12-02 12:11:09,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-02 12:11:09,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2018-12-02 12:11:09,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-02 12:11:09,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-12-02 12:11:09,941 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 22 [2018-12-02 12:11:09,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:11:09,941 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-12-02 12:11:09,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 12:11:09,941 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-12-02 12:11:09,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 12:11:09,941 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:11:09,941 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:11:09,942 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION]=== [2018-12-02 12:11:09,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:11:09,942 INFO L82 PathProgramCache]: Analyzing trace with hash -636622995, now seen corresponding path program 1 times [2018-12-02 12:11:09,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:11:09,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:11:09,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:11:09,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:11:09,943 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:11:09,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:11:10,067 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 12:11:10,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:11:10,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 12:11:10,068 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:11:10,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 12:11:10,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 12:11:10,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-02 12:11:10,068 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 9 states. [2018-12-02 12:11:10,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:11:10,230 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-12-02 12:11:10,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 12:11:10,230 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-12-02 12:11:10,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:11:10,230 INFO L225 Difference]: With dead ends: 51 [2018-12-02 12:11:10,230 INFO L226 Difference]: Without dead ends: 51 [2018-12-02 12:11:10,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2018-12-02 12:11:10,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-02 12:11:10,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 44. [2018-12-02 12:11:10,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-02 12:11:10,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-12-02 12:11:10,233 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 23 [2018-12-02 12:11:10,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:11:10,233 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-12-02 12:11:10,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 12:11:10,233 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-12-02 12:11:10,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 12:11:10,233 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:11:10,233 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:11:10,234 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION]=== [2018-12-02 12:11:10,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:11:10,234 INFO L82 PathProgramCache]: Analyzing trace with hash -636622994, now seen corresponding path program 1 times [2018-12-02 12:11:10,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:11:10,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:11:10,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:11:10,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:11:10,235 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:11:10,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:11:10,418 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 12:11:10,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:11:10,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 12:11:10,418 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:11:10,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 12:11:10,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 12:11:10,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-12-02 12:11:10,419 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 11 states. [2018-12-02 12:11:10,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:11:10,581 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-12-02 12:11:10,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 12:11:10,582 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2018-12-02 12:11:10,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:11:10,582 INFO L225 Difference]: With dead ends: 46 [2018-12-02 12:11:10,582 INFO L226 Difference]: Without dead ends: 46 [2018-12-02 12:11:10,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2018-12-02 12:11:10,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-02 12:11:10,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-12-02 12:11:10,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-02 12:11:10,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-12-02 12:11:10,585 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 23 [2018-12-02 12:11:10,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:11:10,585 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-12-02 12:11:10,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 12:11:10,585 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-12-02 12:11:10,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 12:11:10,585 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:11:10,585 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:11:10,586 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION]=== [2018-12-02 12:11:10,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:11:10,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1360294422, now seen corresponding path program 1 times [2018-12-02 12:11:10,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:11:10,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:11:10,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:11:10,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:11:10,587 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:11:10,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:11:10,617 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 12:11:10,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:11:10,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 12:11:10,618 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:11:10,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 12:11:10,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:11:10,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:11:10,618 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 5 states. [2018-12-02 12:11:10,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:11:10,662 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-12-02 12:11:10,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 12:11:10,662 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-12-02 12:11:10,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:11:10,662 INFO L225 Difference]: With dead ends: 44 [2018-12-02 12:11:10,662 INFO L226 Difference]: Without dead ends: 44 [2018-12-02 12:11:10,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:11:10,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-02 12:11:10,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-02 12:11:10,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-02 12:11:10,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-12-02 12:11:10,665 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 28 [2018-12-02 12:11:10,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:11:10,665 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-12-02 12:11:10,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 12:11:10,665 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-12-02 12:11:10,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 12:11:10,666 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:11:10,666 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:11:10,666 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION]=== [2018-12-02 12:11:10,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:11:10,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1360294423, now seen corresponding path program 1 times [2018-12-02 12:11:10,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:11:10,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:11:10,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:11:10,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:11:10,667 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:11:10,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:11:11,003 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 12:11:11,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:11:11,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-12-02 12:11:11,003 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:11:11,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-02 12:11:11,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-02 12:11:11,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-12-02 12:11:11,004 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 17 states. [2018-12-02 12:11:11,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:11:11,605 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2018-12-02 12:11:11,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-02 12:11:11,606 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 28 [2018-12-02 12:11:11,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:11:11,606 INFO L225 Difference]: With dead ends: 51 [2018-12-02 12:11:11,606 INFO L226 Difference]: Without dead ends: 51 [2018-12-02 12:11:11,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=112, Invalid=700, Unknown=0, NotChecked=0, Total=812 [2018-12-02 12:11:11,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-02 12:11:11,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2018-12-02 12:11:11,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-02 12:11:11,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2018-12-02 12:11:11,608 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 28 [2018-12-02 12:11:11,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:11:11,608 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2018-12-02 12:11:11,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-02 12:11:11,609 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-12-02 12:11:11,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 12:11:11,609 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:11:11,609 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:11:11,609 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION]=== [2018-12-02 12:11:11,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:11:11,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1381316555, now seen corresponding path program 1 times [2018-12-02 12:11:11,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:11:11,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:11:11,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:11:11,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:11:11,610 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:11:11,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:11:11,713 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:11:11,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:11:11,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-02 12:11:11,714 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:11:11,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 12:11:11,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 12:11:11,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-12-02 12:11:11,714 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 12 states. [2018-12-02 12:11:11,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:11:11,879 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2018-12-02 12:11:11,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 12:11:11,879 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-12-02 12:11:11,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:11:11,880 INFO L225 Difference]: With dead ends: 82 [2018-12-02 12:11:11,880 INFO L226 Difference]: Without dead ends: 82 [2018-12-02 12:11:11,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2018-12-02 12:11:11,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-02 12:11:11,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2018-12-02 12:11:11,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-02 12:11:11,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2018-12-02 12:11:11,884 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 28 [2018-12-02 12:11:11,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:11:11,884 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2018-12-02 12:11:11,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 12:11:11,884 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2018-12-02 12:11:11,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 12:11:11,885 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:11:11,885 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:11:11,885 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION]=== [2018-12-02 12:11:11,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:11:11,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1600171273, now seen corresponding path program 1 times [2018-12-02 12:11:11,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:11:11,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:11:11,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:11:11,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:11:11,887 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:11:11,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:11:12,054 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 12:11:12,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:11:12,055 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 12:11:12,055 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-12-02 12:11:12,056 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [10], [16], [18], [19], [26], [27], [30], [33], [34], [37], [38], [41], [44], [48], [49], [51], [52], [79], [81], [86], [98], [99], [100], [102] [2018-12-02 12:11:12,076 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 12:11:12,076 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 12:11:12,209 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 12:11:12,209 INFO L272 AbstractInterpreter]: Visited 27 different actions 46 times. Merged at 7 different actions 19 times. Never widened. Performed 452 root evaluator evaluations with a maximum evaluation depth of 4. Performed 452 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-12-02 12:11:12,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:11:12,221 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 12:11:12,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:11:12,221 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_26d0c09a-1514-4829-8e92-5f506d595e6a/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 12:11:12,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:11:12,229 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 12:11:12,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:11:12,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:11:12,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-02 12:11:12,288 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-02 12:11:12,289 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:12,291 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:12,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:11:12,306 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-12-02 12:11:12,351 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:11:12,353 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:11:12,353 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:12,372 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:11:12,373 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:11:12,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 12:11:12,374 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:12,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 12:11:12,382 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:40, output treesize:33 [2018-12-02 12:11:12,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 26 treesize of output 27 [2018-12-02 12:11:12,410 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-12-02 12:11:12,410 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:12,414 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:12,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 12:11:12,424 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:33 [2018-12-02 12:11:12,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 26 treesize of output 27 [2018-12-02 12:11:12,486 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-12-02 12:11:12,486 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:12,489 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:12,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-02 12:11:12,495 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:48, output treesize:33 [2018-12-02 12:11:12,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 20 treesize of output 16 [2018-12-02 12:11:12,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-12-02 12:11:12,569 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 12:11:12,572 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 12:11:12,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-02 12:11:12,582 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:47 [2018-12-02 12:11:12,692 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 12:11:12,693 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 12:11:12,835 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:11:12,837 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:11:12,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 12:11:12,849 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-12-02 12:11:12,999 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:11:13,001 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:11:13,002 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:13,005 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:13,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 9 dim-0 vars, and 4 xjuncts. [2018-12-02 12:11:13,018 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:49, output treesize:123 [2018-12-02 12:11:13,205 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 12:11:13,206 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 12:11:13,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-12-02 12:11:13,206 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:13,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 15 treesize of output 11 [2018-12-02 12:11:13,224 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:13,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2018-12-02 12:11:13,246 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-02 12:11:13,246 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:13,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 17 [2018-12-02 12:11:13,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2018-12-02 12:11:13,255 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:13,256 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:13,258 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:13,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:13,263 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:78, output treesize:7 [2018-12-02 12:11:13,269 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 12:11:13,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 12:11:13,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 34 [2018-12-02 12:11:13,284 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 12:11:13,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-02 12:11:13,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-02 12:11:13,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1081, Unknown=0, NotChecked=0, Total=1190 [2018-12-02 12:11:13,285 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand 24 states. [2018-12-02 12:11:14,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:11:14,386 INFO L93 Difference]: Finished difference Result 89 states and 101 transitions. [2018-12-02 12:11:14,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 12:11:14,386 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 28 [2018-12-02 12:11:14,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:11:14,387 INFO L225 Difference]: With dead ends: 89 [2018-12-02 12:11:14,387 INFO L226 Difference]: Without dead ends: 89 [2018-12-02 12:11:14,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=220, Invalid=1586, Unknown=0, NotChecked=0, Total=1806 [2018-12-02 12:11:14,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-02 12:11:14,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 82. [2018-12-02 12:11:14,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-02 12:11:14,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2018-12-02 12:11:14,391 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 93 transitions. Word has length 28 [2018-12-02 12:11:14,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:11:14,391 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 93 transitions. [2018-12-02 12:11:14,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-02 12:11:14,391 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2018-12-02 12:11:14,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-02 12:11:14,391 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:11:14,392 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:11:14,392 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION]=== [2018-12-02 12:11:14,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:11:14,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1934298097, now seen corresponding path program 1 times [2018-12-02 12:11:14,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:11:14,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:11:14,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:11:14,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:11:14,393 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:11:14,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:11:14,714 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:11:14,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:11:14,714 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 12:11:14,714 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-12-02 12:11:14,714 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [10], [16], [18], [19], [26], [27], [30], [33], [34], [37], [38], [41], [44], [48], [49], [52], [54], [79], [81], [86], [98], [99], [100], [102] [2018-12-02 12:11:14,715 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 12:11:14,715 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 12:11:14,792 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 12:11:14,792 INFO L272 AbstractInterpreter]: Visited 27 different actions 46 times. Merged at 7 different actions 19 times. Never widened. Performed 456 root evaluator evaluations with a maximum evaluation depth of 4. Performed 456 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-12-02 12:11:14,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:11:14,796 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 12:11:14,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:11:14,796 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_26d0c09a-1514-4829-8e92-5f506d595e6a/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 12:11:14,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:11:14,804 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 12:11:14,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:11:14,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:11:14,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-02 12:11:14,836 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 12:11:14,836 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:14,840 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:14,850 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:11:14,851 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2018-12-02 12:11:14,852 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-12-02 12:11:14,852 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:14,860 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:14,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:14,865 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:30, output treesize:23 [2018-12-02 12:11:14,909 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:11:14,910 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:11:14,911 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:11:14,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-02 12:11:14,911 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:14,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 12:11:14,918 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:14,923 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:14,924 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-12-02 12:11:14,946 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 12:11:14,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 12:11:14,948 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:14,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:14,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 12:11:14,960 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 12:11:14,960 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:14,961 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:14,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:14,971 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:42 [2018-12-02 12:11:15,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 33 treesize of output 25 [2018-12-02 12:11:15,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2018-12-02 12:11:15,029 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:15,038 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:15,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-02 12:11:15,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 12:11:15,048 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:15,050 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:15,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:11:15,057 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:56, output treesize:26 [2018-12-02 12:11:15,317 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:11:15,318 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 12:11:15,785 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:11:15,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 12:11:15,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 14] total 41 [2018-12-02 12:11:15,800 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 12:11:15,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-02 12:11:15,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-02 12:11:15,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1580, Unknown=0, NotChecked=0, Total=1722 [2018-12-02 12:11:15,801 INFO L87 Difference]: Start difference. First operand 82 states and 93 transitions. Second operand 29 states. [2018-12-02 12:11:16,966 WARN L180 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2018-12-02 12:11:17,293 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2018-12-02 12:11:17,628 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2018-12-02 12:11:18,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:11:18,027 INFO L93 Difference]: Finished difference Result 84 states and 96 transitions. [2018-12-02 12:11:18,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 12:11:18,027 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2018-12-02 12:11:18,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:11:18,028 INFO L225 Difference]: With dead ends: 84 [2018-12-02 12:11:18,028 INFO L226 Difference]: Without dead ends: 84 [2018-12-02 12:11:18,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=400, Invalid=2906, Unknown=0, NotChecked=0, Total=3306 [2018-12-02 12:11:18,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-02 12:11:18,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2018-12-02 12:11:18,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-02 12:11:18,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 94 transitions. [2018-12-02 12:11:18,031 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 94 transitions. Word has length 29 [2018-12-02 12:11:18,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:11:18,032 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 94 transitions. [2018-12-02 12:11:18,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-02 12:11:18,032 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 94 transitions. [2018-12-02 12:11:18,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-02 12:11:18,032 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:11:18,032 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:11:18,032 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION]=== [2018-12-02 12:11:18,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:11:18,033 INFO L82 PathProgramCache]: Analyzing trace with hash -287965233, now seen corresponding path program 1 times [2018-12-02 12:11:18,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:11:18,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:11:18,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:11:18,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:11:18,033 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:11:18,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:11:18,413 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:11:18,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:11:18,413 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 12:11:18,413 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-12-02 12:11:18,413 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [8], [16], [18], [19], [26], [27], [30], [33], [34], [37], [38], [41], [44], [48], [49], [52], [57], [58], [65], [70], [71], [73], [74], [98], [99], [100], [102] [2018-12-02 12:11:18,414 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 12:11:18,414 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 12:11:18,442 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 12:11:18,442 INFO L272 AbstractInterpreter]: Visited 30 different actions 31 times. Merged at 1 different actions 1 times. Never widened. Performed 270 root evaluator evaluations with a maximum evaluation depth of 4. Performed 270 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 40 variables. [2018-12-02 12:11:18,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:11:18,444 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 12:11:18,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:11:18,444 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_26d0c09a-1514-4829-8e92-5f506d595e6a/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 12:11:18,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:11:18,450 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 12:11:18,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:11:18,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:11:18,489 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:11:18,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2018-12-02 12:11:18,492 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-12-02 12:11:18,492 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:18,501 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:18,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-02 12:11:18,509 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 12:11:18,510 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:18,512 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:18,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:11:18,518 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:30, output treesize:23 [2018-12-02 12:11:18,565 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:11:18,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 12:11:18,566 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:18,574 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:11:18,575 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:11:18,575 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:11:18,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-02 12:11:18,576 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:18,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:18,581 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:18 [2018-12-02 12:11:18,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 12:11:18,604 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 12:11:18,604 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:18,606 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:18,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 12:11:18,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 12:11:18,614 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:18,615 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:18,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:18,619 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-12-02 12:11:18,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-12-02 12:11:18,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-12-02 12:11:18,667 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:18,669 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:18,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 11 [2018-12-02 12:11:18,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 12:11:18,677 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:18,678 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:18,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:11:18,682 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-12-02 12:11:18,948 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:11:18,948 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 12:11:19,456 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:11:19,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 12:11:19,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 15] total 46 [2018-12-02 12:11:19,471 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 12:11:19,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-02 12:11:19,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-02 12:11:19,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1988, Unknown=0, NotChecked=0, Total=2162 [2018-12-02 12:11:19,472 INFO L87 Difference]: Start difference. First operand 83 states and 94 transitions. Second operand 33 states. [2018-12-02 12:11:21,000 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2018-12-02 12:11:21,650 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 38 [2018-12-02 12:11:22,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:11:22,439 INFO L93 Difference]: Finished difference Result 127 states and 144 transitions. [2018-12-02 12:11:22,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-02 12:11:22,439 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 32 [2018-12-02 12:11:22,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:11:22,440 INFO L225 Difference]: With dead ends: 127 [2018-12-02 12:11:22,440 INFO L226 Difference]: Without dead ends: 127 [2018-12-02 12:11:22,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1240 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=711, Invalid=5451, Unknown=0, NotChecked=0, Total=6162 [2018-12-02 12:11:22,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-02 12:11:22,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 90. [2018-12-02 12:11:22,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-02 12:11:22,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 103 transitions. [2018-12-02 12:11:22,445 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 103 transitions. Word has length 32 [2018-12-02 12:11:22,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:11:22,445 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 103 transitions. [2018-12-02 12:11:22,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-02 12:11:22,445 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 103 transitions. [2018-12-02 12:11:22,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-02 12:11:22,446 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:11:22,446 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:11:22,446 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION]=== [2018-12-02 12:11:22,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:11:22,446 INFO L82 PathProgramCache]: Analyzing trace with hash 459693359, now seen corresponding path program 1 times [2018-12-02 12:11:22,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:11:22,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:11:22,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:11:22,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:11:22,447 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:11:22,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:11:22,622 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 12:11:22,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:11:22,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 12:11:22,623 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:11:22,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 12:11:22,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 12:11:22,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-12-02 12:11:22,623 INFO L87 Difference]: Start difference. First operand 90 states and 103 transitions. Second operand 11 states. [2018-12-02 12:11:22,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:11:22,718 INFO L93 Difference]: Finished difference Result 103 states and 119 transitions. [2018-12-02 12:11:22,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 12:11:22,719 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-12-02 12:11:22,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:11:22,719 INFO L225 Difference]: With dead ends: 103 [2018-12-02 12:11:22,719 INFO L226 Difference]: Without dead ends: 56 [2018-12-02 12:11:22,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-12-02 12:11:22,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-02 12:11:22,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2018-12-02 12:11:22,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-02 12:11:22,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-12-02 12:11:22,720 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 32 [2018-12-02 12:11:22,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:11:22,721 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-12-02 12:11:22,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 12:11:22,721 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-12-02 12:11:22,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-02 12:11:22,721 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:11:22,721 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:11:22,721 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION]=== [2018-12-02 12:11:22,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:11:22,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1146019306, now seen corresponding path program 1 times [2018-12-02 12:11:22,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:11:22,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:11:22,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:11:22,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:11:22,722 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:11:22,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:11:23,086 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:11:23,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:11:23,087 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 12:11:23,087 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-12-02 12:11:23,087 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [10], [16], [18], [19], [26], [27], [30], [33], [34], [37], [38], [41], [44], [48], [49], [52], [57], [58], [65], [70], [73], [79], [81], [86], [98], [99], [100], [102] [2018-12-02 12:11:23,088 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 12:11:23,088 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 12:11:23,129 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 12:11:23,129 INFO L272 AbstractInterpreter]: Visited 31 different actions 58 times. Merged at 11 different actions 26 times. Never widened. Performed 564 root evaluator evaluations with a maximum evaluation depth of 4. Performed 564 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 2 fixpoints after 2 different actions. Largest state had 41 variables. [2018-12-02 12:11:23,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:11:23,130 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 12:11:23,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:11:23,130 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_26d0c09a-1514-4829-8e92-5f506d595e6a/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 12:11:23,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:11:23,138 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 12:11:23,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:11:23,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:11:23,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-02 12:11:23,180 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 12:11:23,180 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:23,188 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:23,196 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:11:23,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2018-12-02 12:11:23,198 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-12-02 12:11:23,199 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:23,202 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:23,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:11:23,209 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:30, output treesize:23 [2018-12-02 12:11:23,262 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:11:23,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 12:11:23,263 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:23,271 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:11:23,271 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:11:23,272 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:11:23,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-02 12:11:23,273 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:23,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:23,278 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:18 [2018-12-02 12:11:23,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 12:11:23,301 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 12:11:23,301 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:23,302 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:23,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 12:11:23,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 12:11:23,310 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:23,311 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:23,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:23,315 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-12-02 12:11:23,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-12-02 12:11:23,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-12-02 12:11:23,358 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:23,360 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:23,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 11 [2018-12-02 12:11:23,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 12:11:23,369 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:23,369 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:23,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:11:23,373 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-12-02 12:11:23,641 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:11:23,641 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 12:11:24,135 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:11:24,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 12:11:24,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 45 [2018-12-02 12:11:24,150 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 12:11:24,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-02 12:11:24,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-02 12:11:24,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1904, Unknown=0, NotChecked=0, Total=2070 [2018-12-02 12:11:24,151 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 32 states. [2018-12-02 12:11:25,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:11:25,462 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2018-12-02 12:11:25,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-02 12:11:25,462 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 34 [2018-12-02 12:11:25,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:11:25,463 INFO L225 Difference]: With dead ends: 52 [2018-12-02 12:11:25,463 INFO L226 Difference]: Without dead ends: 39 [2018-12-02 12:11:25,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 843 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=536, Invalid=4020, Unknown=0, NotChecked=0, Total=4556 [2018-12-02 12:11:25,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-02 12:11:25,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-12-02 12:11:25,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-02 12:11:25,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-12-02 12:11:25,465 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2018-12-02 12:11:25,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:11:25,465 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-12-02 12:11:25,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-02 12:11:25,466 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-12-02 12:11:25,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-02 12:11:25,466 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:11:25,466 INFO L402 BasicCegarLoop]: trace histogram [3, 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] [2018-12-02 12:11:25,466 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION]=== [2018-12-02 12:11:25,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:11:25,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1124997174, now seen corresponding path program 2 times [2018-12-02 12:11:25,467 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:11:25,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:11:25,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:11:25,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:11:25,467 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:11:25,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:11:25,783 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:11:25,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:11:25,783 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 12:11:25,783 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 12:11:25,783 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 12:11:25,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:11:25,784 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_26d0c09a-1514-4829-8e92-5f506d595e6a/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 12:11:25,790 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 12:11:25,791 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 12:11:25,823 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-02 12:11:25,824 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 12:11:25,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:11:25,836 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:11:25,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2018-12-02 12:11:25,838 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-12-02 12:11:25,839 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:25,842 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:25,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-02 12:11:25,852 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 12:11:25,852 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:25,855 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:25,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:25,861 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:26 [2018-12-02 12:11:25,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-02 12:11:25,883 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-12-02 12:11:25,883 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:25,884 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:25,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:25,889 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2018-12-02 12:11:25,933 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:11:25,934 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:11:25,934 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:11:25,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-02 12:11:25,935 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:25,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-12-02 12:11:25,944 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:25,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:25,951 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2018-12-02 12:11:25,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 12:11:25,979 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 12:11:25,979 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:25,981 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:25,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 29 [2018-12-02 12:11:25,997 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-12-02 12:11:25,997 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:26,000 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:26,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 12:11:26,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 12:11:26,011 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:26,012 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:26,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:26,020 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:70, output treesize:48 [2018-12-02 12:11:26,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-12-02 12:11:26,077 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-12-02 12:11:26,078 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:26,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:26,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-02 12:11:26,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 12:11:26,092 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:26,093 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:26,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:26,106 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:62, output treesize:36 [2018-12-02 12:11:26,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-12-02 12:11:26,161 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-12-02 12:11:26,161 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:26,164 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:26,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:11:26,170 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:35 [2018-12-02 12:11:26,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 24 [2018-12-02 12:11:26,301 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 12:11:26,301 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:26,311 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:26,327 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:11:26,327 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:35 [2018-12-02 12:11:26,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 19 treesize of output 15 [2018-12-02 12:11:26,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-12-02 12:11:26,406 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 12:11:26,408 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 12:11:26,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-02 12:11:26,414 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:48 [2018-12-02 12:11:26,506 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:11:26,507 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 12:11:26,790 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:26,794 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:26,795 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:11:26,800 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:11:26,800 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:11:26,805 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:11:26,806 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:11:26,813 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:11:26,868 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:11:26,873 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:11:26,874 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:11:26,879 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:11:26,879 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:26,884 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:26,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 7 xjuncts. [2018-12-02 12:11:26,927 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 4 variables, input treesize:95, output treesize:219 [2018-12-02 12:11:27,338 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:27,342 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:27,459 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:11:27,464 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:11:27,465 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:11:27,470 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:11:27,471 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:27,477 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:27,589 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:11:27,594 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:11:27,595 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:27,599 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:27,600 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:11:27,604 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:11:27,668 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:27,672 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:27,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-2 vars, End of recursive call: 8 dim-0 vars, and 8 xjuncts. [2018-12-02 12:11:27,722 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 10 variables, input treesize:175, output treesize:225 [2018-12-02 12:11:28,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 62 [2018-12-02 12:11:28,147 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-02 12:11:28,148 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:28,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-12-02 12:11:28,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2018-12-02 12:11:28,158 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:28,160 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:28,166 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:28,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 67 [2018-12-02 12:11:28,230 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-02 12:11:28,230 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:28,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-12-02 12:11:28,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2018-12-02 12:11:28,241 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:28,242 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:28,248 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:28,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-12-02 12:11:28,278 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 10 variables, input treesize:268, output treesize:159 [2018-12-02 12:11:28,375 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:11:28,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 12:11:28,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 47 [2018-12-02 12:11:28,390 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 12:11:28,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-02 12:11:28,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-02 12:11:28,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=2089, Unknown=0, NotChecked=0, Total=2256 [2018-12-02 12:11:28,391 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 33 states. [2018-12-02 12:11:29,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:11:29,360 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2018-12-02 12:11:29,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-02 12:11:29,361 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 34 [2018-12-02 12:11:29,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:11:29,361 INFO L225 Difference]: With dead ends: 45 [2018-12-02 12:11:29,361 INFO L226 Difference]: Without dead ends: 45 [2018-12-02 12:11:29,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 893 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=352, Invalid=3308, Unknown=0, NotChecked=0, Total=3660 [2018-12-02 12:11:29,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-02 12:11:29,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-12-02 12:11:29,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-02 12:11:29,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-12-02 12:11:29,364 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 34 [2018-12-02 12:11:29,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:11:29,364 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-12-02 12:11:29,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-02 12:11:29,364 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-12-02 12:11:29,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-02 12:11:29,365 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:11:29,365 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-12-02 12:11:29,365 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION]=== [2018-12-02 12:11:29,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:11:29,365 INFO L82 PathProgramCache]: Analyzing trace with hash -515174034, now seen corresponding path program 2 times [2018-12-02 12:11:29,365 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:11:29,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:11:29,366 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 12:11:29,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:11:29,366 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:11:29,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:11:29,762 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 12:11:29,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:11:29,762 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 12:11:29,763 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 12:11:29,763 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 12:11:29,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:11:29,763 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_26d0c09a-1514-4829-8e92-5f506d595e6a/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 12:11:29,769 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 12:11:29,769 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 12:11:29,801 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-02 12:11:29,801 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 12:11:29,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:11:29,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-02 12:11:29,827 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 12:11:29,828 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:29,831 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:29,838 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:11:29,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2018-12-02 12:11:29,840 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-12-02 12:11:29,841 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:29,843 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:29,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:29,849 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:30, output treesize:23 [2018-12-02 12:11:29,916 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:11:29,917 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 12:11:29,917 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:29,926 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:11:29,926 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:11:29,927 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:11:29,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-02 12:11:29,927 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:29,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:29,932 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:18 [2018-12-02 12:11:29,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 12:11:29,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 12:11:29,955 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:29,956 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:29,962 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 12:11:29,963 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 12:11:29,964 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:29,965 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:29,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:29,969 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-12-02 12:11:30,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-12-02 12:11:30,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-12-02 12:11:30,015 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:30,017 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:30,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 11 [2018-12-02 12:11:30,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 12:11:30,024 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:30,025 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:30,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:11:30,028 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-12-02 12:11:30,555 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 12:11:30,555 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 12:11:31,311 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 12:11:31,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 12:11:31,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 16] total 48 [2018-12-02 12:11:31,326 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 12:11:31,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-02 12:11:31,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-02 12:11:31,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=2176, Unknown=0, NotChecked=0, Total=2352 [2018-12-02 12:11:31,327 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 34 states. [2018-12-02 12:11:31,863 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2018-12-02 12:11:32,179 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2018-12-02 12:11:32,999 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2018-12-02 12:11:33,273 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2018-12-02 12:11:33,573 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 54 [2018-12-02 12:11:33,855 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 38 [2018-12-02 12:11:34,168 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 38 [2018-12-02 12:11:34,579 WARN L180 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 44 [2018-12-02 12:11:34,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:11:34,638 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2018-12-02 12:11:34,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-02 12:11:34,640 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 35 [2018-12-02 12:11:34,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:11:34,641 INFO L225 Difference]: With dead ends: 43 [2018-12-02 12:11:34,641 INFO L226 Difference]: Without dead ends: 43 [2018-12-02 12:11:34,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 918 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=528, Invalid=4302, Unknown=0, NotChecked=0, Total=4830 [2018-12-02 12:11:34,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-02 12:11:34,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2018-12-02 12:11:34,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-02 12:11:34,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-12-02 12:11:34,648 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 35 [2018-12-02 12:11:34,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:11:34,648 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-12-02 12:11:34,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-02 12:11:34,648 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-12-02 12:11:34,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-02 12:11:34,649 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:11:34,649 INFO L402 BasicCegarLoop]: trace histogram [4, 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] [2018-12-02 12:11:34,650 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION]=== [2018-12-02 12:11:34,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:11:34,650 INFO L82 PathProgramCache]: Analyzing trace with hash -188592693, now seen corresponding path program 3 times [2018-12-02 12:11:34,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:11:34,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:11:34,651 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 12:11:34,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:11:34,652 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:11:34,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:11:34,906 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 12:11:34,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:11:34,906 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 12:11:34,906 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 12:11:34,907 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 12:11:34,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:11:34,907 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_26d0c09a-1514-4829-8e92-5f506d595e6a/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 12:11:34,913 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 12:11:34,913 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 12:11:34,941 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 12:11:34,941 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 12:11:34,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:11:34,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-02 12:11:34,953 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 12:11:34,953 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:34,962 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:34,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-02 12:11:34,970 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:34,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:34,974 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 [2018-12-02 12:11:34,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-02 12:11:34,991 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-12-02 12:11:34,991 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:34,992 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:34,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:11:34,997 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-12-02 12:11:35,024 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:11:35,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-12-02 12:11:35,026 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:35,033 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:11:35,033 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:11:35,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 12:11:35,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:35,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:35,038 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:25 [2018-12-02 12:11:35,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-12-02 12:11:35,061 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-12-02 12:11:35,061 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:35,064 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:35,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 12:11:35,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 12:11:35,072 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:35,073 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:35,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:35,079 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:51, output treesize:29 [2018-12-02 12:11:35,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 16 treesize of output 12 [2018-12-02 12:11:35,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-12-02 12:11:35,119 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:35,120 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:35,123 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:35,124 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:25 [2018-12-02 12:11:35,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-12-02 12:11:35,168 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-12-02 12:11:35,168 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:35,170 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:35,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:11:35,174 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:25 [2018-12-02 12:11:35,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-12-02 12:11:35,403 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 12:11:35,404 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:35,419 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:35,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:11:35,434 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:28 [2018-12-02 12:11:35,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-12-02 12:11:35,551 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 12:11:35,551 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:35,556 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:35,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-02 12:11:35,566 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:53, output treesize:49 [2018-12-02 12:11:35,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2018-12-02 12:11:35,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-12-02 12:11:35,894 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:35,911 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:11:35,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 37 [2018-12-02 12:11:35,920 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-02 12:11:35,932 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 12:11:35,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-02 12:11:35,947 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:67, output treesize:74 [2018-12-02 12:11:36,152 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:11:36,153 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 12:11:37,074 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:11:37,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:11:37,081 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:11:37,086 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:11:37,087 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:11:37,091 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:11:37,092 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:11:37,098 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:11:37,099 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:11:37,105 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:11:37,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 33 dim-0 vars, and 8 xjuncts. [2018-12-02 12:11:37,157 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:81, output treesize:657 [2018-12-02 12:11:37,931 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:37,941 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:38,169 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:11:38,202 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:11:38,205 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:11:38,255 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:11:38,257 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:11:38,305 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:11:38,307 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:11:38,344 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:11:38,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-2 vars, End of recursive call: 15 dim-0 vars, and 5 xjuncts. [2018-12-02 12:11:38,572 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 10 variables, input treesize:159, output treesize:260 [2018-12-02 12:11:38,845 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 90 [2018-12-02 12:11:39,157 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 12:11:39,158 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 12:11:39,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 117 [2018-12-02 12:11:39,158 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:39,232 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 12:11:39,232 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 12:11:39,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 161 [2018-12-02 12:11:39,233 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:39,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 85 [2018-12-02 12:11:39,394 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-02 12:11:39,394 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:39,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 28 treesize of output 22 [2018-12-02 12:11:39,408 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 12:11:39,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 26 [2018-12-02 12:11:39,409 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:39,413 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:39,422 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:11:39,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 107 [2018-12-02 12:11:39,453 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-02 12:11:39,453 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:39,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 55 [2018-12-02 12:11:39,479 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-12-02 12:11:39,479 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:39,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2018-12-02 12:11:39,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 36 [2018-12-02 12:11:39,513 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 12:11:39,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 18 [2018-12-02 12:11:39,515 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:39,516 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 12:11:39,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-12-02 12:11:39,518 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:39,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-02 12:11:39,520 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:39,538 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 12:11:39,539 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 12:11:39,540 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 12:11:39,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 23 treesize of output 26 [2018-12-02 12:11:39,541 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:39,542 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 12:11:39,542 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 12:11:39,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-02 12:11:39,543 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:39,551 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 12:11:39,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-12-02 12:11:39,558 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-02 12:11:39,561 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 12:11:39,563 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 12:11:39,573 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 12:11:39,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 14 dim-0 vars, 4 dim-1 vars, 4 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-02 12:11:39,606 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 22 variables, input treesize:393, output treesize:176 [2018-12-02 12:12:11,833 WARN L180 SmtUtils]: Spent 32.14 s on a formula simplification. DAG size of input: 68 DAG size of output: 41 [2018-12-02 12:12:11,850 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:12:11,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 12:12:11,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21, 21] total 58 [2018-12-02 12:12:11,865 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 12:12:11,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-02 12:12:11,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-02 12:12:11,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=3191, Unknown=0, NotChecked=0, Total=3422 [2018-12-02 12:12:11,866 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 39 states. [2018-12-02 12:12:13,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:12:13,652 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2018-12-02 12:12:13,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-02 12:12:13,653 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 40 [2018-12-02 12:12:13,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:12:13,654 INFO L225 Difference]: With dead ends: 42 [2018-12-02 12:12:13,654 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 12:12:13,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1586 ImplicationChecksByTransitivity, 37.0s TimeCoverageRelationStatistics Valid=769, Invalid=5711, Unknown=0, NotChecked=0, Total=6480 [2018-12-02 12:12:13,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 12:12:13,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 12:12:13,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 12:12:13,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 12:12:13,656 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2018-12-02 12:12:13,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:12:13,656 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 12:12:13,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-02 12:12:13,656 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 12:12:13,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 12:12:13,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 12:12:13 BoogieIcfgContainer [2018-12-02 12:12:13,661 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 12:12:13,661 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 12:12:13,661 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 12:12:13,661 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 12:12:13,662 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:11:08" (3/4) ... [2018-12-02 12:12:13,665 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 12:12:13,670 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 12:12:13,671 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 12:12:13,671 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstpncpy [2018-12-02 12:12:13,675 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2018-12-02 12:12:13,675 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-12-02 12:12:13,675 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-02 12:12:13,703 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_26d0c09a-1514-4829-8e92-5f506d595e6a/bin-2019/utaipan/witness.graphml [2018-12-02 12:12:13,703 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 12:12:13,703 INFO L168 Benchmark]: Toolchain (without parser) took 65260.63 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 346.6 MB). Free memory was 945.9 MB in the beginning and 1.3 GB in the end (delta: -349.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 12:12:13,704 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 12:12:13,704 INFO L168 Benchmark]: CACSL2BoogieTranslator took 253.57 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -158.5 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. [2018-12-02 12:12:13,704 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.18 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: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2018-12-02 12:12:13,704 INFO L168 Benchmark]: Boogie Preprocessor took 17.53 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 12:12:13,704 INFO L168 Benchmark]: RCFGBuilder took 221.61 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: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2018-12-02 12:12:13,704 INFO L168 Benchmark]: TraceAbstraction took 64705.11 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 231.7 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -224.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 11.5 GB. [2018-12-02 12:12:13,704 INFO L168 Benchmark]: Witness Printer took 41.63 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 30.7 kB). Peak memory consumption was 30.7 kB. Max. memory is 11.5 GB. [2018-12-02 12:12:13,705 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 253.57 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -158.5 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.18 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: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.53 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 221.61 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: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 64705.11 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 231.7 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -224.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 11.5 GB. * Witness Printer took 41.63 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 30.7 kB). Peak memory consumption was 30.7 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 558]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 540]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 540]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 551]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 556]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 551]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 556]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 21 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 61 locations, 21 error locations. SAFE Result, 64.6s OverallTime, 20 OverallIterations, 4 TraceHistogramMax, 15.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 607 SDtfs, 1146 SDslu, 3953 SDs, 0 SdLazy, 4850 SolverSat, 408 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 857 GetRequests, 281 SyntacticMatches, 8 SemanticMatches, 568 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6356 ImplicationChecksByTransitivity, 55.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 4 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 20 MinimizatonAttempts, 85 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 48.1s InterpolantComputationTime, 737 NumberOfCodeBlocks, 737 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 935 ConstructedInterpolants, 186 QuantifiedInterpolants, 632488 SizeOfPredicates, 197 NumberOfNonLiveVariables, 1561 ConjunctsInSsa, 478 ConjunctsInUnsatCore, 34 InterpolantComputations, 13 PerfectInterpolantSequences, 4/176 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...