./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstrlcpy-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_e9162d06-cd4e-474f-a40f-4377d56d975d/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e9162d06-cd4e-474f-a40f-4377d56d975d/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e9162d06-cd4e-474f-a40f-4377d56d975d/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e9162d06-cd4e-474f-a40f-4377d56d975d/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_e9162d06-cd4e-474f-a40f-4377d56d975d/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e9162d06-cd4e-474f-a40f-4377d56d975d/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 7d00aad8dfdafc20547a229a92ab2c2bdb101f8c .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-03 00:29:52,618 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 00:29:52,619 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 00:29:52,624 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 00:29:52,625 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 00:29:52,625 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 00:29:52,626 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 00:29:52,627 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 00:29:52,628 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 00:29:52,628 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 00:29:52,629 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 00:29:52,629 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 00:29:52,629 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 00:29:52,630 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 00:29:52,630 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 00:29:52,631 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 00:29:52,631 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 00:29:52,632 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 00:29:52,633 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 00:29:52,634 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 00:29:52,635 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 00:29:52,635 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 00:29:52,637 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 00:29:52,637 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 00:29:52,637 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 00:29:52,637 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 00:29:52,638 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 00:29:52,638 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 00:29:52,639 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 00:29:52,639 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 00:29:52,640 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 00:29:52,640 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 00:29:52,640 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 00:29:52,640 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 00:29:52,641 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 00:29:52,641 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 00:29:52,641 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e9162d06-cd4e-474f-a40f-4377d56d975d/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-03 00:29:52,649 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 00:29:52,649 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 00:29:52,650 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 00:29:52,650 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 00:29:52,650 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 00:29:52,650 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 00:29:52,650 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 00:29:52,650 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 00:29:52,650 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 00:29:52,650 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 00:29:52,651 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 00:29:52,651 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 00:29:52,651 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 00:29:52,651 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 00:29:52,651 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 00:29:52,651 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 00:29:52,652 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 00:29:52,652 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-03 00:29:52,652 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 00:29:52,652 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 00:29:52,652 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 00:29:52,652 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-03 00:29:52,652 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-03 00:29:52,652 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-03 00:29:52,652 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 00:29:52,653 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 00:29:52,653 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 00:29:52,653 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 00:29:52,653 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 00:29:52,653 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 00:29:52,653 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 00:29:52,653 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 00:29:52,653 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 00:29:52,653 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 00:29:52,653 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 00:29:52,654 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 00:29:52,654 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_e9162d06-cd4e-474f-a40f-4377d56d975d/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 -> 7d00aad8dfdafc20547a229a92ab2c2bdb101f8c [2018-12-03 00:29:52,671 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 00:29:52,677 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 00:29:52,680 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 00:29:52,680 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 00:29:52,681 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 00:29:52,681 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e9162d06-cd4e-474f-a40f-4377d56d975d/bin-2019/utaipan/../../sv-benchmarks/c/array-memsafety/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-12-03 00:29:52,715 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e9162d06-cd4e-474f-a40f-4377d56d975d/bin-2019/utaipan/data/b4b195312/2c92288ac6e745b79d7c81ac5aee51d0/FLAG7fa16cdf8 [2018-12-03 00:29:53,197 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 00:29:53,197 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e9162d06-cd4e-474f-a40f-4377d56d975d/sv-benchmarks/c/array-memsafety/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-12-03 00:29:53,203 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e9162d06-cd4e-474f-a40f-4377d56d975d/bin-2019/utaipan/data/b4b195312/2c92288ac6e745b79d7c81ac5aee51d0/FLAG7fa16cdf8 [2018-12-03 00:29:53,699 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e9162d06-cd4e-474f-a40f-4377d56d975d/bin-2019/utaipan/data/b4b195312/2c92288ac6e745b79d7c81ac5aee51d0 [2018-12-03 00:29:53,702 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 00:29:53,703 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 00:29:53,703 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 00:29:53,703 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 00:29:53,706 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 00:29:53,706 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 12:29:53" (1/1) ... [2018-12-03 00:29:53,708 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c8ed641 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:29:53, skipping insertion in model container [2018-12-03 00:29:53,708 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 12:29:53" (1/1) ... [2018-12-03 00:29:53,713 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 00:29:53,731 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 00:29:53,872 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 00:29:53,878 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 00:29:53,934 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 00:29:53,953 INFO L195 MainTranslator]: Completed translation [2018-12-03 00:29:53,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:29:53 WrapperNode [2018-12-03 00:29:53,953 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 00:29:53,954 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 00:29:53,954 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 00:29:53,954 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 00:29:53,959 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:29:53" (1/1) ... [2018-12-03 00:29:53,966 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:29:53" (1/1) ... [2018-12-03 00:29:53,971 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 00:29:53,971 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 00:29:53,971 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 00:29:53,971 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 00:29:53,976 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:29:53" (1/1) ... [2018-12-03 00:29:53,976 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:29:53" (1/1) ... [2018-12-03 00:29:53,978 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:29:53" (1/1) ... [2018-12-03 00:29:53,978 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:29:53" (1/1) ... [2018-12-03 00:29:53,983 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:29:53" (1/1) ... [2018-12-03 00:29:53,986 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:29:53" (1/1) ... [2018-12-03 00:29:53,986 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:29:53" (1/1) ... [2018-12-03 00:29:53,988 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 00:29:53,988 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 00:29:53,988 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 00:29:53,988 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 00:29:53,989 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:29:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e9162d06-cd4e-474f-a40f-4377d56d975d/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-03 00:29:54,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-03 00:29:54,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-03 00:29:54,020 INFO L130 BoogieDeclarations]: Found specification of procedure cstrlcpy [2018-12-03 00:29:54,020 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrlcpy [2018-12-03 00:29:54,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-03 00:29:54,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-03 00:29:54,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-03 00:29:54,020 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 00:29:54,020 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 00:29:54,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-03 00:29:54,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 00:29:54,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 00:29:54,183 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 00:29:54,183 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-03 00:29:54,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 12:29:54 BoogieIcfgContainer [2018-12-03 00:29:54,183 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 00:29:54,184 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 00:29:54,184 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 00:29:54,186 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 00:29:54,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 12:29:53" (1/3) ... [2018-12-03 00:29:54,187 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@627dd24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 12:29:54, skipping insertion in model container [2018-12-03 00:29:54,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:29:53" (2/3) ... [2018-12-03 00:29:54,187 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@627dd24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 12:29:54, skipping insertion in model container [2018-12-03 00:29:54,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 12:29:54" (3/3) ... [2018-12-03 00:29:54,188 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-12-03 00:29:54,194 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 00:29:54,198 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-12-03 00:29:54,208 INFO L257 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2018-12-03 00:29:54,223 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 00:29:54,223 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-03 00:29:54,223 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 00:29:54,223 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 00:29:54,223 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 00:29:54,223 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 00:29:54,224 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 00:29:54,224 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 00:29:54,234 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-12-03 00:29:54,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 00:29:54,239 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:29:54,240 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 00:29:54,241 INFO L423 AbstractCegarLoop]: === Iteration 1 === [cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-12-03 00:29:54,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:29:54,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1336499281, now seen corresponding path program 1 times [2018-12-03 00:29:54,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:29:54,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:29:54,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:29:54,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:29:54,275 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:29:54,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:29:54,354 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-03 00:29:54,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:29:54,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 00:29:54,356 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:29:54,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 00:29:54,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 00:29:54,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 00:29:54,368 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-12-03 00:29:54,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:29:54,404 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2018-12-03 00:29:54,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 00:29:54,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-03 00:29:54,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:29:54,411 INFO L225 Difference]: With dead ends: 45 [2018-12-03 00:29:54,411 INFO L226 Difference]: Without dead ends: 42 [2018-12-03 00:29:54,412 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-03 00:29:54,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-03 00:29:54,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-03 00:29:54,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-03 00:29:54,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2018-12-03 00:29:54,434 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 10 [2018-12-03 00:29:54,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:29:54,434 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2018-12-03 00:29:54,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 00:29:54,434 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2018-12-03 00:29:54,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 00:29:54,435 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:29:54,435 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 00:29:54,435 INFO L423 AbstractCegarLoop]: === Iteration 2 === [cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-12-03 00:29:54,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:29:54,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1336499280, now seen corresponding path program 1 times [2018-12-03 00:29:54,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:29:54,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:29:54,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:29:54,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:29:54,436 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:29:54,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:29:54,491 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-03 00:29:54,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:29:54,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 00:29:54,491 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:29:54,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 00:29:54,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 00:29:54,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 00:29:54,492 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 4 states. [2018-12-03 00:29:54,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:29:54,510 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2018-12-03 00:29:54,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 00:29:54,510 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-03 00:29:54,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:29:54,511 INFO L225 Difference]: With dead ends: 41 [2018-12-03 00:29:54,511 INFO L226 Difference]: Without dead ends: 41 [2018-12-03 00:29:54,512 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-03 00:29:54,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-03 00:29:54,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-03 00:29:54,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-03 00:29:54,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2018-12-03 00:29:54,516 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 10 [2018-12-03 00:29:54,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:29:54,516 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2018-12-03 00:29:54,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 00:29:54,516 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2018-12-03 00:29:54,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 00:29:54,517 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:29:54,517 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 00:29:54,517 INFO L423 AbstractCegarLoop]: === Iteration 3 === [cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-12-03 00:29:54,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:29:54,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1518195304, now seen corresponding path program 1 times [2018-12-03 00:29:54,518 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:29:54,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:29:54,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:29:54,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:29:54,518 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:29:54,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:29:54,535 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-03 00:29:54,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:29:54,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 00:29:54,535 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:29:54,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 00:29:54,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 00:29:54,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 00:29:54,536 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand 3 states. [2018-12-03 00:29:54,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:29:54,552 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2018-12-03 00:29:54,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 00:29:54,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-03 00:29:54,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:29:54,553 INFO L225 Difference]: With dead ends: 40 [2018-12-03 00:29:54,553 INFO L226 Difference]: Without dead ends: 40 [2018-12-03 00:29:54,553 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-03 00:29:54,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-03 00:29:54,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-03 00:29:54,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-03 00:29:54,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2018-12-03 00:29:54,556 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 11 [2018-12-03 00:29:54,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:29:54,556 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2018-12-03 00:29:54,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 00:29:54,556 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2018-12-03 00:29:54,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 00:29:54,556 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:29:54,556 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 00:29:54,556 INFO L423 AbstractCegarLoop]: === Iteration 4 === [cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-12-03 00:29:54,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:29:54,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1518195305, now seen corresponding path program 1 times [2018-12-03 00:29:54,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:29:54,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:29:54,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:29:54,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:29:54,557 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:29:54,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:29:54,594 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-03 00:29:54,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:29:54,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 00:29:54,594 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:29:54,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 00:29:54,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 00:29:54,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 00:29:54,595 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand 4 states. [2018-12-03 00:29:54,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:29:54,605 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2018-12-03 00:29:54,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 00:29:54,606 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-03 00:29:54,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:29:54,606 INFO L225 Difference]: With dead ends: 39 [2018-12-03 00:29:54,607 INFO L226 Difference]: Without dead ends: 39 [2018-12-03 00:29:54,607 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-03 00:29:54,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-03 00:29:54,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-03 00:29:54,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-03 00:29:54,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2018-12-03 00:29:54,610 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 11 [2018-12-03 00:29:54,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:29:54,610 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2018-12-03 00:29:54,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 00:29:54,610 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2018-12-03 00:29:54,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 00:29:54,611 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:29:54,611 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 00:29:54,611 INFO L423 AbstractCegarLoop]: === Iteration 5 === [cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-12-03 00:29:54,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:29:54,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1848843889, now seen corresponding path program 1 times [2018-12-03 00:29:54,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:29:54,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:29:54,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:29:54,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:29:54,612 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:29:54,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:29:54,697 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-03 00:29:54,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:29:54,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 00:29:54,697 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:29:54,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 00:29:54,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 00:29:54,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-03 00:29:54,698 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand 8 states. [2018-12-03 00:29:54,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:29:54,777 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2018-12-03 00:29:54,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 00:29:54,778 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-12-03 00:29:54,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:29:54,780 INFO L225 Difference]: With dead ends: 56 [2018-12-03 00:29:54,780 INFO L226 Difference]: Without dead ends: 56 [2018-12-03 00:29:54,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-12-03 00:29:54,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-03 00:29:54,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 42. [2018-12-03 00:29:54,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-03 00:29:54,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2018-12-03 00:29:54,785 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 17 [2018-12-03 00:29:54,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:29:54,785 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2018-12-03 00:29:54,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 00:29:54,785 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2018-12-03 00:29:54,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 00:29:54,786 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:29:54,786 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 00:29:54,786 INFO L423 AbstractCegarLoop]: === Iteration 6 === [cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-12-03 00:29:54,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:29:54,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1848843890, now seen corresponding path program 1 times [2018-12-03 00:29:54,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:29:54,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:29:54,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:29:54,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:29:54,787 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:29:54,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:29:54,821 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-03 00:29:54,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:29:54,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 00:29:54,821 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:29:54,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 00:29:54,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 00:29:54,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 00:29:54,822 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand 6 states. [2018-12-03 00:29:54,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:29:54,877 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2018-12-03 00:29:54,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 00:29:54,877 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-12-03 00:29:54,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:29:54,878 INFO L225 Difference]: With dead ends: 41 [2018-12-03 00:29:54,879 INFO L226 Difference]: Without dead ends: 41 [2018-12-03 00:29:54,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-03 00:29:54,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-03 00:29:54,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-03 00:29:54,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-03 00:29:54,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2018-12-03 00:29:54,883 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 17 [2018-12-03 00:29:54,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:29:54,883 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2018-12-03 00:29:54,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 00:29:54,883 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2018-12-03 00:29:54,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 00:29:54,884 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:29:54,884 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 00:29:54,884 INFO L423 AbstractCegarLoop]: === Iteration 7 === [cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-12-03 00:29:54,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:29:54,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1848044563, now seen corresponding path program 1 times [2018-12-03 00:29:54,884 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:29:54,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:29:54,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:29:54,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:29:54,885 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:29:54,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:29:54,919 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-03 00:29:54,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:29:54,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 00:29:54,919 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:29:54,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 00:29:54,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 00:29:54,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 00:29:54,920 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 5 states. [2018-12-03 00:29:54,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:29:54,955 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2018-12-03 00:29:54,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 00:29:54,955 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-12-03 00:29:54,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:29:54,955 INFO L225 Difference]: With dead ends: 40 [2018-12-03 00:29:54,956 INFO L226 Difference]: Without dead ends: 40 [2018-12-03 00:29:54,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 00:29:54,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-03 00:29:54,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-03 00:29:54,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-03 00:29:54,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2018-12-03 00:29:54,958 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 17 [2018-12-03 00:29:54,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:29:54,958 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2018-12-03 00:29:54,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 00:29:54,958 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-12-03 00:29:54,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 00:29:54,959 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:29:54,959 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 00:29:54,959 INFO L423 AbstractCegarLoop]: === Iteration 8 === [cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-12-03 00:29:54,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:29:54,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1848044562, now seen corresponding path program 1 times [2018-12-03 00:29:54,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:29:54,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:29:54,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:29:54,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:29:54,960 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:29:54,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:29:55,000 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-03 00:29:55,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:29:55,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 00:29:55,000 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:29:55,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 00:29:55,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 00:29:55,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 00:29:55,001 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 5 states. [2018-12-03 00:29:55,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:29:55,033 INFO L93 Difference]: Finished difference Result 72 states and 85 transitions. [2018-12-03 00:29:55,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 00:29:55,034 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-12-03 00:29:55,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:29:55,034 INFO L225 Difference]: With dead ends: 72 [2018-12-03 00:29:55,034 INFO L226 Difference]: Without dead ends: 72 [2018-12-03 00:29:55,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 00:29:55,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-03 00:29:55,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 63. [2018-12-03 00:29:55,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-03 00:29:55,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 83 transitions. [2018-12-03 00:29:55,038 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 83 transitions. Word has length 17 [2018-12-03 00:29:55,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:29:55,038 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 83 transitions. [2018-12-03 00:29:55,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 00:29:55,038 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 83 transitions. [2018-12-03 00:29:55,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 00:29:55,038 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:29:55,038 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 00:29:55,039 INFO L423 AbstractCegarLoop]: === Iteration 9 === [cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-12-03 00:29:55,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:29:55,039 INFO L82 PathProgramCache]: Analyzing trace with hash 2053895724, now seen corresponding path program 1 times [2018-12-03 00:29:55,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:29:55,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:29:55,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:29:55,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:29:55,040 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:29:55,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:29:55,089 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-03 00:29:55,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:29:55,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 00:29:55,089 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:29:55,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 00:29:55,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 00:29:55,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-03 00:29:55,090 INFO L87 Difference]: Start difference. First operand 63 states and 83 transitions. Second operand 7 states. [2018-12-03 00:29:55,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:29:55,147 INFO L93 Difference]: Finished difference Result 83 states and 111 transitions. [2018-12-03 00:29:55,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 00:29:55,147 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-12-03 00:29:55,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:29:55,147 INFO L225 Difference]: With dead ends: 83 [2018-12-03 00:29:55,148 INFO L226 Difference]: Without dead ends: 83 [2018-12-03 00:29:55,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-03 00:29:55,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-03 00:29:55,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 69. [2018-12-03 00:29:55,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-03 00:29:55,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 93 transitions. [2018-12-03 00:29:55,151 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 93 transitions. Word has length 17 [2018-12-03 00:29:55,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:29:55,151 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 93 transitions. [2018-12-03 00:29:55,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 00:29:55,152 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 93 transitions. [2018-12-03 00:29:55,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 00:29:55,152 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:29:55,152 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 00:29:55,152 INFO L423 AbstractCegarLoop]: === Iteration 10 === [cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-12-03 00:29:55,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:29:55,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1479585755, now seen corresponding path program 1 times [2018-12-03 00:29:55,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:29:55,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:29:55,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:29:55,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:29:55,153 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:29:55,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:29:55,184 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-03 00:29:55,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:29:55,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 00:29:55,184 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:29:55,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 00:29:55,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 00:29:55,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 00:29:55,185 INFO L87 Difference]: Start difference. First operand 69 states and 93 transitions. Second operand 6 states. [2018-12-03 00:29:55,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:29:55,237 INFO L93 Difference]: Finished difference Result 68 states and 91 transitions. [2018-12-03 00:29:55,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 00:29:55,237 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-12-03 00:29:55,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:29:55,238 INFO L225 Difference]: With dead ends: 68 [2018-12-03 00:29:55,238 INFO L226 Difference]: Without dead ends: 68 [2018-12-03 00:29:55,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-03 00:29:55,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-03 00:29:55,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-03 00:29:55,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-03 00:29:55,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 91 transitions. [2018-12-03 00:29:55,243 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 91 transitions. Word has length 18 [2018-12-03 00:29:55,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:29:55,243 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 91 transitions. [2018-12-03 00:29:55,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 00:29:55,243 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 91 transitions. [2018-12-03 00:29:55,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 00:29:55,244 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:29:55,244 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 00:29:55,244 INFO L423 AbstractCegarLoop]: === Iteration 11 === [cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-12-03 00:29:55,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:29:55,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1479585754, now seen corresponding path program 1 times [2018-12-03 00:29:55,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:29:55,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:29:55,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:29:55,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:29:55,245 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:29:55,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:29:55,309 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-03 00:29:55,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:29:55,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 00:29:55,310 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:29:55,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 00:29:55,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 00:29:55,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-03 00:29:55,311 INFO L87 Difference]: Start difference. First operand 68 states and 91 transitions. Second operand 8 states. [2018-12-03 00:29:55,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:29:55,387 INFO L93 Difference]: Finished difference Result 86 states and 115 transitions. [2018-12-03 00:29:55,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 00:29:55,387 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-12-03 00:29:55,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:29:55,388 INFO L225 Difference]: With dead ends: 86 [2018-12-03 00:29:55,388 INFO L226 Difference]: Without dead ends: 86 [2018-12-03 00:29:55,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-12-03 00:29:55,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-03 00:29:55,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 70. [2018-12-03 00:29:55,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-03 00:29:55,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 93 transitions. [2018-12-03 00:29:55,393 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 93 transitions. Word has length 18 [2018-12-03 00:29:55,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:29:55,393 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 93 transitions. [2018-12-03 00:29:55,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 00:29:55,393 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 93 transitions. [2018-12-03 00:29:55,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 00:29:55,394 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:29:55,394 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 00:29:55,394 INFO L423 AbstractCegarLoop]: === Iteration 12 === [cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-12-03 00:29:55,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:29:55,395 INFO L82 PathProgramCache]: Analyzing trace with hash -753736926, now seen corresponding path program 1 times [2018-12-03 00:29:55,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:29:55,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:29:55,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:29:55,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:29:55,395 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:29:55,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:29:55,424 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-03 00:29:55,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:29:55,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 00:29:55,424 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:29:55,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 00:29:55,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 00:29:55,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 00:29:55,425 INFO L87 Difference]: Start difference. First operand 70 states and 93 transitions. Second operand 6 states. [2018-12-03 00:29:55,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:29:55,484 INFO L93 Difference]: Finished difference Result 69 states and 91 transitions. [2018-12-03 00:29:55,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 00:29:55,484 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-12-03 00:29:55,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:29:55,485 INFO L225 Difference]: With dead ends: 69 [2018-12-03 00:29:55,485 INFO L226 Difference]: Without dead ends: 69 [2018-12-03 00:29:55,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-03 00:29:55,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-03 00:29:55,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-12-03 00:29:55,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-03 00:29:55,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2018-12-03 00:29:55,487 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 91 transitions. Word has length 18 [2018-12-03 00:29:55,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:29:55,487 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 91 transitions. [2018-12-03 00:29:55,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 00:29:55,487 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 91 transitions. [2018-12-03 00:29:55,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 00:29:55,488 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:29:55,488 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 00:29:55,488 INFO L423 AbstractCegarLoop]: === Iteration 13 === [cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-12-03 00:29:55,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:29:55,488 INFO L82 PathProgramCache]: Analyzing trace with hash -753736925, now seen corresponding path program 1 times [2018-12-03 00:29:55,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:29:55,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:29:55,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:29:55,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:29:55,489 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:29:55,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:29:55,526 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-03 00:29:55,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:29:55,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 00:29:55,527 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:29:55,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 00:29:55,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 00:29:55,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-03 00:29:55,527 INFO L87 Difference]: Start difference. First operand 69 states and 91 transitions. Second operand 8 states. [2018-12-03 00:29:55,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:29:55,607 INFO L93 Difference]: Finished difference Result 81 states and 105 transitions. [2018-12-03 00:29:55,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 00:29:55,607 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-12-03 00:29:55,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:29:55,608 INFO L225 Difference]: With dead ends: 81 [2018-12-03 00:29:55,608 INFO L226 Difference]: Without dead ends: 81 [2018-12-03 00:29:55,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-12-03 00:29:55,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-03 00:29:55,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 73. [2018-12-03 00:29:55,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-03 00:29:55,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 95 transitions. [2018-12-03 00:29:55,610 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 95 transitions. Word has length 18 [2018-12-03 00:29:55,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:29:55,611 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 95 transitions. [2018-12-03 00:29:55,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 00:29:55,611 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 95 transitions. [2018-12-03 00:29:55,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 00:29:55,611 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:29:55,611 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] [2018-12-03 00:29:55,611 INFO L423 AbstractCegarLoop]: === Iteration 14 === [cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-12-03 00:29:55,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:29:55,612 INFO L82 PathProgramCache]: Analyzing trace with hash -2023325217, now seen corresponding path program 1 times [2018-12-03 00:29:55,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:29:55,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:29:55,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:29:55,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:29:55,612 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:29:55,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:29:55,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-03 00:29:55,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:29:55,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 00:29:55,622 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:29:55,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 00:29:55,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 00:29:55,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 00:29:55,623 INFO L87 Difference]: Start difference. First operand 73 states and 95 transitions. Second operand 3 states. [2018-12-03 00:29:55,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:29:55,629 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2018-12-03 00:29:55,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 00:29:55,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-03 00:29:55,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:29:55,630 INFO L225 Difference]: With dead ends: 80 [2018-12-03 00:29:55,630 INFO L226 Difference]: Without dead ends: 80 [2018-12-03 00:29:55,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 00:29:55,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-03 00:29:55,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2018-12-03 00:29:55,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-03 00:29:55,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 96 transitions. [2018-12-03 00:29:55,634 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 96 transitions. Word has length 20 [2018-12-03 00:29:55,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:29:55,634 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 96 transitions. [2018-12-03 00:29:55,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 00:29:55,634 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 96 transitions. [2018-12-03 00:29:55,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 00:29:55,635 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:29:55,635 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] [2018-12-03 00:29:55,635 INFO L423 AbstractCegarLoop]: === Iteration 15 === [cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-12-03 00:29:55,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:29:55,636 INFO L82 PathProgramCache]: Analyzing trace with hash -487715400, now seen corresponding path program 1 times [2018-12-03 00:29:55,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:29:55,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:29:55,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:29:55,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:29:55,637 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:29:55,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:29:55,692 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 00:29:55,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:29:55,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 00:29:55,692 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:29:55,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 00:29:55,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 00:29:55,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-03 00:29:55,693 INFO L87 Difference]: Start difference. First operand 74 states and 96 transitions. Second operand 6 states. [2018-12-03 00:29:55,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:29:55,715 INFO L93 Difference]: Finished difference Result 73 states and 94 transitions. [2018-12-03 00:29:55,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 00:29:55,716 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-12-03 00:29:55,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:29:55,717 INFO L225 Difference]: With dead ends: 73 [2018-12-03 00:29:55,717 INFO L226 Difference]: Without dead ends: 73 [2018-12-03 00:29:55,717 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-03 00:29:55,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-03 00:29:55,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 44. [2018-12-03 00:29:55,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-03 00:29:55,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2018-12-03 00:29:55,719 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 21 [2018-12-03 00:29:55,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:29:55,719 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2018-12-03 00:29:55,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 00:29:55,719 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2018-12-03 00:29:55,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 00:29:55,720 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:29:55,720 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-03 00:29:55,720 INFO L423 AbstractCegarLoop]: === Iteration 16 === [cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-12-03 00:29:55,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:29:55,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1999236102, now seen corresponding path program 1 times [2018-12-03 00:29:55,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:29:55,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:29:55,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:29:55,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:29:55,721 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:29:55,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:29:55,769 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-03 00:29:55,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:29:55,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 00:29:55,769 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:29:55,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 00:29:55,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 00:29:55,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 00:29:55,770 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 4 states. [2018-12-03 00:29:55,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:29:55,815 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2018-12-03 00:29:55,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 00:29:55,816 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-12-03 00:29:55,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:29:55,816 INFO L225 Difference]: With dead ends: 43 [2018-12-03 00:29:55,816 INFO L226 Difference]: Without dead ends: 38 [2018-12-03 00:29:55,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 00:29:55,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-03 00:29:55,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-03 00:29:55,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-03 00:29:55,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2018-12-03 00:29:55,818 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 22 [2018-12-03 00:29:55,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:29:55,819 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2018-12-03 00:29:55,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 00:29:55,819 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-12-03 00:29:55,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 00:29:55,819 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:29:55,819 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-03 00:29:55,820 INFO L423 AbstractCegarLoop]: === Iteration 17 === [cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-12-03 00:29:55,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:29:55,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1850925390, now seen corresponding path program 1 times [2018-12-03 00:29:55,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:29:55,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:29:55,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:29:55,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:29:55,821 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:29:55,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:29:55,919 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-03 00:29:55,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:29:55,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 00:29:55,919 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:29:55,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 00:29:55,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 00:29:55,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-03 00:29:55,920 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand 7 states. [2018-12-03 00:29:55,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:29:55,964 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2018-12-03 00:29:55,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 00:29:55,965 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-12-03 00:29:55,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:29:55,965 INFO L225 Difference]: With dead ends: 55 [2018-12-03 00:29:55,965 INFO L226 Difference]: Without dead ends: 55 [2018-12-03 00:29:55,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-03 00:29:55,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-03 00:29:55,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 46. [2018-12-03 00:29:55,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-03 00:29:55,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2018-12-03 00:29:55,966 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 22 [2018-12-03 00:29:55,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:29:55,967 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2018-12-03 00:29:55,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 00:29:55,967 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2018-12-03 00:29:55,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 00:29:55,967 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:29:55,967 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-03 00:29:55,967 INFO L423 AbstractCegarLoop]: === Iteration 18 === [cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-12-03 00:29:55,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:29:55,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1164178228, now seen corresponding path program 1 times [2018-12-03 00:29:55,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:29:55,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:29:55,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:29:55,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:29:55,968 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:29:55,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:29:56,071 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-03 00:29:56,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:29:56,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 00:29:56,072 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:29:56,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 00:29:56,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 00:29:56,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 00:29:56,073 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 8 states. [2018-12-03 00:29:56,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:29:56,201 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2018-12-03 00:29:56,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 00:29:56,201 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-12-03 00:29:56,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:29:56,202 INFO L225 Difference]: With dead ends: 56 [2018-12-03 00:29:56,202 INFO L226 Difference]: Without dead ends: 56 [2018-12-03 00:29:56,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-12-03 00:29:56,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-03 00:29:56,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2018-12-03 00:29:56,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-03 00:29:56,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2018-12-03 00:29:56,203 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 22 [2018-12-03 00:29:56,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:29:56,203 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2018-12-03 00:29:56,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 00:29:56,203 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2018-12-03 00:29:56,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 00:29:56,204 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:29:56,204 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] [2018-12-03 00:29:56,204 INFO L423 AbstractCegarLoop]: === Iteration 19 === [cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-12-03 00:29:56,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:29:56,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1164213049, now seen corresponding path program 1 times [2018-12-03 00:29:56,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:29:56,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:29:56,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:29:56,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:29:56,205 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:29:56,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:29:56,272 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 00:29:56,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:29:56,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 00:29:56,272 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:29:56,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 00:29:56,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 00:29:56,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-03 00:29:56,272 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand 9 states. [2018-12-03 00:29:56,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:29:56,332 INFO L93 Difference]: Finished difference Result 84 states and 98 transitions. [2018-12-03 00:29:56,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 00:29:56,332 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-12-03 00:29:56,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:29:56,332 INFO L225 Difference]: With dead ends: 84 [2018-12-03 00:29:56,333 INFO L226 Difference]: Without dead ends: 84 [2018-12-03 00:29:56,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-12-03 00:29:56,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-03 00:29:56,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 64. [2018-12-03 00:29:56,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-03 00:29:56,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2018-12-03 00:29:56,335 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 76 transitions. Word has length 22 [2018-12-03 00:29:56,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:29:56,335 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 76 transitions. [2018-12-03 00:29:56,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 00:29:56,335 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2018-12-03 00:29:56,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 00:29:56,335 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:29:56,335 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] [2018-12-03 00:29:56,336 INFO L423 AbstractCegarLoop]: === Iteration 20 === [cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-12-03 00:29:56,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:29:56,336 INFO L82 PathProgramCache]: Analyzing trace with hash 143144695, now seen corresponding path program 1 times [2018-12-03 00:29:56,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:29:56,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:29:56,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:29:56,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:29:56,337 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:29:56,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:29:56,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-03 00:29:56,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 00:29:56,456 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 00:29:56,456 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2018-12-03 00:29:56,457 INFO L205 CegarAbsIntRunner]: [0], [3], [8], [13], [14], [16], [17], [24], [63], [64], [68], [73], [79], [81], [82], [85], [92], [93], [94], [96] [2018-12-03 00:29:56,480 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 00:29:56,481 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 00:29:56,585 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 00:29:56,586 INFO L272 AbstractInterpreter]: Visited 20 different actions 26 times. Merged at 6 different actions 6 times. Never widened. Performed 254 root evaluator evaluations with a maximum evaluation depth of 4. Performed 254 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 31 variables. [2018-12-03 00:29:56,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:29:56,595 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 00:29:56,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 00:29:56,595 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e9162d06-cd4e-474f-a40f-4377d56d975d/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-03 00:29:56,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:29:56,601 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 00:29:56,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:29:56,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 00:29:56,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-03 00:29:56,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-12-03 00:29:56,668 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-03 00:29:56,673 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 00:29:56,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:29:56,686 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2018-12-03 00:29:56,703 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 15 treesize of output 12 [2018-12-03 00:29:56,704 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-03 00:29:56,705 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 00:29:56,705 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:29:56,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:29:56,706 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-12-03 00:29:56,752 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-03 00:29:56,758 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 17 treesize of output 14 [2018-12-03 00:29:56,758 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-03 00:29:56,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 00:29:56,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-03 00:29:56,764 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-12-03 00:29:56,796 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-03 00:29:56,796 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 00:29:56,960 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 15 treesize of output 13 [2018-12-03 00:29:56,967 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 7 treesize of output 3 [2018-12-03 00:29:56,967 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 00:29:56,970 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:29:56,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-03 00:29:56,976 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:35 [2018-12-03 00:29:57,009 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-03 00:29:57,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 00:29:57,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24 [2018-12-03 00:29:57,028 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 00:29:57,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 00:29:57,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 00:29:57,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2018-12-03 00:29:57,029 INFO L87 Difference]: Start difference. First operand 64 states and 76 transitions. Second operand 17 states. [2018-12-03 00:29:57,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:29:57,397 INFO L93 Difference]: Finished difference Result 76 states and 90 transitions. [2018-12-03 00:29:57,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 00:29:57,397 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 22 [2018-12-03 00:29:57,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:29:57,398 INFO L225 Difference]: With dead ends: 76 [2018-12-03 00:29:57,398 INFO L226 Difference]: Without dead ends: 76 [2018-12-03 00:29:57,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=143, Invalid=913, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 00:29:57,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-03 00:29:57,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 65. [2018-12-03 00:29:57,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-03 00:29:57,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2018-12-03 00:29:57,400 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 22 [2018-12-03 00:29:57,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:29:57,400 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 77 transitions. [2018-12-03 00:29:57,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 00:29:57,400 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2018-12-03 00:29:57,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 00:29:57,401 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:29:57,401 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] [2018-12-03 00:29:57,401 INFO L423 AbstractCegarLoop]: === Iteration 21 === [cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-12-03 00:29:57,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:29:57,401 INFO L82 PathProgramCache]: Analyzing trace with hash -342366095, now seen corresponding path program 1 times [2018-12-03 00:29:57,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:29:57,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:29:57,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:29:57,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:29:57,402 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:29:57,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:29:57,439 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 00:29:57,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:29:57,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 00:29:57,439 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:29:57,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 00:29:57,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 00:29:57,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 00:29:57,440 INFO L87 Difference]: Start difference. First operand 65 states and 77 transitions. Second operand 5 states. [2018-12-03 00:29:57,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:29:57,448 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2018-12-03 00:29:57,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 00:29:57,448 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-12-03 00:29:57,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:29:57,449 INFO L225 Difference]: With dead ends: 65 [2018-12-03 00:29:57,449 INFO L226 Difference]: Without dead ends: 65 [2018-12-03 00:29:57,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 00:29:57,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-03 00:29:57,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-12-03 00:29:57,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-03 00:29:57,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2018-12-03 00:29:57,451 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 23 [2018-12-03 00:29:57,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:29:57,451 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2018-12-03 00:29:57,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 00:29:57,451 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2018-12-03 00:29:57,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 00:29:57,452 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:29:57,452 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] [2018-12-03 00:29:57,452 INFO L423 AbstractCegarLoop]: === Iteration 22 === [cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-12-03 00:29:57,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:29:57,453 INFO L82 PathProgramCache]: Analyzing trace with hash 142518206, now seen corresponding path program 1 times [2018-12-03 00:29:57,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:29:57,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:29:57,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:29:57,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:29:57,454 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:29:57,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:29:57,551 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-03 00:29:57,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 00:29:57,552 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 00:29:57,552 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-12-03 00:29:57,552 INFO L205 CegarAbsIntRunner]: [0], [3], [8], [13], [14], [17], [19], [24], [63], [64], [68], [73], [79], [81], [82], [85], [92], [93], [94], [96] [2018-12-03 00:29:57,553 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 00:29:57,553 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 00:29:57,589 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 00:29:57,589 INFO L272 AbstractInterpreter]: Visited 20 different actions 26 times. Merged at 6 different actions 6 times. Never widened. Performed 256 root evaluator evaluations with a maximum evaluation depth of 4. Performed 256 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 31 variables. [2018-12-03 00:29:57,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:29:57,594 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 00:29:57,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 00:29:57,594 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e9162d06-cd4e-474f-a40f-4377d56d975d/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-03 00:29:57,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:29:57,602 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 00:29:57,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:29:57,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 00:29:57,627 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-03 00:29:57,629 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-03 00:29:57,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 00:29:57,639 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:29:57,649 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-03 00:29:57,649 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 00:29:57,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:29:57,654 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2018-12-03 00:29:57,772 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-03 00:29:57,772 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 00:29:57,914 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-03 00:29:57,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 00:29:57,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2018-12-03 00:29:57,929 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 00:29:57,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 00:29:57,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 00:29:57,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2018-12-03 00:29:57,930 INFO L87 Difference]: Start difference. First operand 65 states and 74 transitions. Second operand 17 states. [2018-12-03 00:29:58,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:29:58,183 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2018-12-03 00:29:58,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 00:29:58,183 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 23 [2018-12-03 00:29:58,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:29:58,184 INFO L225 Difference]: With dead ends: 71 [2018-12-03 00:29:58,184 INFO L226 Difference]: Without dead ends: 71 [2018-12-03 00:29:58,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=739, Unknown=0, NotChecked=0, Total=870 [2018-12-03 00:29:58,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-03 00:29:58,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 66. [2018-12-03 00:29:58,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-03 00:29:58,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 75 transitions. [2018-12-03 00:29:58,186 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 75 transitions. Word has length 23 [2018-12-03 00:29:58,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:29:58,187 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 75 transitions. [2018-12-03 00:29:58,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 00:29:58,187 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2018-12-03 00:29:58,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 00:29:58,187 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:29:58,187 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] [2018-12-03 00:29:58,187 INFO L423 AbstractCegarLoop]: === Iteration 23 === [cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-12-03 00:29:58,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:29:58,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1870215061, now seen corresponding path program 1 times [2018-12-03 00:29:58,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:29:58,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:29:58,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:29:58,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:29:58,188 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:29:58,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:29:58,269 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-03 00:29:58,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:29:58,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-03 00:29:58,269 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:29:58,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 00:29:58,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 00:29:58,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-03 00:29:58,269 INFO L87 Difference]: Start difference. First operand 66 states and 75 transitions. Second operand 10 states. [2018-12-03 00:29:58,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:29:58,343 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2018-12-03 00:29:58,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 00:29:58,344 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-12-03 00:29:58,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:29:58,344 INFO L225 Difference]: With dead ends: 80 [2018-12-03 00:29:58,344 INFO L226 Difference]: Without dead ends: 66 [2018-12-03 00:29:58,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-12-03 00:29:58,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-03 00:29:58,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-12-03 00:29:58,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-03 00:29:58,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2018-12-03 00:29:58,345 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 24 [2018-12-03 00:29:58,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:29:58,345 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2018-12-03 00:29:58,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 00:29:58,345 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2018-12-03 00:29:58,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 00:29:58,346 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:29:58,346 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] [2018-12-03 00:29:58,346 INFO L423 AbstractCegarLoop]: === Iteration 24 === [cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-12-03 00:29:58,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:29:58,346 INFO L82 PathProgramCache]: Analyzing trace with hash 2083779701, now seen corresponding path program 1 times [2018-12-03 00:29:58,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:29:58,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:29:58,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:29:58,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:29:58,347 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:29:58,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:29:58,431 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-03 00:29:58,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:29:58,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-03 00:29:58,432 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:29:58,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 00:29:58,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 00:29:58,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-03 00:29:58,432 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand 10 states. [2018-12-03 00:29:58,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:29:58,550 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2018-12-03 00:29:58,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 00:29:58,551 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-12-03 00:29:58,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:29:58,551 INFO L225 Difference]: With dead ends: 73 [2018-12-03 00:29:58,551 INFO L226 Difference]: Without dead ends: 58 [2018-12-03 00:29:58,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-12-03 00:29:58,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-03 00:29:58,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2018-12-03 00:29:58,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-03 00:29:58,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-12-03 00:29:58,552 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 24 [2018-12-03 00:29:58,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:29:58,553 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-12-03 00:29:58,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 00:29:58,553 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-12-03 00:29:58,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 00:29:58,553 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:29:58,553 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] [2018-12-03 00:29:58,553 INFO L423 AbstractCegarLoop]: === Iteration 25 === [cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-12-03 00:29:58,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:29:58,553 INFO L82 PathProgramCache]: Analyzing trace with hash -123929645, now seen corresponding path program 1 times [2018-12-03 00:29:58,553 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:29:58,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:29:58,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:29:58,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:29:58,554 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:29:58,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:29:58,663 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-03 00:29:58,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 00:29:58,664 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 00:29:58,664 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-03 00:29:58,664 INFO L205 CegarAbsIntRunner]: [0], [3], [8], [11], [33], [36], [37], [46], [47], [49], [54], [63], [64], [68], [73], [77], [81], [82], [85], [92], [93], [94], [96] [2018-12-03 00:29:58,665 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 00:29:58,665 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 00:29:58,704 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 00:29:58,704 INFO L272 AbstractInterpreter]: Visited 23 different actions 27 times. Merged at 4 different actions 4 times. Never widened. Performed 208 root evaluator evaluations with a maximum evaluation depth of 3. Performed 208 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 29 variables. [2018-12-03 00:29:58,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:29:58,706 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 00:29:58,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 00:29:58,706 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e9162d06-cd4e-474f-a40f-4377d56d975d/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-03 00:29:58,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:29:58,713 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 00:29:58,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:29:58,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 00:29:58,751 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-03 00:29:58,754 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-03 00:29:58,755 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 00:29:58,759 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:29:58,772 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-03 00:29:58,772 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 00:29:58,779 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-03 00:29:58,780 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 [2018-12-03 00:29:58,792 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 15 treesize of output 12 [2018-12-03 00:29:58,793 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-03 00:29:58,793 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 00:29:58,795 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:29:58,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:29:58,797 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-12-03 00:29:58,844 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 23 treesize of output 24 [2018-12-03 00:29:58,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-03 00:29:58,846 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 00:29:58,849 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:29:58,853 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-03 00:29:58,853 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:23 [2018-12-03 00:29:58,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-12-03 00:29:58,893 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 5 treesize of output 1 [2018-12-03 00:29:58,893 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 00:29:58,907 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 17 treesize of output 14 [2018-12-03 00:29:58,907 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-03 00:29:58,910 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 00:29:58,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-03 00:29:58,917 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2018-12-03 00:29:58,956 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-03 00:29:58,957 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 00:29:59,154 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 13 treesize of output 11 [2018-12-03 00:29:59,161 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-12-03 00:29:59,161 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 00:29:59,162 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:29:59,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-03 00:29:59,177 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:35 [2018-12-03 00:29:59,208 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-03 00:29:59,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 00:29:59,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 26 [2018-12-03 00:29:59,223 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 00:29:59,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 00:29:59,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 00:29:59,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=629, Unknown=0, NotChecked=0, Total=702 [2018-12-03 00:29:59,224 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 19 states. [2018-12-03 00:29:59,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:29:59,879 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2018-12-03 00:29:59,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 00:29:59,879 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2018-12-03 00:29:59,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:29:59,880 INFO L225 Difference]: With dead ends: 58 [2018-12-03 00:29:59,880 INFO L226 Difference]: Without dead ends: 41 [2018-12-03 00:29:59,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=205, Invalid=1201, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 00:29:59,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-03 00:29:59,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-03 00:29:59,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-03 00:29:59,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-12-03 00:29:59,881 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 24 [2018-12-03 00:29:59,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:29:59,881 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-12-03 00:29:59,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 00:29:59,882 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-12-03 00:29:59,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 00:29:59,882 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:29:59,882 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] [2018-12-03 00:29:59,882 INFO L423 AbstractCegarLoop]: === Iteration 26 === [cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-12-03 00:29:59,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:29:59,882 INFO L82 PathProgramCache]: Analyzing trace with hash -2001948722, now seen corresponding path program 1 times [2018-12-03 00:29:59,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:29:59,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:29:59,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:29:59,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:29:59,883 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:29:59,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:29:59,999 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-03 00:29:59,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 00:29:59,999 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 00:29:59,999 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-12-03 00:29:59,999 INFO L205 CegarAbsIntRunner]: [0], [3], [8], [11], [13], [14], [17], [24], [33], [36], [37], [46], [49], [63], [64], [68], [73], [79], [81], [82], [85], [92], [93], [94], [96] [2018-12-03 00:30:00,001 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 00:30:00,001 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 00:30:00,029 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 00:30:00,029 INFO L272 AbstractInterpreter]: Visited 25 different actions 36 times. Merged at 11 different actions 11 times. Never widened. Performed 320 root evaluator evaluations with a maximum evaluation depth of 4. Performed 320 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 33 variables. [2018-12-03 00:30:00,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:30:00,034 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 00:30:00,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 00:30:00,034 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e9162d06-cd4e-474f-a40f-4377d56d975d/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-03 00:30:00,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:30:00,041 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 00:30:00,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:30:00,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 00:30:00,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-03 00:30:00,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-12-03 00:30:00,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-03 00:30:00,081 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 00:30:00,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:30:00,089 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2018-12-03 00:30:00,102 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 15 treesize of output 12 [2018-12-03 00:30:00,103 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-03 00:30:00,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 00:30:00,105 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:30:00,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:30:00,106 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-12-03 00:30:00,152 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-03 00:30:00,162 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 17 treesize of output 14 [2018-12-03 00:30:00,163 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-03 00:30:00,165 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 00:30:00,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-03 00:30:00,169 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-12-03 00:30:00,195 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-03 00:30:00,195 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 00:30:00,342 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 13 treesize of output 11 [2018-12-03 00:30:00,349 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-12-03 00:30:00,349 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 00:30:00,350 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:30:00,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-03 00:30:00,354 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:35 [2018-12-03 00:30:00,384 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-03 00:30:00,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 00:30:00,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24 [2018-12-03 00:30:00,399 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 00:30:00,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 00:30:00,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 00:30:00,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2018-12-03 00:30:00,399 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 17 states. [2018-12-03 00:30:00,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:30:00,904 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-12-03 00:30:00,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 00:30:00,904 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 26 [2018-12-03 00:30:00,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:30:00,904 INFO L225 Difference]: With dead ends: 44 [2018-12-03 00:30:00,905 INFO L226 Difference]: Without dead ends: 44 [2018-12-03 00:30:00,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=131, Invalid=861, Unknown=0, NotChecked=0, Total=992 [2018-12-03 00:30:00,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-03 00:30:00,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2018-12-03 00:30:00,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-03 00:30:00,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-12-03 00:30:00,906 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 26 [2018-12-03 00:30:00,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:30:00,906 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2018-12-03 00:30:00,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 00:30:00,906 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-12-03 00:30:00,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 00:30:00,906 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:30:00,906 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 00:30:00,906 INFO L423 AbstractCegarLoop]: === Iteration 27 === [cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-12-03 00:30:00,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:30:00,906 INFO L82 PathProgramCache]: Analyzing trace with hash -717821366, now seen corresponding path program 1 times [2018-12-03 00:30:00,907 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:30:00,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:30:00,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:30:00,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:30:00,907 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:30:00,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:30:00,984 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 00:30:00,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 00:30:00,985 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 00:30:00,985 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-12-03 00:30:00,985 INFO L205 CegarAbsIntRunner]: [0], [3], [8], [13], [14], [17], [22], [24], [33], [36], [39], [63], [64], [68], [73], [79], [81], [82], [85], [92], [93], [94], [96] [2018-12-03 00:30:00,986 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 00:30:00,986 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 00:30:01,005 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 00:30:01,005 INFO L272 AbstractInterpreter]: Visited 23 different actions 29 times. Merged at 5 different actions 5 times. Never widened. Performed 258 root evaluator evaluations with a maximum evaluation depth of 4. Performed 258 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 2 fixpoints after 2 different actions. Largest state had 31 variables. [2018-12-03 00:30:01,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:30:01,006 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 00:30:01,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 00:30:01,007 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e9162d06-cd4e-474f-a40f-4377d56d975d/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-03 00:30:01,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:30:01,013 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 00:30:01,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:30:01,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 00:30:01,045 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 00:30:01,045 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 00:30:01,067 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 00:30:01,081 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 00:30:01,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [10] total 14 [2018-12-03 00:30:01,082 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:30:01,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 00:30:01,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 00:30:01,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-12-03 00:30:01,082 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 4 states. [2018-12-03 00:30:01,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:30:01,091 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-12-03 00:30:01,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 00:30:01,092 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-12-03 00:30:01,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:30:01,092 INFO L225 Difference]: With dead ends: 44 [2018-12-03 00:30:01,092 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 00:30:01,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-12-03 00:30:01,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 00:30:01,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-03 00:30:01,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-03 00:30:01,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2018-12-03 00:30:01,093 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 27 [2018-12-03 00:30:01,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:30:01,093 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2018-12-03 00:30:01,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 00:30:01,093 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2018-12-03 00:30:01,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 00:30:01,093 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:30:01,093 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 00:30:01,094 INFO L423 AbstractCegarLoop]: === Iteration 28 === [cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-12-03 00:30:01,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:30:01,094 INFO L82 PathProgramCache]: Analyzing trace with hash -717786545, now seen corresponding path program 2 times [2018-12-03 00:30:01,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:30:01,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:30:01,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:30:01,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:30:01,094 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:30:01,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:30:01,307 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 00:30:01,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 00:30:01,308 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 00:30:01,308 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 00:30:01,308 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 00:30:01,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 00:30:01,308 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e9162d06-cd4e-474f-a40f-4377d56d975d/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-03 00:30:01,314 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 00:30:01,315 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 00:30:01,340 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-03 00:30:01,341 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 00:30:01,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 00:30:01,350 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-03 00:30:01,351 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 00:30:01,355 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-03 00:30:01,356 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-03 00:30:01,357 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 00:30:01,363 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:30:01,366 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-03 00:30:01,366 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 [2018-12-03 00:30:01,385 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 15 treesize of output 12 [2018-12-03 00:30:01,386 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-03 00:30:01,386 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 00:30:01,388 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:30:01,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:30:01,390 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-12-03 00:30:01,449 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 23 treesize of output 24 [2018-12-03 00:30:01,450 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-03 00:30:01,451 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 00:30:01,455 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:30:01,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:30:01,458 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2018-12-03 00:30:01,491 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-03 00:30:01,495 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 17 treesize of output 14 [2018-12-03 00:30:01,496 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-03 00:30:01,498 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 00:30:01,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-03 00:30:01,502 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-12-03 00:30:01,557 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 00:30:01,557 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 00:30:02,152 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 37 treesize of output 28 [2018-12-03 00:30:02,171 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-03 00:30:02,171 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 00:30:02,186 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 20 treesize of output 18 [2018-12-03 00:30:02,188 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-03 00:30:02,188 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 00:30:02,192 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:30:02,194 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 19 treesize of output 15 [2018-12-03 00:30:02,196 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 15 treesize of output 10 [2018-12-03 00:30:02,197 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 00:30:02,199 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:30:02,212 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-03 00:30:02,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-03 00:30:02,242 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:55, output treesize:84 [2018-12-03 00:30:02,310 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 00:30:02,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 00:30:02,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 32 [2018-12-03 00:30:02,325 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 00:30:02,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 00:30:02,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 00:30:02,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=956, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 00:30:02,326 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 23 states. [2018-12-03 00:30:02,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:30:02,991 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-12-03 00:30:02,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 00:30:02,991 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 27 [2018-12-03 00:30:02,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:30:02,991 INFO L225 Difference]: With dead ends: 44 [2018-12-03 00:30:02,992 INFO L226 Difference]: Without dead ends: 44 [2018-12-03 00:30:02,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=265, Invalid=1715, Unknown=0, NotChecked=0, Total=1980 [2018-12-03 00:30:02,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-03 00:30:02,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2018-12-03 00:30:02,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-03 00:30:02,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2018-12-03 00:30:02,993 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 27 [2018-12-03 00:30:02,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:30:02,993 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2018-12-03 00:30:02,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 00:30:02,993 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-12-03 00:30:02,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 00:30:02,993 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:30:02,993 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 00:30:02,993 INFO L423 AbstractCegarLoop]: === Iteration 29 === [cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-12-03 00:30:02,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:30:02,994 INFO L82 PathProgramCache]: Analyzing trace with hash -776546458, now seen corresponding path program 2 times [2018-12-03 00:30:02,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:30:02,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:30:02,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 00:30:02,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:30:02,994 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:30:03,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:30:03,109 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 00:30:03,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 00:30:03,110 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 00:30:03,110 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 00:30:03,110 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 00:30:03,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 00:30:03,110 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e9162d06-cd4e-474f-a40f-4377d56d975d/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-03 00:30:03,118 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 00:30:03,118 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 00:30:03,143 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-03 00:30:03,143 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 00:30:03,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 00:30:03,153 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-03 00:30:03,155 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-03 00:30:03,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 00:30:03,158 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:30:03,163 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-03 00:30:03,163 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 00:30:03,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:30:03,167 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2018-12-03 00:30:03,261 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 00:30:03,261 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 00:30:03,426 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 00:30:03,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 00:30:03,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 25 [2018-12-03 00:30:03,441 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 00:30:03,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 00:30:03,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 00:30:03,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2018-12-03 00:30:03,442 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 17 states. [2018-12-03 00:30:03,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:30:03,982 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2018-12-03 00:30:03,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 00:30:03,982 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 28 [2018-12-03 00:30:03,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:30:03,983 INFO L225 Difference]: With dead ends: 55 [2018-12-03 00:30:03,983 INFO L226 Difference]: Without dead ends: 55 [2018-12-03 00:30:03,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=1037, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 00:30:03,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-03 00:30:03,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2018-12-03 00:30:03,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-03 00:30:03,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-12-03 00:30:03,988 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 28 [2018-12-03 00:30:03,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:30:03,988 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-12-03 00:30:03,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 00:30:03,989 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-12-03 00:30:03,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-03 00:30:03,989 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:30:03,989 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-03 00:30:03,989 INFO L423 AbstractCegarLoop]: === Iteration 30 === [cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-12-03 00:30:03,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:30:03,990 INFO L82 PathProgramCache]: Analyzing trace with hash -138511059, now seen corresponding path program 1 times [2018-12-03 00:30:03,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:30:03,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:30:03,991 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 00:30:03,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:30:03,992 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:30:04,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:30:04,213 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-03 00:30:04,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 00:30:04,214 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 00:30:04,214 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-12-03 00:30:04,214 INFO L205 CegarAbsIntRunner]: [0], [3], [8], [11], [13], [14], [17], [24], [33], [36], [37], [46], [47], [49], [54], [63], [64], [68], [73], [79], [81], [82], [85], [92], [93], [94], [96] [2018-12-03 00:30:04,215 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 00:30:04,215 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 00:30:04,240 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 00:30:04,240 INFO L272 AbstractInterpreter]: Visited 27 different actions 40 times. Merged at 12 different actions 12 times. Never widened. Performed 350 root evaluator evaluations with a maximum evaluation depth of 4. Performed 350 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 3 fixpoints after 3 different actions. Largest state had 34 variables. [2018-12-03 00:30:04,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:30:04,241 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 00:30:04,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 00:30:04,241 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e9162d06-cd4e-474f-a40f-4377d56d975d/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 00:30:04,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:30:04,248 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 00:30:04,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:30:04,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 00:30:04,269 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-03 00:30:04,271 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-03 00:30:04,272 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 00:30:04,275 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:30:04,281 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-03 00:30:04,281 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 00:30:04,285 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-03 00:30:04,285 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 [2018-12-03 00:30:04,300 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 15 treesize of output 12 [2018-12-03 00:30:04,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 12 treesize of output 11 [2018-12-03 00:30:04,301 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 00:30:04,302 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:30:04,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:30:04,307 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-12-03 00:30:04,392 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 23 treesize of output 24 [2018-12-03 00:30:04,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 8 treesize of output 7 [2018-12-03 00:30:04,394 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 00:30:04,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:30:04,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:30:04,402 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2018-12-03 00:30:04,422 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 23 treesize of output 24 [2018-12-03 00:30:04,423 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-03 00:30:04,424 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 00:30:04,427 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:30:04,431 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-03 00:30:04,431 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-12-03 00:30:04,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-12-03 00:30:04,493 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 17 treesize of output 14 [2018-12-03 00:30:04,493 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-03 00:30:04,499 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 5 treesize of output 1 [2018-12-03 00:30:04,499 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 00:30:04,502 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 00:30:04,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-03 00:30:04,508 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2018-12-03 00:30:04,549 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 00:30:04,550 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 00:30:04,969 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 37 treesize of output 28 [2018-12-03 00:30:04,981 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-03 00:30:04,981 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 00:30:04,992 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 20 treesize of output 18 [2018-12-03 00:30:04,994 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-03 00:30:04,994 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 00:30:04,997 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:30:04,998 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 19 treesize of output 15 [2018-12-03 00:30:05,000 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 15 treesize of output 10 [2018-12-03 00:30:05,000 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 00:30:05,002 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:30:05,010 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-03 00:30:05,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-03 00:30:05,026 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:55, output treesize:84 [2018-12-03 00:30:05,079 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-03 00:30:05,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 00:30:05,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 34 [2018-12-03 00:30:05,096 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 00:30:05,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 00:30:05,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 00:30:05,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1079, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 00:30:05,097 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 24 states. [2018-12-03 00:30:06,763 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 43 [2018-12-03 00:30:06,985 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2018-12-03 00:30:07,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:30:07,067 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2018-12-03 00:30:07,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 00:30:07,068 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 29 [2018-12-03 00:30:07,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:30:07,069 INFO L225 Difference]: With dead ends: 54 [2018-12-03 00:30:07,069 INFO L226 Difference]: Without dead ends: 44 [2018-12-03 00:30:07,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=328, Invalid=2324, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 00:30:07,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-03 00:30:07,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-03 00:30:07,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-03 00:30:07,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2018-12-03 00:30:07,074 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 29 [2018-12-03 00:30:07,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:30:07,075 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2018-12-03 00:30:07,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 00:30:07,076 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-12-03 00:30:07,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 00:30:07,076 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:30:07,077 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-03 00:30:07,077 INFO L423 AbstractCegarLoop]: === Iteration 31 === [cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-12-03 00:30:07,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:30:07,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1440841946, now seen corresponding path program 2 times [2018-12-03 00:30:07,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:30:07,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:30:07,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:30:07,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:30:07,079 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:30:07,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:30:07,307 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 00:30:07,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 00:30:07,307 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 00:30:07,307 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 00:30:07,307 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 00:30:07,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 00:30:07,307 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e9162d06-cd4e-474f-a40f-4377d56d975d/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 00:30:07,318 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 00:30:07,318 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 00:30:07,343 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-03 00:30:07,343 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 00:30:07,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 00:30:07,355 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-03 00:30:07,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-03 00:30:07,357 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 00:30:07,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:30:07,365 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-03 00:30:07,366 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 00:30:07,369 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-03 00:30:07,369 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 [2018-12-03 00:30:07,384 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 15 treesize of output 12 [2018-12-03 00:30:07,385 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-03 00:30:07,385 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 00:30:07,386 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:30:07,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:30:07,389 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-12-03 00:30:07,444 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 23 treesize of output 24 [2018-12-03 00:30:07,445 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-03 00:30:07,445 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 00:30:07,448 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:30:07,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:30:07,451 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-12-03 00:30:07,470 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-03 00:30:07,474 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 17 treesize of output 14 [2018-12-03 00:30:07,474 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-03 00:30:07,477 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 00:30:07,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-03 00:30:07,481 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-12-03 00:30:07,541 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 00:30:07,541 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 00:30:07,800 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 39 treesize of output 30 [2018-12-03 00:30:07,812 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-03 00:30:07,812 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 00:30:07,823 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 22 treesize of output 20 [2018-12-03 00:30:07,824 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-03 00:30:07,825 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 00:30:07,828 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:30:07,829 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-03 00:30:07,831 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-03 00:30:07,831 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 00:30:07,833 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:30:07,842 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-03 00:30:07,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-03 00:30:07,860 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:55, output treesize:84 [2018-12-03 00:30:07,909 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 00:30:07,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 00:30:07,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 11] total 31 [2018-12-03 00:30:07,924 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 00:30:07,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 00:30:07,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 00:30:07,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=896, Unknown=0, NotChecked=0, Total=992 [2018-12-03 00:30:07,924 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 22 states. [2018-12-03 00:30:08,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:30:08,550 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-12-03 00:30:08,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 00:30:08,550 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 31 [2018-12-03 00:30:08,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:30:08,551 INFO L225 Difference]: With dead ends: 45 [2018-12-03 00:30:08,551 INFO L226 Difference]: Without dead ends: 38 [2018-12-03 00:30:08,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=274, Invalid=1888, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 00:30:08,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-03 00:30:08,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-03 00:30:08,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-03 00:30:08,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-12-03 00:30:08,553 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 31 [2018-12-03 00:30:08,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:30:08,553 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-12-03 00:30:08,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 00:30:08,553 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-12-03 00:30:08,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 00:30:08,553 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:30:08,553 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 00:30:08,554 INFO L423 AbstractCegarLoop]: === Iteration 32 === [cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-12-03 00:30:08,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:30:08,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1576153278, now seen corresponding path program 3 times [2018-12-03 00:30:08,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:30:08,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:30:08,554 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 00:30:08,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:30:08,555 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:30:08,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:30:08,660 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 00:30:08,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 00:30:08,660 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 00:30:08,660 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 00:30:08,660 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 00:30:08,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 00:30:08,660 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e9162d06-cd4e-474f-a40f-4377d56d975d/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 00:30:08,666 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 00:30:08,666 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 00:30:08,694 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 00:30:08,694 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 00:30:08,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 00:30:08,709 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-03 00:30:08,709 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 00:30:08,714 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-03 00:30:08,716 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-03 00:30:08,716 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 00:30:08,719 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:30:08,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 00:30:08,724 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2018-12-03 00:30:08,906 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 00:30:08,906 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 00:30:09,132 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 00:30:09,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 00:30:09,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 30 [2018-12-03 00:30:09,146 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 00:30:09,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 00:30:09,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 00:30:09,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=837, Unknown=0, NotChecked=0, Total=930 [2018-12-03 00:30:09,147 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 20 states. [2018-12-03 00:30:09,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:30:09,833 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-12-03 00:30:09,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 00:30:09,833 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 33 [2018-12-03 00:30:09,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:30:09,833 INFO L225 Difference]: With dead ends: 45 [2018-12-03 00:30:09,833 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 00:30:09,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=342, Invalid=2010, Unknown=0, NotChecked=0, Total=2352 [2018-12-03 00:30:09,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 00:30:09,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 00:30:09,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 00:30:09,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 00:30:09,834 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2018-12-03 00:30:09,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:30:09,834 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 00:30:09,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 00:30:09,834 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 00:30:09,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 00:30:09,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 12:30:09 BoogieIcfgContainer [2018-12-03 00:30:09,837 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 00:30:09,838 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 00:30:09,838 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 00:30:09,838 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 00:30:09,838 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 12:29:54" (3/4) ... [2018-12-03 00:30:09,840 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-03 00:30:09,843 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrlcpy [2018-12-03 00:30:09,843 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-03 00:30:09,844 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-03 00:30:09,846 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2018-12-03 00:30:09,846 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-03 00:30:09,846 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-03 00:30:09,871 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_e9162d06-cd4e-474f-a40f-4377d56d975d/bin-2019/utaipan/witness.graphml [2018-12-03 00:30:09,871 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 00:30:09,871 INFO L168 Benchmark]: Toolchain (without parser) took 16169.24 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 402.1 MB). Free memory was 952.4 MB in the beginning and 987.9 MB in the end (delta: -35.5 MB). Peak memory consumption was 366.6 MB. Max. memory is 11.5 GB. [2018-12-03 00:30:09,872 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 00:30:09,872 INFO L168 Benchmark]: CACSL2BoogieTranslator took 250.27 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.3 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -125.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2018-12-03 00:30:09,872 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.17 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-03 00:30:09,872 INFO L168 Benchmark]: Boogie Preprocessor took 16.66 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-03 00:30:09,872 INFO L168 Benchmark]: RCFGBuilder took 195.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 28.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. [2018-12-03 00:30:09,872 INFO L168 Benchmark]: TraceAbstraction took 15653.37 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 308.8 MB). Free memory was 1.0 GB in the beginning and 987.9 MB in the end (delta: 60.9 MB). Peak memory consumption was 369.8 MB. Max. memory is 11.5 GB. [2018-12-03 00:30:09,872 INFO L168 Benchmark]: Witness Printer took 33.19 ms. Allocated memory is still 1.4 GB. Free memory is still 987.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 00:30:09,873 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 250.27 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.3 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -125.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.17 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. * Boogie Preprocessor took 16.66 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 195.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 28.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15653.37 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 308.8 MB). Free memory was 1.0 GB in the beginning and 987.9 MB in the end (delta: 60.9 MB). Peak memory consumption was 369.8 MB. Max. memory is 11.5 GB. * Witness Printer took 33.19 ms. Allocated memory is still 1.4 GB. Free memory is still 987.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 554]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 554]: 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: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: 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: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 571]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 560]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 571]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 572]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 572]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 13 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 46 locations, 13 error locations. SAFE Result, 15.6s OverallTime, 32 OverallIterations, 4 TraceHistogramMax, 7.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 935 SDtfs, 1219 SDslu, 3637 SDs, 0 SdLazy, 3471 SolverSat, 295 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 905 GetRequests, 409 SyntacticMatches, 11 SemanticMatches, 485 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2416 ImplicationChecksByTransitivity, 10.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 6 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 32 MinimizatonAttempts, 157 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 939 NumberOfCodeBlocks, 939 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 1157 ConstructedInterpolants, 64 QuantifiedInterpolants, 316921 SizeOfPredicates, 191 NumberOfNonLiveVariables, 1752 ConjunctsInSsa, 437 ConjunctsInUnsatCore, 52 InterpolantComputations, 24 PerfectInterpolantSequences, 25/249 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...