./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_f3acdb36-c6c5-4410-be85-3018b2804636/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f3acdb36-c6c5-4410-be85-3018b2804636/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f3acdb36-c6c5-4410-be85-3018b2804636/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f3acdb36-c6c5-4410-be85-3018b2804636/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_f3acdb36-c6c5-4410-be85-3018b2804636/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f3acdb36-c6c5-4410-be85-3018b2804636/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-09 00:23:06,487 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 00:23:06,488 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 00:23:06,494 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 00:23:06,494 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 00:23:06,495 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 00:23:06,495 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 00:23:06,496 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 00:23:06,497 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 00:23:06,498 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 00:23:06,498 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 00:23:06,498 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 00:23:06,499 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 00:23:06,499 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 00:23:06,500 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 00:23:06,500 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 00:23:06,501 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 00:23:06,502 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 00:23:06,503 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 00:23:06,503 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 00:23:06,504 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 00:23:06,504 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 00:23:06,506 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 00:23:06,506 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 00:23:06,506 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 00:23:06,506 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 00:23:06,507 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 00:23:06,507 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 00:23:06,508 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 00:23:06,508 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 00:23:06,508 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 00:23:06,509 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 00:23:06,509 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 00:23:06,509 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 00:23:06,510 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 00:23:06,510 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 00:23:06,510 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f3acdb36-c6c5-4410-be85-3018b2804636/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-09 00:23:06,518 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 00:23:06,518 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 00:23:06,519 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 00:23:06,519 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 00:23:06,519 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 00:23:06,519 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 00:23:06,519 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 00:23:06,520 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 00:23:06,520 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 00:23:06,520 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 00:23:06,520 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 00:23:06,520 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 00:23:06,520 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 00:23:06,520 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 00:23:06,521 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 00:23:06,521 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 00:23:06,521 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 00:23:06,521 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 00:23:06,521 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 00:23:06,521 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 00:23:06,521 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 00:23:06,521 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 00:23:06,522 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 00:23:06,522 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 00:23:06,522 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 00:23:06,522 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 00:23:06,522 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 00:23:06,522 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 00:23:06,522 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 00:23:06,522 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 00:23:06,522 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 00:23:06,522 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 00:23:06,523 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 00:23:06,523 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 00:23:06,523 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 00:23:06,523 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 00:23:06,523 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_f3acdb36-c6c5-4410-be85-3018b2804636/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-09 00:23:06,541 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 00:23:06,547 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 00:23:06,549 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 00:23:06,550 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 00:23:06,550 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 00:23:06,551 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f3acdb36-c6c5-4410-be85-3018b2804636/bin-2019/utaipan/../../sv-benchmarks/c/array-memsafety/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-12-09 00:23:06,586 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f3acdb36-c6c5-4410-be85-3018b2804636/bin-2019/utaipan/data/9ce099f45/23053ba509084c1ba48d8d8f5f2be004/FLAG677753fa3 [2018-12-09 00:23:07,040 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 00:23:07,040 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f3acdb36-c6c5-4410-be85-3018b2804636/sv-benchmarks/c/array-memsafety/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-12-09 00:23:07,047 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f3acdb36-c6c5-4410-be85-3018b2804636/bin-2019/utaipan/data/9ce099f45/23053ba509084c1ba48d8d8f5f2be004/FLAG677753fa3 [2018-12-09 00:23:07,055 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f3acdb36-c6c5-4410-be85-3018b2804636/bin-2019/utaipan/data/9ce099f45/23053ba509084c1ba48d8d8f5f2be004 [2018-12-09 00:23:07,057 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 00:23:07,057 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 00:23:07,058 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 00:23:07,058 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 00:23:07,060 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 00:23:07,060 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:23:07" (1/1) ... [2018-12-09 00:23:07,062 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25c26117 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:23:07, skipping insertion in model container [2018-12-09 00:23:07,062 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:23:07" (1/1) ... [2018-12-09 00:23:07,067 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 00:23:07,087 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 00:23:07,239 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:23:07,245 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 00:23:07,301 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:23:07,326 INFO L195 MainTranslator]: Completed translation [2018-12-09 00:23:07,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:23:07 WrapperNode [2018-12-09 00:23:07,326 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 00:23:07,327 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 00:23:07,327 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 00:23:07,327 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 00:23:07,331 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:23:07" (1/1) ... [2018-12-09 00:23:07,339 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:23:07" (1/1) ... [2018-12-09 00:23:07,344 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 00:23:07,344 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 00:23:07,344 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 00:23:07,345 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 00:23:07,350 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:23:07" (1/1) ... [2018-12-09 00:23:07,350 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:23:07" (1/1) ... [2018-12-09 00:23:07,352 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:23:07" (1/1) ... [2018-12-09 00:23:07,352 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:23:07" (1/1) ... [2018-12-09 00:23:07,357 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:23:07" (1/1) ... [2018-12-09 00:23:07,360 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:23:07" (1/1) ... [2018-12-09 00:23:07,361 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:23:07" (1/1) ... [2018-12-09 00:23:07,362 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 00:23:07,362 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 00:23:07,362 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 00:23:07,362 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 00:23:07,363 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:23:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3acdb36-c6c5-4410-be85-3018b2804636/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-09 00:23:07,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 00:23:07,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 00:23:07,394 INFO L130 BoogieDeclarations]: Found specification of procedure cstrlcpy [2018-12-09 00:23:07,395 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrlcpy [2018-12-09 00:23:07,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 00:23:07,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 00:23:07,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 00:23:07,395 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 00:23:07,395 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 00:23:07,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 00:23:07,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 00:23:07,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 00:23:07,550 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 00:23:07,550 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-09 00:23:07,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:23:07 BoogieIcfgContainer [2018-12-09 00:23:07,551 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 00:23:07,551 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 00:23:07,551 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 00:23:07,553 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 00:23:07,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 12:23:07" (1/3) ... [2018-12-09 00:23:07,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3557111c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:23:07, skipping insertion in model container [2018-12-09 00:23:07,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:23:07" (2/3) ... [2018-12-09 00:23:07,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3557111c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:23:07, skipping insertion in model container [2018-12-09 00:23:07,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:23:07" (3/3) ... [2018-12-09 00:23:07,555 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-12-09 00:23:07,561 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 00:23:07,566 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-12-09 00:23:07,575 INFO L257 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2018-12-09 00:23:07,592 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 00:23:07,592 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 00:23:07,592 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 00:23:07,592 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 00:23:07,592 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 00:23:07,592 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 00:23:07,592 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 00:23:07,592 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 00:23:07,601 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-12-09 00:23:07,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 00:23:07,606 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:23:07,607 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:23:07,608 INFO L423 AbstractCegarLoop]: === Iteration 1 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 00:23:07,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:23:07,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1336499281, now seen corresponding path program 1 times [2018-12-09 00:23:07,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:23:07,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:23:07,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:23:07,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:23:07,641 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:23:07,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:23:07,711 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-09 00:23:07,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:23:07,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 00:23:07,712 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:23:07,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:23:07,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:23:07,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:23:07,725 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-12-09 00:23:07,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:23:07,767 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2018-12-09 00:23:07,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:23:07,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-09 00:23:07,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:23:07,774 INFO L225 Difference]: With dead ends: 45 [2018-12-09 00:23:07,774 INFO L226 Difference]: Without dead ends: 42 [2018-12-09 00:23:07,776 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-09 00:23:07,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-09 00:23:07,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-09 00:23:07,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-09 00:23:07,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2018-12-09 00:23:07,799 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 10 [2018-12-09 00:23:07,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:23:07,799 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2018-12-09 00:23:07,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:23:07,800 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2018-12-09 00:23:07,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 00:23:07,800 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:23:07,800 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:23:07,800 INFO L423 AbstractCegarLoop]: === Iteration 2 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 00:23:07,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:23:07,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1336499280, now seen corresponding path program 1 times [2018-12-09 00:23:07,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:23:07,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:23:07,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:23:07,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:23:07,802 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:23:07,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:23:07,848 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-09 00:23:07,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:23:07,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:23:07,849 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:23:07,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:23:07,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:23:07,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:23:07,850 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 4 states. [2018-12-09 00:23:07,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:23:07,865 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2018-12-09 00:23:07,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 00:23:07,866 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-09 00:23:07,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:23:07,866 INFO L225 Difference]: With dead ends: 41 [2018-12-09 00:23:07,866 INFO L226 Difference]: Without dead ends: 41 [2018-12-09 00:23:07,867 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-09 00:23:07,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-09 00:23:07,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-09 00:23:07,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-09 00:23:07,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2018-12-09 00:23:07,869 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 10 [2018-12-09 00:23:07,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:23:07,870 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2018-12-09 00:23:07,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:23:07,870 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2018-12-09 00:23:07,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 00:23:07,870 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:23:07,870 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:23:07,870 INFO L423 AbstractCegarLoop]: === Iteration 3 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 00:23:07,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:23:07,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1518195304, now seen corresponding path program 1 times [2018-12-09 00:23:07,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:23:07,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:23:07,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:23:07,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:23:07,871 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:23:07,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:23:07,888 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-09 00:23:07,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:23:07,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 00:23:07,888 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:23:07,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:23:07,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:23:07,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:23:07,888 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand 3 states. [2018-12-09 00:23:07,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:23:07,908 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2018-12-09 00:23:07,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:23:07,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-09 00:23:07,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:23:07,909 INFO L225 Difference]: With dead ends: 40 [2018-12-09 00:23:07,909 INFO L226 Difference]: Without dead ends: 40 [2018-12-09 00:23:07,909 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-09 00:23:07,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-09 00:23:07,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-09 00:23:07,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-09 00:23:07,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2018-12-09 00:23:07,912 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 11 [2018-12-09 00:23:07,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:23:07,912 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2018-12-09 00:23:07,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:23:07,912 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2018-12-09 00:23:07,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 00:23:07,912 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:23:07,912 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:23:07,913 INFO L423 AbstractCegarLoop]: === Iteration 4 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 00:23:07,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:23:07,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1518195305, now seen corresponding path program 1 times [2018-12-09 00:23:07,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:23:07,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:23:07,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:23:07,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:23:07,914 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:23:07,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:23:07,947 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-09 00:23:07,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:23:07,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:23:07,948 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:23:07,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:23:07,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:23:07,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:23:07,948 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand 4 states. [2018-12-09 00:23:07,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:23:07,957 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2018-12-09 00:23:07,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 00:23:07,958 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-09 00:23:07,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:23:07,958 INFO L225 Difference]: With dead ends: 39 [2018-12-09 00:23:07,958 INFO L226 Difference]: Without dead ends: 39 [2018-12-09 00:23:07,958 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-09 00:23:07,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-09 00:23:07,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-09 00:23:07,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-09 00:23:07,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2018-12-09 00:23:07,960 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 11 [2018-12-09 00:23:07,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:23:07,961 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2018-12-09 00:23:07,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:23:07,961 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2018-12-09 00:23:07,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-09 00:23:07,961 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:23:07,961 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:23:07,961 INFO L423 AbstractCegarLoop]: === Iteration 5 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 00:23:07,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:23:07,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1848843889, now seen corresponding path program 1 times [2018-12-09 00:23:07,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:23:07,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:23:07,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:23:07,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:23:07,963 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:23:07,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:23:08,035 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-09 00:23:08,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:23:08,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 00:23:08,035 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:23:08,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 00:23:08,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 00:23:08,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:23:08,036 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand 8 states. [2018-12-09 00:23:08,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:23:08,117 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2018-12-09 00:23:08,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:23:08,118 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-12-09 00:23:08,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:23:08,119 INFO L225 Difference]: With dead ends: 56 [2018-12-09 00:23:08,120 INFO L226 Difference]: Without dead ends: 56 [2018-12-09 00:23:08,120 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-09 00:23:08,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-09 00:23:08,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 42. [2018-12-09 00:23:08,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-09 00:23:08,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2018-12-09 00:23:08,123 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 17 [2018-12-09 00:23:08,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:23:08,123 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2018-12-09 00:23:08,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 00:23:08,123 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2018-12-09 00:23:08,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-09 00:23:08,123 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:23:08,123 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:23:08,124 INFO L423 AbstractCegarLoop]: === Iteration 6 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 00:23:08,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:23:08,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1848843890, now seen corresponding path program 1 times [2018-12-09 00:23:08,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:23:08,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:23:08,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:23:08,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:23:08,125 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:23:08,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:23:08,158 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-09 00:23:08,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:23:08,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:23:08,158 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:23:08,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:23:08,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:23:08,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:23:08,159 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand 6 states. [2018-12-09 00:23:08,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:23:08,205 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2018-12-09 00:23:08,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 00:23:08,206 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-12-09 00:23:08,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:23:08,207 INFO L225 Difference]: With dead ends: 41 [2018-12-09 00:23:08,207 INFO L226 Difference]: Without dead ends: 41 [2018-12-09 00:23:08,207 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-09 00:23:08,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-09 00:23:08,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-09 00:23:08,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-09 00:23:08,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2018-12-09 00:23:08,210 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 17 [2018-12-09 00:23:08,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:23:08,210 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2018-12-09 00:23:08,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:23:08,210 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2018-12-09 00:23:08,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-09 00:23:08,210 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:23:08,210 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:23:08,211 INFO L423 AbstractCegarLoop]: === Iteration 7 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 00:23:08,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:23:08,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1848044563, now seen corresponding path program 1 times [2018-12-09 00:23:08,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:23:08,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:23:08,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:23:08,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:23:08,212 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:23:08,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:23:08,235 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-09 00:23:08,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:23:08,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 00:23:08,235 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:23:08,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:23:08,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:23:08,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:23:08,236 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 5 states. [2018-12-09 00:23:08,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:23:08,269 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2018-12-09 00:23:08,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 00:23:08,270 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-12-09 00:23:08,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:23:08,270 INFO L225 Difference]: With dead ends: 40 [2018-12-09 00:23:08,270 INFO L226 Difference]: Without dead ends: 40 [2018-12-09 00:23:08,270 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-09 00:23:08,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-09 00:23:08,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-09 00:23:08,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-09 00:23:08,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2018-12-09 00:23:08,272 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 17 [2018-12-09 00:23:08,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:23:08,273 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2018-12-09 00:23:08,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:23:08,273 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-12-09 00:23:08,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-09 00:23:08,273 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:23:08,273 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:23:08,273 INFO L423 AbstractCegarLoop]: === Iteration 8 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 00:23:08,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:23:08,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1848044562, now seen corresponding path program 1 times [2018-12-09 00:23:08,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:23:08,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:23:08,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:23:08,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:23:08,274 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:23:08,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:23:08,310 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-09 00:23:08,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:23:08,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:23:08,310 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:23:08,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:23:08,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:23:08,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:23:08,311 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 5 states. [2018-12-09 00:23:08,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:23:08,345 INFO L93 Difference]: Finished difference Result 72 states and 85 transitions. [2018-12-09 00:23:08,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 00:23:08,345 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-12-09 00:23:08,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:23:08,346 INFO L225 Difference]: With dead ends: 72 [2018-12-09 00:23:08,346 INFO L226 Difference]: Without dead ends: 72 [2018-12-09 00:23:08,346 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-09 00:23:08,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-09 00:23:08,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 63. [2018-12-09 00:23:08,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-09 00:23:08,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 83 transitions. [2018-12-09 00:23:08,349 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 83 transitions. Word has length 17 [2018-12-09 00:23:08,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:23:08,350 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 83 transitions. [2018-12-09 00:23:08,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:23:08,350 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 83 transitions. [2018-12-09 00:23:08,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-09 00:23:08,350 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:23:08,350 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:23:08,350 INFO L423 AbstractCegarLoop]: === Iteration 9 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 00:23:08,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:23:08,351 INFO L82 PathProgramCache]: Analyzing trace with hash 2053895724, now seen corresponding path program 1 times [2018-12-09 00:23:08,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:23:08,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:23:08,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:23:08,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:23:08,351 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:23:08,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:23:08,393 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-09 00:23:08,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:23:08,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:23:08,394 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:23:08,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 00:23:08,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 00:23:08,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:23:08,395 INFO L87 Difference]: Start difference. First operand 63 states and 83 transitions. Second operand 7 states. [2018-12-09 00:23:08,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:23:08,447 INFO L93 Difference]: Finished difference Result 83 states and 111 transitions. [2018-12-09 00:23:08,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 00:23:08,447 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-12-09 00:23:08,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:23:08,448 INFO L225 Difference]: With dead ends: 83 [2018-12-09 00:23:08,448 INFO L226 Difference]: Without dead ends: 83 [2018-12-09 00:23:08,448 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-09 00:23:08,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-09 00:23:08,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 69. [2018-12-09 00:23:08,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-09 00:23:08,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 93 transitions. [2018-12-09 00:23:08,451 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 93 transitions. Word has length 17 [2018-12-09 00:23:08,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:23:08,451 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 93 transitions. [2018-12-09 00:23:08,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 00:23:08,452 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 93 transitions. [2018-12-09 00:23:08,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 00:23:08,452 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:23:08,452 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-09 00:23:08,452 INFO L423 AbstractCegarLoop]: === Iteration 10 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 00:23:08,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:23:08,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1479585755, now seen corresponding path program 1 times [2018-12-09 00:23:08,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:23:08,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:23:08,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:23:08,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:23:08,453 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:23:08,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:23:08,477 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-09 00:23:08,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:23:08,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:23:08,477 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:23:08,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:23:08,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:23:08,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:23:08,478 INFO L87 Difference]: Start difference. First operand 69 states and 93 transitions. Second operand 6 states. [2018-12-09 00:23:08,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:23:08,539 INFO L93 Difference]: Finished difference Result 68 states and 91 transitions. [2018-12-09 00:23:08,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 00:23:08,539 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-12-09 00:23:08,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:23:08,540 INFO L225 Difference]: With dead ends: 68 [2018-12-09 00:23:08,540 INFO L226 Difference]: Without dead ends: 68 [2018-12-09 00:23:08,540 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-09 00:23:08,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-09 00:23:08,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-09 00:23:08,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-09 00:23:08,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 91 transitions. [2018-12-09 00:23:08,545 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 91 transitions. Word has length 18 [2018-12-09 00:23:08,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:23:08,545 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 91 transitions. [2018-12-09 00:23:08,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:23:08,546 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 91 transitions. [2018-12-09 00:23:08,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 00:23:08,546 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:23:08,546 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-09 00:23:08,546 INFO L423 AbstractCegarLoop]: === Iteration 11 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 00:23:08,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:23:08,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1479585754, now seen corresponding path program 1 times [2018-12-09 00:23:08,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:23:08,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:23:08,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:23:08,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:23:08,548 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:23:08,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:23:08,618 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-09 00:23:08,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:23:08,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 00:23:08,619 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:23:08,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 00:23:08,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 00:23:08,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:23:08,619 INFO L87 Difference]: Start difference. First operand 68 states and 91 transitions. Second operand 8 states. [2018-12-09 00:23:08,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:23:08,689 INFO L93 Difference]: Finished difference Result 86 states and 115 transitions. [2018-12-09 00:23:08,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:23:08,689 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-12-09 00:23:08,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:23:08,690 INFO L225 Difference]: With dead ends: 86 [2018-12-09 00:23:08,690 INFO L226 Difference]: Without dead ends: 86 [2018-12-09 00:23:08,690 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-09 00:23:08,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-09 00:23:08,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 70. [2018-12-09 00:23:08,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-09 00:23:08,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 93 transitions. [2018-12-09 00:23:08,695 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 93 transitions. Word has length 18 [2018-12-09 00:23:08,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:23:08,695 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 93 transitions. [2018-12-09 00:23:08,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 00:23:08,696 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 93 transitions. [2018-12-09 00:23:08,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 00:23:08,696 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:23:08,696 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-09 00:23:08,696 INFO L423 AbstractCegarLoop]: === Iteration 12 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 00:23:08,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:23:08,697 INFO L82 PathProgramCache]: Analyzing trace with hash -753736926, now seen corresponding path program 1 times [2018-12-09 00:23:08,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:23:08,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:23:08,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:23:08,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:23:08,698 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:23:08,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:23:08,729 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-09 00:23:08,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:23:08,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:23:08,730 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:23:08,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:23:08,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:23:08,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:23:08,730 INFO L87 Difference]: Start difference. First operand 70 states and 93 transitions. Second operand 6 states. [2018-12-09 00:23:08,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:23:08,772 INFO L93 Difference]: Finished difference Result 69 states and 91 transitions. [2018-12-09 00:23:08,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 00:23:08,772 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-12-09 00:23:08,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:23:08,773 INFO L225 Difference]: With dead ends: 69 [2018-12-09 00:23:08,773 INFO L226 Difference]: Without dead ends: 69 [2018-12-09 00:23:08,773 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-09 00:23:08,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-09 00:23:08,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-12-09 00:23:08,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-09 00:23:08,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2018-12-09 00:23:08,775 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 91 transitions. Word has length 18 [2018-12-09 00:23:08,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:23:08,775 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 91 transitions. [2018-12-09 00:23:08,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:23:08,775 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 91 transitions. [2018-12-09 00:23:08,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 00:23:08,776 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:23:08,776 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-09 00:23:08,776 INFO L423 AbstractCegarLoop]: === Iteration 13 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 00:23:08,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:23:08,776 INFO L82 PathProgramCache]: Analyzing trace with hash -753736925, now seen corresponding path program 1 times [2018-12-09 00:23:08,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:23:08,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:23:08,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:23:08,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:23:08,777 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:23:08,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:23:08,827 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-09 00:23:08,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:23:08,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 00:23:08,827 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:23:08,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 00:23:08,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 00:23:08,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:23:08,828 INFO L87 Difference]: Start difference. First operand 69 states and 91 transitions. Second operand 8 states. [2018-12-09 00:23:08,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:23:08,889 INFO L93 Difference]: Finished difference Result 81 states and 105 transitions. [2018-12-09 00:23:08,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:23:08,889 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-12-09 00:23:08,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:23:08,890 INFO L225 Difference]: With dead ends: 81 [2018-12-09 00:23:08,890 INFO L226 Difference]: Without dead ends: 81 [2018-12-09 00:23:08,890 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-09 00:23:08,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-09 00:23:08,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 73. [2018-12-09 00:23:08,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-09 00:23:08,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 95 transitions. [2018-12-09 00:23:08,894 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 95 transitions. Word has length 18 [2018-12-09 00:23:08,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:23:08,894 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 95 transitions. [2018-12-09 00:23:08,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 00:23:08,895 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 95 transitions. [2018-12-09 00:23:08,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 00:23:08,895 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:23:08,895 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-09 00:23:08,895 INFO L423 AbstractCegarLoop]: === Iteration 14 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 00:23:08,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:23:08,896 INFO L82 PathProgramCache]: Analyzing trace with hash -2023325217, now seen corresponding path program 1 times [2018-12-09 00:23:08,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:23:08,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:23:08,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:23:08,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:23:08,896 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:23:08,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:23:08,910 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-09 00:23:08,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:23:08,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:23:08,910 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:23:08,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:23:08,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:23:08,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:23:08,911 INFO L87 Difference]: Start difference. First operand 73 states and 95 transitions. Second operand 3 states. [2018-12-09 00:23:08,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:23:08,918 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2018-12-09 00:23:08,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:23:08,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-09 00:23:08,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:23:08,918 INFO L225 Difference]: With dead ends: 80 [2018-12-09 00:23:08,919 INFO L226 Difference]: Without dead ends: 80 [2018-12-09 00:23:08,919 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-09 00:23:08,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-09 00:23:08,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2018-12-09 00:23:08,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-09 00:23:08,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 96 transitions. [2018-12-09 00:23:08,921 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 96 transitions. Word has length 20 [2018-12-09 00:23:08,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:23:08,921 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 96 transitions. [2018-12-09 00:23:08,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:23:08,922 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 96 transitions. [2018-12-09 00:23:08,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 00:23:08,922 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:23:08,922 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-09 00:23:08,922 INFO L423 AbstractCegarLoop]: === Iteration 15 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 00:23:08,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:23:08,923 INFO L82 PathProgramCache]: Analyzing trace with hash -487715400, now seen corresponding path program 1 times [2018-12-09 00:23:08,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:23:08,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:23:08,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:23:08,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:23:08,923 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:23:08,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:23:08,978 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-09 00:23:08,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:23:08,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:23:08,978 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:23:08,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:23:08,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:23:08,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:23:08,979 INFO L87 Difference]: Start difference. First operand 74 states and 96 transitions. Second operand 6 states. [2018-12-09 00:23:09,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:23:09,009 INFO L93 Difference]: Finished difference Result 73 states and 94 transitions. [2018-12-09 00:23:09,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 00:23:09,009 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-12-09 00:23:09,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:23:09,009 INFO L225 Difference]: With dead ends: 73 [2018-12-09 00:23:09,009 INFO L226 Difference]: Without dead ends: 73 [2018-12-09 00:23:09,010 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-09 00:23:09,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-09 00:23:09,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 44. [2018-12-09 00:23:09,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-09 00:23:09,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2018-12-09 00:23:09,012 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 21 [2018-12-09 00:23:09,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:23:09,012 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2018-12-09 00:23:09,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:23:09,013 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2018-12-09 00:23:09,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 00:23:09,013 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:23:09,013 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-09 00:23:09,014 INFO L423 AbstractCegarLoop]: === Iteration 16 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 00:23:09,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:23:09,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1999236102, now seen corresponding path program 1 times [2018-12-09 00:23:09,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:23:09,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:23:09,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:23:09,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:23:09,015 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:23:09,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:23:09,059 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-09 00:23:09,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:23:09,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:23:09,059 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:23:09,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:23:09,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:23:09,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:23:09,068 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 4 states. [2018-12-09 00:23:09,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:23:09,113 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2018-12-09 00:23:09,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 00:23:09,113 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-12-09 00:23:09,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:23:09,113 INFO L225 Difference]: With dead ends: 43 [2018-12-09 00:23:09,113 INFO L226 Difference]: Without dead ends: 38 [2018-12-09 00:23:09,114 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-09 00:23:09,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-09 00:23:09,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-09 00:23:09,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-09 00:23:09,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2018-12-09 00:23:09,115 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 22 [2018-12-09 00:23:09,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:23:09,115 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2018-12-09 00:23:09,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:23:09,115 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-12-09 00:23:09,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 00:23:09,115 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:23:09,115 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-09 00:23:09,115 INFO L423 AbstractCegarLoop]: === Iteration 17 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 00:23:09,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:23:09,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1850925390, now seen corresponding path program 1 times [2018-12-09 00:23:09,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:23:09,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:23:09,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:23:09,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:23:09,116 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:23:09,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:23:09,183 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-09 00:23:09,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:23:09,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 00:23:09,183 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:23:09,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 00:23:09,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 00:23:09,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:23:09,184 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand 7 states. [2018-12-09 00:23:09,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:23:09,227 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2018-12-09 00:23:09,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:23:09,227 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-12-09 00:23:09,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:23:09,228 INFO L225 Difference]: With dead ends: 55 [2018-12-09 00:23:09,228 INFO L226 Difference]: Without dead ends: 55 [2018-12-09 00:23:09,228 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-09 00:23:09,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-09 00:23:09,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 46. [2018-12-09 00:23:09,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-09 00:23:09,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2018-12-09 00:23:09,230 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 22 [2018-12-09 00:23:09,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:23:09,230 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2018-12-09 00:23:09,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 00:23:09,230 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2018-12-09 00:23:09,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 00:23:09,230 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:23:09,231 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-09 00:23:09,231 INFO L423 AbstractCegarLoop]: === Iteration 18 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 00:23:09,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:23:09,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1164178228, now seen corresponding path program 1 times [2018-12-09 00:23:09,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:23:09,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:23:09,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:23:09,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:23:09,232 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:23:09,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:23:09,320 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-09 00:23:09,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:23:09,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 00:23:09,321 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:23:09,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 00:23:09,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 00:23:09,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:23:09,321 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 8 states. [2018-12-09 00:23:09,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:23:09,465 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2018-12-09 00:23:09,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 00:23:09,465 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-12-09 00:23:09,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:23:09,466 INFO L225 Difference]: With dead ends: 56 [2018-12-09 00:23:09,466 INFO L226 Difference]: Without dead ends: 56 [2018-12-09 00:23:09,466 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-09 00:23:09,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-09 00:23:09,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2018-12-09 00:23:09,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-09 00:23:09,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2018-12-09 00:23:09,467 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 22 [2018-12-09 00:23:09,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:23:09,467 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2018-12-09 00:23:09,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 00:23:09,468 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2018-12-09 00:23:09,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 00:23:09,468 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:23:09,468 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-09 00:23:09,468 INFO L423 AbstractCegarLoop]: === Iteration 19 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 00:23:09,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:23:09,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1164213049, now seen corresponding path program 1 times [2018-12-09 00:23:09,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:23:09,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:23:09,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:23:09,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:23:09,469 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:23:09,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:23:09,536 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-09 00:23:09,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:23:09,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 00:23:09,536 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:23:09,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 00:23:09,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 00:23:09,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-09 00:23:09,537 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand 9 states. [2018-12-09 00:23:09,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:23:09,611 INFO L93 Difference]: Finished difference Result 84 states and 98 transitions. [2018-12-09 00:23:09,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 00:23:09,611 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-12-09 00:23:09,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:23:09,612 INFO L225 Difference]: With dead ends: 84 [2018-12-09 00:23:09,612 INFO L226 Difference]: Without dead ends: 84 [2018-12-09 00:23:09,612 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-09 00:23:09,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-09 00:23:09,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 64. [2018-12-09 00:23:09,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-09 00:23:09,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2018-12-09 00:23:09,614 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 76 transitions. Word has length 22 [2018-12-09 00:23:09,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:23:09,615 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 76 transitions. [2018-12-09 00:23:09,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 00:23:09,615 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2018-12-09 00:23:09,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 00:23:09,615 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:23:09,615 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-09 00:23:09,616 INFO L423 AbstractCegarLoop]: === Iteration 20 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 00:23:09,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:23:09,616 INFO L82 PathProgramCache]: Analyzing trace with hash 143144695, now seen corresponding path program 1 times [2018-12-09 00:23:09,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:23:09,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:23:09,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:23:09,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:23:09,617 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:23:09,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:23:09,753 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-09 00:23:09,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:23:09,753 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 00:23:09,754 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2018-12-09 00:23:09,756 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-09 00:23:09,782 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 00:23:09,783 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 00:23:09,903 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 00:23:09,904 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-09 00:23:09,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:23:09,909 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 00:23:09,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:23:09,909 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3acdb36-c6c5-4410-be85-3018b2804636/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-09 00:23:09,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:23:09,916 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 00:23:09,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:23:09,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:23:09,962 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-09 00:23:09,975 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-09 00:23:09,976 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 00:23:09,981 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 00:23:09,990 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-09 00:23:09,991 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2018-12-09 00:23:10,001 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-09 00:23:10,002 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-09 00:23:10,003 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:23:10,004 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:23:10,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:23:10,005 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-12-09 00:23:10,052 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-09 00:23:10,057 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-09 00:23:10,057 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 00:23:10,061 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 00:23:10,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 00:23:10,067 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-12-09 00:23:10,100 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-09 00:23:10,100 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:23:10,268 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-09 00:23:10,275 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-09 00:23:10,276 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:23:10,277 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:23:10,284 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-09 00:23:10,284 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:35 [2018-12-09 00:23:10,315 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-09 00:23:10,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 00:23:10,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24 [2018-12-09 00:23:10,330 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 00:23:10,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-09 00:23:10,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-09 00:23:10,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2018-12-09 00:23:10,331 INFO L87 Difference]: Start difference. First operand 64 states and 76 transitions. Second operand 17 states. [2018-12-09 00:23:10,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:23:10,704 INFO L93 Difference]: Finished difference Result 76 states and 90 transitions. [2018-12-09 00:23:10,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 00:23:10,704 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 22 [2018-12-09 00:23:10,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:23:10,704 INFO L225 Difference]: With dead ends: 76 [2018-12-09 00:23:10,705 INFO L226 Difference]: Without dead ends: 76 [2018-12-09 00:23:10,705 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-09 00:23:10,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-09 00:23:10,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 65. [2018-12-09 00:23:10,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-09 00:23:10,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2018-12-09 00:23:10,707 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 22 [2018-12-09 00:23:10,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:23:10,708 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 77 transitions. [2018-12-09 00:23:10,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-09 00:23:10,708 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2018-12-09 00:23:10,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 00:23:10,708 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:23:10,708 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-09 00:23:10,709 INFO L423 AbstractCegarLoop]: === Iteration 21 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 00:23:10,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:23:10,709 INFO L82 PathProgramCache]: Analyzing trace with hash -342366095, now seen corresponding path program 1 times [2018-12-09 00:23:10,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:23:10,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:23:10,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:23:10,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:23:10,710 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:23:10,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:23:10,745 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-09 00:23:10,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:23:10,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:23:10,745 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:23:10,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:23:10,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:23:10,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:23:10,746 INFO L87 Difference]: Start difference. First operand 65 states and 77 transitions. Second operand 5 states. [2018-12-09 00:23:10,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:23:10,752 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2018-12-09 00:23:10,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 00:23:10,753 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-12-09 00:23:10,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:23:10,753 INFO L225 Difference]: With dead ends: 65 [2018-12-09 00:23:10,753 INFO L226 Difference]: Without dead ends: 65 [2018-12-09 00:23:10,754 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-09 00:23:10,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-09 00:23:10,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-12-09 00:23:10,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-09 00:23:10,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2018-12-09 00:23:10,756 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 23 [2018-12-09 00:23:10,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:23:10,756 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2018-12-09 00:23:10,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:23:10,756 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2018-12-09 00:23:10,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 00:23:10,757 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:23:10,757 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-09 00:23:10,757 INFO L423 AbstractCegarLoop]: === Iteration 22 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 00:23:10,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:23:10,757 INFO L82 PathProgramCache]: Analyzing trace with hash 142518206, now seen corresponding path program 1 times [2018-12-09 00:23:10,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:23:10,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:23:10,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:23:10,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:23:10,758 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:23:10,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:23:10,874 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-09 00:23:10,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:23:10,874 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 00:23:10,874 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-12-09 00:23:10,874 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-09 00:23:10,875 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 00:23:10,875 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 00:23:10,913 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 00:23:10,913 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-09 00:23:10,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:23:10,921 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 00:23:10,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:23:10,921 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3acdb36-c6c5-4410-be85-3018b2804636/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-09 00:23:10,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:23:10,927 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 00:23:10,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:23:10,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:23:10,949 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-09 00:23:10,951 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-09 00:23:10,951 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:23:10,958 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:23:10,963 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-09 00:23:10,963 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 00:23:10,970 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-09 00:23:10,971 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2018-12-09 00:23:11,050 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-09 00:23:11,050 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:23:11,185 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-09 00:23:11,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 00:23:11,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2018-12-09 00:23:11,199 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 00:23:11,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-09 00:23:11,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-09 00:23:11,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2018-12-09 00:23:11,200 INFO L87 Difference]: Start difference. First operand 65 states and 74 transitions. Second operand 17 states. [2018-12-09 00:23:11,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:23:11,466 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2018-12-09 00:23:11,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 00:23:11,467 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 23 [2018-12-09 00:23:11,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:23:11,467 INFO L225 Difference]: With dead ends: 71 [2018-12-09 00:23:11,467 INFO L226 Difference]: Without dead ends: 71 [2018-12-09 00:23:11,467 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-09 00:23:11,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-09 00:23:11,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 66. [2018-12-09 00:23:11,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-09 00:23:11,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 75 transitions. [2018-12-09 00:23:11,469 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 75 transitions. Word has length 23 [2018-12-09 00:23:11,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:23:11,469 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 75 transitions. [2018-12-09 00:23:11,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-09 00:23:11,469 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2018-12-09 00:23:11,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 00:23:11,469 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:23:11,469 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-09 00:23:11,469 INFO L423 AbstractCegarLoop]: === Iteration 23 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 00:23:11,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:23:11,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1870215061, now seen corresponding path program 1 times [2018-12-09 00:23:11,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:23:11,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:23:11,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:23:11,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:23:11,470 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:23:11,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:23:11,529 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-09 00:23:11,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:23:11,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 00:23:11,530 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:23:11,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 00:23:11,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 00:23:11,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-09 00:23:11,530 INFO L87 Difference]: Start difference. First operand 66 states and 75 transitions. Second operand 10 states. [2018-12-09 00:23:11,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:23:11,617 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2018-12-09 00:23:11,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 00:23:11,617 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-12-09 00:23:11,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:23:11,618 INFO L225 Difference]: With dead ends: 80 [2018-12-09 00:23:11,618 INFO L226 Difference]: Without dead ends: 66 [2018-12-09 00:23:11,618 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-09 00:23:11,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-09 00:23:11,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-12-09 00:23:11,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-09 00:23:11,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2018-12-09 00:23:11,620 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 24 [2018-12-09 00:23:11,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:23:11,620 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2018-12-09 00:23:11,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 00:23:11,620 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2018-12-09 00:23:11,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 00:23:11,621 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:23:11,621 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-09 00:23:11,621 INFO L423 AbstractCegarLoop]: === Iteration 24 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 00:23:11,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:23:11,621 INFO L82 PathProgramCache]: Analyzing trace with hash 2083779701, now seen corresponding path program 1 times [2018-12-09 00:23:11,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:23:11,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:23:11,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:23:11,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:23:11,622 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:23:11,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:23:11,738 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-09 00:23:11,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:23:11,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 00:23:11,739 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:23:11,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 00:23:11,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 00:23:11,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-09 00:23:11,739 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand 10 states. [2018-12-09 00:23:11,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:23:11,854 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2018-12-09 00:23:11,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 00:23:11,854 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-12-09 00:23:11,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:23:11,854 INFO L225 Difference]: With dead ends: 73 [2018-12-09 00:23:11,854 INFO L226 Difference]: Without dead ends: 58 [2018-12-09 00:23:11,854 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-09 00:23:11,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-09 00:23:11,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2018-12-09 00:23:11,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-09 00:23:11,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-12-09 00:23:11,856 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 24 [2018-12-09 00:23:11,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:23:11,856 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-12-09 00:23:11,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 00:23:11,856 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-12-09 00:23:11,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 00:23:11,857 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:23:11,857 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-09 00:23:11,857 INFO L423 AbstractCegarLoop]: === Iteration 25 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 00:23:11,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:23:11,857 INFO L82 PathProgramCache]: Analyzing trace with hash -123929645, now seen corresponding path program 1 times [2018-12-09 00:23:11,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:23:11,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:23:11,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:23:11,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:23:11,858 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:23:11,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:23:11,982 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-09 00:23:11,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:23:11,982 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 00:23:11,982 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-09 00:23:11,982 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-09 00:23:11,983 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 00:23:11,983 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 00:23:12,012 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 00:23:12,012 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-09 00:23:12,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:23:12,014 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 00:23:12,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:23:12,014 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3acdb36-c6c5-4410-be85-3018b2804636/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-09 00:23:12,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:23:12,025 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 00:23:12,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:23:12,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:23:12,048 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-09 00:23:12,051 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-09 00:23:12,051 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:23:12,058 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:23:12,064 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-09 00:23:12,064 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 00:23:12,068 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-09 00:23:12,068 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 [2018-12-09 00:23:12,081 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-09 00:23:12,083 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-09 00:23:12,083 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:23:12,084 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:23:12,087 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:23:12,087 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-12-09 00:23:12,131 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-09 00:23:12,132 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-09 00:23:12,132 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:23:12,136 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:23:12,139 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-09 00:23:12,139 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:23 [2018-12-09 00:23:12,179 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-09 00:23:12,181 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-09 00:23:12,181 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:23:12,188 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-09 00:23:12,189 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-09 00:23:12,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 00:23:12,196 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-09 00:23:12,196 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2018-12-09 00:23:12,225 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-09 00:23:12,226 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:23:12,399 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-09 00:23:12,406 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-09 00:23:12,406 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:23:12,407 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:23:12,413 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-09 00:23:12,413 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:35 [2018-12-09 00:23:12,447 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-09 00:23:12,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 00:23:12,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 26 [2018-12-09 00:23:12,462 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 00:23:12,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-09 00:23:12,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-09 00:23:12,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=629, Unknown=0, NotChecked=0, Total=702 [2018-12-09 00:23:12,463 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 19 states. [2018-12-09 00:23:13,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:23:13,054 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2018-12-09 00:23:13,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 00:23:13,055 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2018-12-09 00:23:13,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:23:13,055 INFO L225 Difference]: With dead ends: 58 [2018-12-09 00:23:13,055 INFO L226 Difference]: Without dead ends: 41 [2018-12-09 00:23:13,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=205, Invalid=1201, Unknown=0, NotChecked=0, Total=1406 [2018-12-09 00:23:13,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-09 00:23:13,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-09 00:23:13,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-09 00:23:13,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-12-09 00:23:13,056 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 24 [2018-12-09 00:23:13,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:23:13,056 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-12-09 00:23:13,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-09 00:23:13,056 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-12-09 00:23:13,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 00:23:13,057 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:23:13,057 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-09 00:23:13,057 INFO L423 AbstractCegarLoop]: === Iteration 26 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 00:23:13,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:23:13,057 INFO L82 PathProgramCache]: Analyzing trace with hash -2001948722, now seen corresponding path program 1 times [2018-12-09 00:23:13,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:23:13,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:23:13,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:23:13,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:23:13,057 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:23:13,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:23:13,144 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-09 00:23:13,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:23:13,144 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 00:23:13,145 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-12-09 00:23:13,145 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-09 00:23:13,146 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 00:23:13,146 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 00:23:13,182 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 00:23:13,182 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-09 00:23:13,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:23:13,184 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 00:23:13,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:23:13,184 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3acdb36-c6c5-4410-be85-3018b2804636/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-09 00:23:13,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:23:13,190 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 00:23:13,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:23:13,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:23:13,206 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-09 00:23:13,213 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-09 00:23:13,213 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 00:23:13,219 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 00:23:13,230 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-09 00:23:13,230 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2018-12-09 00:23:13,241 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-09 00:23:13,242 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-09 00:23:13,243 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:23:13,244 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:23:13,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:23:13,245 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-12-09 00:23:13,291 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-09 00:23:13,297 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-09 00:23:13,297 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 00:23:13,299 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 00:23:13,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 00:23:13,303 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-12-09 00:23:13,331 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-09 00:23:13,331 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:23:13,465 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-09 00:23:13,472 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-09 00:23:13,473 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:23:13,474 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:23:13,478 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-09 00:23:13,478 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:35 [2018-12-09 00:23:13,507 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-09 00:23:13,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 00:23:13,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24 [2018-12-09 00:23:13,522 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 00:23:13,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-09 00:23:13,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-09 00:23:13,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2018-12-09 00:23:13,522 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 17 states. [2018-12-09 00:23:13,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:23:13,790 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-12-09 00:23:13,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 00:23:13,791 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 26 [2018-12-09 00:23:13,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:23:13,791 INFO L225 Difference]: With dead ends: 44 [2018-12-09 00:23:13,791 INFO L226 Difference]: Without dead ends: 44 [2018-12-09 00:23:13,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=861, Unknown=0, NotChecked=0, Total=992 [2018-12-09 00:23:13,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-09 00:23:13,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2018-12-09 00:23:13,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-09 00:23:13,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-12-09 00:23:13,792 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 26 [2018-12-09 00:23:13,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:23:13,792 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2018-12-09 00:23:13,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-09 00:23:13,793 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-12-09 00:23:13,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 00:23:13,793 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:23:13,793 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-09 00:23:13,793 INFO L423 AbstractCegarLoop]: === Iteration 27 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 00:23:13,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:23:13,793 INFO L82 PathProgramCache]: Analyzing trace with hash -717821366, now seen corresponding path program 1 times [2018-12-09 00:23:13,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:23:13,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:23:13,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:23:13,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:23:13,794 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:23:13,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:23:13,870 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-09 00:23:13,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:23:13,870 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 00:23:13,870 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-12-09 00:23:13,870 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-09 00:23:13,871 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 00:23:13,871 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 00:23:13,888 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 00:23:13,888 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-09 00:23:13,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:23:13,889 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 00:23:13,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:23:13,890 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3acdb36-c6c5-4410-be85-3018b2804636/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-09 00:23:13,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:23:13,895 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 00:23:13,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:23:13,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:23:13,926 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-09 00:23:13,927 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:23:13,948 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-09 00:23:13,962 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 00:23:13,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [10] total 14 [2018-12-09 00:23:13,962 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:23:13,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:23:13,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:23:13,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-12-09 00:23:13,963 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 4 states. [2018-12-09 00:23:13,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:23:13,972 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-12-09 00:23:13,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 00:23:13,972 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-12-09 00:23:13,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:23:13,972 INFO L225 Difference]: With dead ends: 44 [2018-12-09 00:23:13,972 INFO L226 Difference]: Without dead ends: 43 [2018-12-09 00:23:13,972 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-09 00:23:13,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-09 00:23:13,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-09 00:23:13,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-09 00:23:13,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2018-12-09 00:23:13,973 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 27 [2018-12-09 00:23:13,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:23:13,973 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2018-12-09 00:23:13,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:23:13,974 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2018-12-09 00:23:13,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 00:23:13,974 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:23:13,974 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-09 00:23:13,974 INFO L423 AbstractCegarLoop]: === Iteration 28 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 00:23:13,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:23:13,974 INFO L82 PathProgramCache]: Analyzing trace with hash -717786545, now seen corresponding path program 2 times [2018-12-09 00:23:13,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:23:13,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:23:13,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:23:13,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:23:13,975 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:23:13,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:23:14,176 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-09 00:23:14,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:23:14,176 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 00:23:14,176 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 00:23:14,176 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 00:23:14,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:23:14,176 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3acdb36-c6c5-4410-be85-3018b2804636/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-09 00:23:14,183 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 00:23:14,184 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 00:23:14,202 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-09 00:23:14,202 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 00:23:14,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:23:14,212 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-09 00:23:14,212 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 00:23:14,216 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-09 00:23:14,218 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-09 00:23:14,218 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 00:23:14,221 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:23:14,225 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-09 00:23:14,225 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 [2018-12-09 00:23:14,247 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-09 00:23:14,248 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-09 00:23:14,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:23:14,250 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:23:14,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:23:14,252 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-12-09 00:23:14,310 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-09 00:23:14,311 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-09 00:23:14,311 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:23:14,315 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:23:14,318 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-09 00:23:14,318 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2018-12-09 00:23:14,350 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-09 00:23:14,355 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-09 00:23:14,355 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 00:23:14,357 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 00:23:14,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 00:23:14,361 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-12-09 00:23:14,416 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-09 00:23:14,416 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:23:14,929 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-09 00:23:14,959 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-09 00:23:14,959 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:23:14,986 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-09 00:23:14,989 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-09 00:23:14,990 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 00:23:14,995 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:23:14,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-09 00:23:15,001 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-09 00:23:15,002 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 00:23:15,005 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:23:15,025 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-09 00:23:15,054 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-09 00:23:15,054 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:55, output treesize:84 [2018-12-09 00:23:15,127 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-09 00:23:15,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 00:23:15,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 32 [2018-12-09 00:23:15,142 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 00:23:15,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-09 00:23:15,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-09 00:23:15,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=956, Unknown=0, NotChecked=0, Total=1056 [2018-12-09 00:23:15,143 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 23 states. [2018-12-09 00:23:15,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:23:15,791 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-12-09 00:23:15,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 00:23:15,791 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 27 [2018-12-09 00:23:15,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:23:15,791 INFO L225 Difference]: With dead ends: 44 [2018-12-09 00:23:15,791 INFO L226 Difference]: Without dead ends: 44 [2018-12-09 00:23:15,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=265, Invalid=1715, Unknown=0, NotChecked=0, Total=1980 [2018-12-09 00:23:15,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-09 00:23:15,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2018-12-09 00:23:15,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-09 00:23:15,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2018-12-09 00:23:15,792 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 27 [2018-12-09 00:23:15,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:23:15,793 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2018-12-09 00:23:15,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-09 00:23:15,793 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-12-09 00:23:15,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 00:23:15,793 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:23:15,793 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-09 00:23:15,793 INFO L423 AbstractCegarLoop]: === Iteration 29 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 00:23:15,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:23:15,793 INFO L82 PathProgramCache]: Analyzing trace with hash -776546458, now seen corresponding path program 2 times [2018-12-09 00:23:15,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:23:15,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:23:15,794 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:23:15,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:23:15,794 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:23:15,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:23:15,896 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-09 00:23:15,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:23:15,896 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 00:23:15,896 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 00:23:15,896 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 00:23:15,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:23:15,896 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3acdb36-c6c5-4410-be85-3018b2804636/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-09 00:23:15,904 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 00:23:15,904 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 00:23:15,926 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-09 00:23:15,926 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 00:23:15,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:23:15,937 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-09 00:23:15,939 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-09 00:23:15,940 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:23:15,943 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:23:15,948 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-09 00:23:15,949 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 00:23:15,953 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-09 00:23:15,953 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2018-12-09 00:23:16,067 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-09 00:23:16,068 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:23:16,257 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-09 00:23:16,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 00:23:16,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 25 [2018-12-09 00:23:16,272 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 00:23:16,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-09 00:23:16,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-09 00:23:16,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2018-12-09 00:23:16,272 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 17 states. [2018-12-09 00:23:16,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:23:16,636 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2018-12-09 00:23:16,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 00:23:16,637 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 28 [2018-12-09 00:23:16,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:23:16,637 INFO L225 Difference]: With dead ends: 55 [2018-12-09 00:23:16,637 INFO L226 Difference]: Without dead ends: 55 [2018-12-09 00:23:16,638 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-09 00:23:16,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-09 00:23:16,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2018-12-09 00:23:16,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-09 00:23:16,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-12-09 00:23:16,641 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 28 [2018-12-09 00:23:16,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:23:16,642 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-12-09 00:23:16,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-09 00:23:16,642 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-12-09 00:23:16,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-09 00:23:16,642 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:23:16,643 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-09 00:23:16,643 INFO L423 AbstractCegarLoop]: === Iteration 30 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 00:23:16,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:23:16,643 INFO L82 PathProgramCache]: Analyzing trace with hash -138511059, now seen corresponding path program 1 times [2018-12-09 00:23:16,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:23:16,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:23:16,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:23:16,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:23:16,644 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:23:16,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:23:16,895 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-09 00:23:16,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:23:16,895 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 00:23:16,895 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-12-09 00:23:16,896 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-09 00:23:16,897 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 00:23:16,897 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 00:23:16,927 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 00:23:16,927 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-09 00:23:16,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:23:16,929 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 00:23:16,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:23:16,929 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3acdb36-c6c5-4410-be85-3018b2804636/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-09 00:23:16,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:23:16,938 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 00:23:16,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:23:16,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:23:16,970 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-09 00:23:16,972 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-09 00:23:16,972 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:23:16,977 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:23:16,983 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-09 00:23:16,983 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 00:23:16,987 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-09 00:23:16,988 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 [2018-12-09 00:23:17,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-09 00:23:17,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-09 00:23:17,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:23:17,013 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:23:17,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:23:17,015 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-12-09 00:23:17,114 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-09 00:23:17,115 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-09 00:23:17,115 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:23:17,118 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:23:17,122 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-09 00:23:17,122 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2018-12-09 00:23:17,143 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-09 00:23:17,144 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-09 00:23:17,144 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:23:17,150 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:23:17,154 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-09 00:23:17,155 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-12-09 00:23:17,202 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-09 00:23:17,207 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-09 00:23:17,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 00:23:17,212 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-09 00:23:17,212 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 00:23:17,215 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 00:23:17,220 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-09 00:23:17,220 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2018-12-09 00:23:17,255 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-09 00:23:17,255 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:23:17,644 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-09 00:23:17,654 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-09 00:23:17,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:23:17,664 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-09 00:23:17,666 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-09 00:23:17,666 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 00:23:17,668 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:23:17,669 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-09 00:23:17,670 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-09 00:23:17,671 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 00:23:17,672 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:23:17,679 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-09 00:23:17,694 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-09 00:23:17,694 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:55, output treesize:84 [2018-12-09 00:23:17,738 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-09 00:23:17,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 00:23:17,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 34 [2018-12-09 00:23:17,753 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 00:23:17,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-09 00:23:17,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-09 00:23:17,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1079, Unknown=0, NotChecked=0, Total=1190 [2018-12-09 00:23:17,754 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 24 states. [2018-12-09 00:23:18,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:23:18,626 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2018-12-09 00:23:18,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-09 00:23:18,627 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 29 [2018-12-09 00:23:18,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:23:18,627 INFO L225 Difference]: With dead ends: 54 [2018-12-09 00:23:18,627 INFO L226 Difference]: Without dead ends: 44 [2018-12-09 00:23:18,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=328, Invalid=2324, Unknown=0, NotChecked=0, Total=2652 [2018-12-09 00:23:18,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-09 00:23:18,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-09 00:23:18,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-09 00:23:18,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2018-12-09 00:23:18,629 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 29 [2018-12-09 00:23:18,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:23:18,629 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2018-12-09 00:23:18,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-09 00:23:18,629 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-12-09 00:23:18,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-09 00:23:18,629 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:23:18,630 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-09 00:23:18,630 INFO L423 AbstractCegarLoop]: === Iteration 31 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 00:23:18,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:23:18,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1440841946, now seen corresponding path program 2 times [2018-12-09 00:23:18,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:23:18,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:23:18,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:23:18,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:23:18,631 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:23:18,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:23:18,851 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-09 00:23:18,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:23:18,851 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 00:23:18,851 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 00:23:18,851 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 00:23:18,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:23:18,851 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3acdb36-c6c5-4410-be85-3018b2804636/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-09 00:23:18,858 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 00:23:18,858 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 00:23:18,878 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-09 00:23:18,878 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 00:23:18,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:23:18,890 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-09 00:23:18,893 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-09 00:23:18,893 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:23:18,896 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:23:18,905 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-09 00:23:18,905 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 00:23:18,908 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-09 00:23:18,909 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 [2018-12-09 00:23:18,923 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-09 00:23:18,924 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-09 00:23:18,924 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:23:18,925 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:23:18,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:23:18,928 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-12-09 00:23:18,998 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-09 00:23:18,999 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-09 00:23:18,999 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:23:19,003 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:23:19,007 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-09 00:23:19,008 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-12-09 00:23:19,031 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-09 00:23:19,037 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-09 00:23:19,038 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 00:23:19,040 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 00:23:19,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 00:23:19,046 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-12-09 00:23:19,100 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-09 00:23:19,100 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:23:19,360 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-09 00:23:19,372 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-09 00:23:19,372 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:23:19,382 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-09 00:23:19,384 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-09 00:23:19,384 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 00:23:19,387 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:23:19,388 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-09 00:23:19,390 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-09 00:23:19,390 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 00:23:19,392 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:23:19,405 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-09 00:23:19,423 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-09 00:23:19,423 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:55, output treesize:84 [2018-12-09 00:23:19,467 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-09 00:23:19,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 00:23:19,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 11] total 31 [2018-12-09 00:23:19,481 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 00:23:19,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-09 00:23:19,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-09 00:23:19,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=896, Unknown=0, NotChecked=0, Total=992 [2018-12-09 00:23:19,482 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 22 states. [2018-12-09 00:23:20,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:23:20,791 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-12-09 00:23:20,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-09 00:23:20,791 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 31 [2018-12-09 00:23:20,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:23:20,791 INFO L225 Difference]: With dead ends: 45 [2018-12-09 00:23:20,792 INFO L226 Difference]: Without dead ends: 38 [2018-12-09 00:23:20,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=274, Invalid=1888, Unknown=0, NotChecked=0, Total=2162 [2018-12-09 00:23:20,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-09 00:23:20,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-09 00:23:20,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-09 00:23:20,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-12-09 00:23:20,793 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 31 [2018-12-09 00:23:20,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:23:20,793 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-12-09 00:23:20,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-09 00:23:20,793 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-12-09 00:23:20,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-09 00:23:20,793 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:23:20,793 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-09 00:23:20,793 INFO L423 AbstractCegarLoop]: === Iteration 32 === [cstrlcpyErr3REQUIRES_VIOLATION, cstrlcpyErr2REQUIRES_VIOLATION, cstrlcpyErr4REQUIRES_VIOLATION, cstrlcpyErr0REQUIRES_VIOLATION, cstrlcpyErr5REQUIRES_VIOLATION, cstrlcpyErr7REQUIRES_VIOLATION, cstrlcpyErr1REQUIRES_VIOLATION, cstrlcpyErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 00:23:20,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:23:20,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1576153278, now seen corresponding path program 3 times [2018-12-09 00:23:20,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:23:20,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:23:20,794 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:23:20,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:23:20,794 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:23:20,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:23:20,922 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-09 00:23:20,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:23:20,923 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 00:23:20,923 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 00:23:20,923 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 00:23:20,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:23:20,923 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3acdb36-c6c5-4410-be85-3018b2804636/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-09 00:23:20,933 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 00:23:20,933 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-09 00:23:20,957 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 00:23:20,957 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 00:23:20,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:23:20,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 00:23:20,967 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 00:23:20,972 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-09 00:23:20,974 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-09 00:23:20,974 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 00:23:20,977 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:23:20,981 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-09 00:23:20,981 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2018-12-09 00:23:21,100 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-09 00:23:21,100 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:23:21,327 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-09 00:23:21,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 00:23:21,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 30 [2018-12-09 00:23:21,342 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 00:23:21,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-09 00:23:21,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-09 00:23:21,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=837, Unknown=0, NotChecked=0, Total=930 [2018-12-09 00:23:21,343 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 20 states. [2018-12-09 00:23:22,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:23:22,018 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-12-09 00:23:22,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-09 00:23:22,019 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 33 [2018-12-09 00:23:22,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:23:22,019 INFO L225 Difference]: With dead ends: 45 [2018-12-09 00:23:22,019 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 00:23:22,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=342, Invalid=2010, Unknown=0, NotChecked=0, Total=2352 [2018-12-09 00:23:22,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 00:23:22,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 00:23:22,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 00:23:22,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 00:23:22,020 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2018-12-09 00:23:22,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:23:22,020 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 00:23:22,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-09 00:23:22,020 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 00:23:22,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 00:23:22,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 12:23:22 BoogieIcfgContainer [2018-12-09 00:23:22,024 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 00:23:22,025 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 00:23:22,025 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 00:23:22,025 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 00:23:22,025 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:23:07" (3/4) ... [2018-12-09 00:23:22,028 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 00:23:22,031 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrlcpy [2018-12-09 00:23:22,031 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 00:23:22,032 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 00:23:22,034 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2018-12-09 00:23:22,034 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-09 00:23:22,034 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-09 00:23:22,057 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f3acdb36-c6c5-4410-be85-3018b2804636/bin-2019/utaipan/witness.graphml [2018-12-09 00:23:22,057 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 00:23:22,058 INFO L168 Benchmark]: Toolchain (without parser) took 15001.05 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 422.6 MB). Free memory was 953.5 MB in the beginning and 885.2 MB in the end (delta: 68.3 MB). Peak memory consumption was 490.8 MB. Max. memory is 11.5 GB. [2018-12-09 00:23:22,059 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-09 00:23:22,059 INFO L168 Benchmark]: CACSL2BoogieTranslator took 268.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -179.2 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-12-09 00:23:22,059 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.75 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:23:22,059 INFO L168 Benchmark]: Boogie Preprocessor took 17.71 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:23:22,060 INFO L168 Benchmark]: RCFGBuilder took 188.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. [2018-12-09 00:23:22,060 INFO L168 Benchmark]: TraceAbstraction took 14473.31 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 274.7 MB). Free memory was 1.1 GB in the beginning and 885.2 MB in the end (delta: 223.0 MB). Peak memory consumption was 497.8 MB. Max. memory is 11.5 GB. [2018-12-09 00:23:22,060 INFO L168 Benchmark]: Witness Printer took 32.84 ms. Allocated memory is still 1.5 GB. Free memory is still 885.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:23:22,061 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 268.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -179.2 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.75 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.71 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 188.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14473.31 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 274.7 MB). Free memory was 1.1 GB in the beginning and 885.2 MB in the end (delta: 223.0 MB). Peak memory consumption was 497.8 MB. Max. memory is 11.5 GB. * Witness Printer took 32.84 ms. Allocated memory is still 1.5 GB. Free memory is still 885.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: 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: 554]: 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: 555]: 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 - 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 - 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, 14.4s OverallTime, 32 OverallIterations, 4 TraceHistogramMax, 6.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 935 SDtfs, 1219 SDslu, 3637 SDs, 0 SdLazy, 3471 SolverSat, 295 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 905 GetRequests, 409 SyntacticMatches, 11 SemanticMatches, 485 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2416 ImplicationChecksByTransitivity, 9.4s 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.6s 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...