./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstrcpy-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_6c8688e2-3e13-40b5-9c36-fb57cd9b37d0/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6c8688e2-3e13-40b5-9c36-fb57cd9b37d0/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6c8688e2-3e13-40b5-9c36-fb57cd9b37d0/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6c8688e2-3e13-40b5-9c36-fb57cd9b37d0/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_6c8688e2-3e13-40b5-9c36-fb57cd9b37d0/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6c8688e2-3e13-40b5-9c36-fb57cd9b37d0/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 834e1cdb1aa87972c4591e301e8fffc5992d43b8 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 02:54:45,736 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 02:54:45,737 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 02:54:45,744 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 02:54:45,745 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 02:54:45,745 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 02:54:45,746 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 02:54:45,747 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 02:54:45,748 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 02:54:45,749 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 02:54:45,750 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 02:54:45,750 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 02:54:45,750 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 02:54:45,751 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 02:54:45,752 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 02:54:45,752 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 02:54:45,753 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 02:54:45,754 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 02:54:45,756 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 02:54:45,757 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 02:54:45,757 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 02:54:45,758 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 02:54:45,760 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 02:54:45,760 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 02:54:45,760 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 02:54:45,761 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 02:54:45,761 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 02:54:45,762 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 02:54:45,762 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 02:54:45,763 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 02:54:45,763 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 02:54:45,764 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 02:54:45,764 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 02:54:45,764 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 02:54:45,765 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 02:54:45,765 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 02:54:45,765 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6c8688e2-3e13-40b5-9c36-fb57cd9b37d0/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-02 02:54:45,776 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 02:54:45,776 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 02:54:45,777 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 02:54:45,777 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 02:54:45,777 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 02:54:45,777 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 02:54:45,777 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 02:54:45,777 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 02:54:45,777 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 02:54:45,778 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 02:54:45,778 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 02:54:45,778 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 02:54:45,778 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 02:54:45,778 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 02:54:45,778 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 02:54:45,779 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 02:54:45,779 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 02:54:45,779 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 02:54:45,779 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 02:54:45,779 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 02:54:45,779 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 02:54:45,779 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-02 02:54:45,779 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-02 02:54:45,780 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-02 02:54:45,780 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 02:54:45,780 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 02:54:45,780 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 02:54:45,780 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 02:54:45,780 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 02:54:45,780 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 02:54:45,780 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 02:54:45,780 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 02:54:45,780 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 02:54:45,780 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 02:54:45,781 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 02:54:45,781 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 02:54:45,781 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_6c8688e2-3e13-40b5-9c36-fb57cd9b37d0/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 -> 834e1cdb1aa87972c4591e301e8fffc5992d43b8 [2018-12-02 02:54:45,803 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 02:54:45,812 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 02:54:45,814 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 02:54:45,815 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 02:54:45,816 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 02:54:45,816 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6c8688e2-3e13-40b5-9c36-fb57cd9b37d0/bin-2019/utaipan/../../sv-benchmarks/c/array-memsafety/openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-12-02 02:54:45,861 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6c8688e2-3e13-40b5-9c36-fb57cd9b37d0/bin-2019/utaipan/data/2e7ae0d1f/ce5f84e5492242a48a2e7bdf70aec791/FLAG0e3191a63 [2018-12-02 02:54:46,263 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 02:54:46,263 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6c8688e2-3e13-40b5-9c36-fb57cd9b37d0/sv-benchmarks/c/array-memsafety/openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-12-02 02:54:46,269 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6c8688e2-3e13-40b5-9c36-fb57cd9b37d0/bin-2019/utaipan/data/2e7ae0d1f/ce5f84e5492242a48a2e7bdf70aec791/FLAG0e3191a63 [2018-12-02 02:54:46,277 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6c8688e2-3e13-40b5-9c36-fb57cd9b37d0/bin-2019/utaipan/data/2e7ae0d1f/ce5f84e5492242a48a2e7bdf70aec791 [2018-12-02 02:54:46,279 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 02:54:46,280 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 02:54:46,280 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 02:54:46,281 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 02:54:46,283 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 02:54:46,283 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:54:46" (1/1) ... [2018-12-02 02:54:46,285 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7300e139 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:54:46, skipping insertion in model container [2018-12-02 02:54:46,285 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:54:46" (1/1) ... [2018-12-02 02:54:46,289 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 02:54:46,312 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 02:54:46,451 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 02:54:46,495 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 02:54:46,519 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 02:54:46,538 INFO L195 MainTranslator]: Completed translation [2018-12-02 02:54:46,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:54:46 WrapperNode [2018-12-02 02:54:46,539 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 02:54:46,539 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 02:54:46,539 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 02:54:46,539 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 02:54:46,544 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:54:46" (1/1) ... [2018-12-02 02:54:46,551 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:54:46" (1/1) ... [2018-12-02 02:54:46,556 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 02:54:46,556 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 02:54:46,556 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 02:54:46,556 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 02:54:46,562 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:54:46" (1/1) ... [2018-12-02 02:54:46,562 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:54:46" (1/1) ... [2018-12-02 02:54:46,563 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:54:46" (1/1) ... [2018-12-02 02:54:46,563 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:54:46" (1/1) ... [2018-12-02 02:54:46,567 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:54:46" (1/1) ... [2018-12-02 02:54:46,570 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:54:46" (1/1) ... [2018-12-02 02:54:46,571 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:54:46" (1/1) ... [2018-12-02 02:54:46,572 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 02:54:46,572 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 02:54:46,572 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 02:54:46,572 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 02:54:46,573 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:54:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c8688e2-3e13-40b5-9c36-fb57cd9b37d0/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 02:54:46,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 02:54:46,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 02:54:46,604 INFO L130 BoogieDeclarations]: Found specification of procedure cstrcpy [2018-12-02 02:54:46,604 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrcpy [2018-12-02 02:54:46,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 02:54:46,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 02:54:46,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 02:54:46,604 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 02:54:46,604 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 02:54:46,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 02:54:46,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 02:54:46,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 02:54:46,737 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 02:54:46,737 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-02 02:54:46,738 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:54:46 BoogieIcfgContainer [2018-12-02 02:54:46,738 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 02:54:46,738 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 02:54:46,738 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 02:54:46,740 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 02:54:46,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:54:46" (1/3) ... [2018-12-02 02:54:46,741 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79634eb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:54:46, skipping insertion in model container [2018-12-02 02:54:46,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:54:46" (2/3) ... [2018-12-02 02:54:46,741 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79634eb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:54:46, skipping insertion in model container [2018-12-02 02:54:46,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:54:46" (3/3) ... [2018-12-02 02:54:46,742 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-12-02 02:54:46,748 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 02:54:46,752 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-12-02 02:54:46,760 INFO L257 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2018-12-02 02:54:46,776 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 02:54:46,776 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-02 02:54:46,776 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 02:54:46,776 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 02:54:46,776 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 02:54:46,776 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 02:54:46,776 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 02:54:46,776 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 02:54:46,786 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-12-02 02:54:46,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 02:54:46,791 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:54:46,791 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:54:46,793 INFO L423 AbstractCegarLoop]: === Iteration 1 === [cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 02:54:46,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:54:46,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1835221779, now seen corresponding path program 1 times [2018-12-02 02:54:46,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:54:46,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:54:46,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:54:46,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:54:46,825 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:54:46,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:54:46,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-02 02:54:46,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:54:46,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 02:54:46,890 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:54:46,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 02:54:46,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 02:54:46,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 02:54:46,902 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 4 states. [2018-12-02 02:54:46,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:54:46,942 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-12-02 02:54:46,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 02:54:46,944 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-02 02:54:46,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:54:46,949 INFO L225 Difference]: With dead ends: 35 [2018-12-02 02:54:46,949 INFO L226 Difference]: Without dead ends: 31 [2018-12-02 02:54:46,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 02:54:46,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-02 02:54:46,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-12-02 02:54:46,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-02 02:54:46,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-12-02 02:54:46,971 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 10 [2018-12-02 02:54:46,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:54:46,971 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-12-02 02:54:46,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 02:54:46,971 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-12-02 02:54:46,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 02:54:46,971 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:54:46,971 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:54:46,971 INFO L423 AbstractCegarLoop]: === Iteration 2 === [cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 02:54:46,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:54:46,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1835221805, now seen corresponding path program 1 times [2018-12-02 02:54:46,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:54:46,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:54:46,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:54:46,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:54:46,973 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:54:46,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:54:46,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:54:46,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:54:46,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 02:54:46,996 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:54:46,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 02:54:46,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:54:46,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:54:46,997 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 3 states. [2018-12-02 02:54:47,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:54:47,011 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-12-02 02:54:47,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:54:47,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-02 02:54:47,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:54:47,012 INFO L225 Difference]: With dead ends: 28 [2018-12-02 02:54:47,012 INFO L226 Difference]: Without dead ends: 28 [2018-12-02 02:54:47,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:54:47,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-02 02:54:47,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-02 02:54:47,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-02 02:54:47,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-12-02 02:54:47,014 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 10 [2018-12-02 02:54:47,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:54:47,015 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-12-02 02:54:47,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 02:54:47,015 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-12-02 02:54:47,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 02:54:47,015 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:54:47,015 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:54:47,015 INFO L423 AbstractCegarLoop]: === Iteration 3 === [cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 02:54:47,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:54:47,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1835221806, now seen corresponding path program 1 times [2018-12-02 02:54:47,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:54:47,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:54:47,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:54:47,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:54:47,016 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:54:47,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:54:47,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:54:47,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:54:47,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 02:54:47,042 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:54:47,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 02:54:47,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 02:54:47,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 02:54:47,043 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 4 states. [2018-12-02 02:54:47,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:54:47,054 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-12-02 02:54:47,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 02:54:47,054 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-02 02:54:47,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:54:47,055 INFO L225 Difference]: With dead ends: 29 [2018-12-02 02:54:47,055 INFO L226 Difference]: Without dead ends: 29 [2018-12-02 02:54:47,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 02:54:47,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-02 02:54:47,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-12-02 02:54:47,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-02 02:54:47,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2018-12-02 02:54:47,057 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 10 [2018-12-02 02:54:47,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:54:47,057 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-12-02 02:54:47,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 02:54:47,057 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-12-02 02:54:47,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 02:54:47,058 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:54:47,058 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:54:47,058 INFO L423 AbstractCegarLoop]: === Iteration 4 === [cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 02:54:47,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:54:47,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1835223701, now seen corresponding path program 1 times [2018-12-02 02:54:47,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:54:47,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:54:47,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:54:47,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:54:47,059 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:54:47,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:54:47,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:54:47,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:54:47,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 02:54:47,071 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:54:47,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 02:54:47,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:54:47,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:54:47,072 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 3 states. [2018-12-02 02:54:47,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:54:47,088 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2018-12-02 02:54:47,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:54:47,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-02 02:54:47,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:54:47,089 INFO L225 Difference]: With dead ends: 28 [2018-12-02 02:54:47,089 INFO L226 Difference]: Without dead ends: 27 [2018-12-02 02:54:47,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:54:47,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-02 02:54:47,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-12-02 02:54:47,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-02 02:54:47,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-12-02 02:54:47,092 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 10 [2018-12-02 02:54:47,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:54:47,092 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-12-02 02:54:47,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 02:54:47,092 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-12-02 02:54:47,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-02 02:54:47,093 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:54:47,093 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:54:47,093 INFO L423 AbstractCegarLoop]: === Iteration 5 === [cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 02:54:47,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:54:47,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1840862256, now seen corresponding path program 1 times [2018-12-02 02:54:47,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:54:47,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:54:47,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:54:47,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:54:47,094 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:54:47,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:54:47,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:54:47,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:54:47,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 02:54:47,127 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:54:47,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 02:54:47,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 02:54:47,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 02:54:47,127 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 5 states. [2018-12-02 02:54:47,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:54:47,156 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-12-02 02:54:47,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 02:54:47,156 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-12-02 02:54:47,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:54:47,156 INFO L225 Difference]: With dead ends: 25 [2018-12-02 02:54:47,157 INFO L226 Difference]: Without dead ends: 25 [2018-12-02 02:54:47,157 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-02 02:54:47,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-02 02:54:47,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-02 02:54:47,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-02 02:54:47,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-12-02 02:54:47,159 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 13 [2018-12-02 02:54:47,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:54:47,159 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-12-02 02:54:47,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 02:54:47,159 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-12-02 02:54:47,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-02 02:54:47,159 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:54:47,159 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:54:47,160 INFO L423 AbstractCegarLoop]: === Iteration 6 === [cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 02:54:47,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:54:47,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1840862255, now seen corresponding path program 1 times [2018-12-02 02:54:47,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:54:47,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:54:47,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:54:47,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:54:47,161 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:54:47,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:54:47,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:54:47,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:54:47,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 02:54:47,214 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:54:47,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 02:54:47,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 02:54:47,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 02:54:47,215 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 7 states. [2018-12-02 02:54:47,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:54:47,251 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-12-02 02:54:47,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 02:54:47,251 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-12-02 02:54:47,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:54:47,253 INFO L225 Difference]: With dead ends: 34 [2018-12-02 02:54:47,253 INFO L226 Difference]: Without dead ends: 34 [2018-12-02 02:54:47,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-02 02:54:47,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-02 02:54:47,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 26. [2018-12-02 02:54:47,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-02 02:54:47,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-12-02 02:54:47,256 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 13 [2018-12-02 02:54:47,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:54:47,256 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-12-02 02:54:47,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 02:54:47,256 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-12-02 02:54:47,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-02 02:54:47,256 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:54:47,256 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:54:47,256 INFO L423 AbstractCegarLoop]: === Iteration 7 === [cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 02:54:47,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:54:47,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1232155111, now seen corresponding path program 1 times [2018-12-02 02:54:47,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:54:47,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:54:47,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:54:47,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:54:47,257 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:54:47,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:54:47,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:54:47,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:54:47,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 02:54:47,295 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:54:47,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 02:54:47,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 02:54:47,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 02:54:47,295 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 6 states. [2018-12-02 02:54:47,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:54:47,321 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-12-02 02:54:47,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 02:54:47,321 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-12-02 02:54:47,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:54:47,321 INFO L225 Difference]: With dead ends: 25 [2018-12-02 02:54:47,321 INFO L226 Difference]: Without dead ends: 25 [2018-12-02 02:54:47,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-02 02:54:47,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-02 02:54:47,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-02 02:54:47,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-02 02:54:47,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-12-02 02:54:47,323 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 14 [2018-12-02 02:54:47,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:54:47,323 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-12-02 02:54:47,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 02:54:47,323 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-12-02 02:54:47,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-02 02:54:47,324 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:54:47,324 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:54:47,324 INFO L423 AbstractCegarLoop]: === Iteration 8 === [cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 02:54:47,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:54:47,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1232155110, now seen corresponding path program 1 times [2018-12-02 02:54:47,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:54:47,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:54:47,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:54:47,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:54:47,325 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:54:47,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:54:47,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:54:47,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:54:47,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 02:54:47,361 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:54:47,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 02:54:47,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 02:54:47,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 02:54:47,362 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 6 states. [2018-12-02 02:54:47,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:54:47,412 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-12-02 02:54:47,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 02:54:47,412 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-12-02 02:54:47,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:54:47,413 INFO L225 Difference]: With dead ends: 31 [2018-12-02 02:54:47,413 INFO L226 Difference]: Without dead ends: 31 [2018-12-02 02:54:47,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-02 02:54:47,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-02 02:54:47,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2018-12-02 02:54:47,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-02 02:54:47,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-12-02 02:54:47,415 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 14 [2018-12-02 02:54:47,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:54:47,415 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-12-02 02:54:47,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 02:54:47,415 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-12-02 02:54:47,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-02 02:54:47,416 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:54:47,416 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:54:47,416 INFO L423 AbstractCegarLoop]: === Iteration 9 === [cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 02:54:47,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:54:47,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1952551276, now seen corresponding path program 1 times [2018-12-02 02:54:47,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:54:47,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:54:47,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:54:47,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:54:47,417 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:54:47,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:54:47,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:54:47,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:54:47,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 02:54:47,482 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:54:47,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 02:54:47,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 02:54:47,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-02 02:54:47,483 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 8 states. [2018-12-02 02:54:47,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:54:47,536 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-12-02 02:54:47,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 02:54:47,537 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-12-02 02:54:47,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:54:47,537 INFO L225 Difference]: With dead ends: 39 [2018-12-02 02:54:47,537 INFO L226 Difference]: Without dead ends: 39 [2018-12-02 02:54:47,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-12-02 02:54:47,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-02 02:54:47,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-12-02 02:54:47,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-02 02:54:47,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-12-02 02:54:47,540 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 17 [2018-12-02 02:54:47,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:54:47,540 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-12-02 02:54:47,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 02:54:47,540 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-12-02 02:54:47,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-02 02:54:47,540 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:54:47,540 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:54:47,541 INFO L423 AbstractCegarLoop]: === Iteration 10 === [cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 02:54:47,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:54:47,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1559524266, now seen corresponding path program 1 times [2018-12-02 02:54:47,541 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:54:47,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:54:47,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:54:47,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:54:47,542 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:54:47,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:54:47,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:54:47,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:54:47,662 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 02:54:47,662 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 18 with the following transitions: [2018-12-02 02:54:47,663 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [7], [14], [16], [22], [23], [27], [32], [38], [43], [44], [51], [52], [53], [55] [2018-12-02 02:54:47,682 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 02:54:47,683 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 02:54:47,811 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 02:54:47,812 INFO L272 AbstractInterpreter]: Visited 17 different actions 32 times. Merged at 5 different actions 15 times. Widened at 1 different actions 1 times. Performed 286 root evaluator evaluations with a maximum evaluation depth of 3. Performed 286 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 25 variables. [2018-12-02 02:54:47,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:54:47,819 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 02:54:47,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:54:47,819 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c8688e2-3e13-40b5-9c36-fb57cd9b37d0/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 02:54:47,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:54:47,826 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 02:54:47,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:54:47,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:54:47,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-02 02:54:47,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-02 02:54:47,876 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:54:47,877 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:54:47,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:54:47,881 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-12-02 02:54:47,939 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 18 treesize of output 14 [2018-12-02 02:54:47,950 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 14 treesize of output 11 [2018-12-02 02:54:47,950 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 02:54:47,954 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 02:54:47,972 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-02 02:54:47,972 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-12-02 02:54:48,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:54:48,022 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 02:54:48,133 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-12-02 02:54:48,134 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 02:54:48,140 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-02 02:54:48,149 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-02 02:54:48,149 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 02:54:48,151 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:54:48,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:54:48,156 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-12-02 02:54:48,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:54:48,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 02:54:48,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2018-12-02 02:54:48,175 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 02:54:48,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-02 02:54:48,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-02 02:54:48,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2018-12-02 02:54:48,176 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 15 states. [2018-12-02 02:54:48,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:54:48,459 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-12-02 02:54:48,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 02:54:48,459 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 17 [2018-12-02 02:54:48,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:54:48,460 INFO L225 Difference]: With dead ends: 49 [2018-12-02 02:54:48,460 INFO L226 Difference]: Without dead ends: 49 [2018-12-02 02:54:48,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=539, Unknown=0, NotChecked=0, Total=650 [2018-12-02 02:54:48,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-02 02:54:48,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 39. [2018-12-02 02:54:48,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-02 02:54:48,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-12-02 02:54:48,462 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 17 [2018-12-02 02:54:48,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:54:48,463 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-12-02 02:54:48,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-02 02:54:48,463 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-12-02 02:54:48,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-02 02:54:48,463 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:54:48,463 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:54:48,463 INFO L423 AbstractCegarLoop]: === Iteration 11 === [cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 02:54:48,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:54:48,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1100611937, now seen corresponding path program 1 times [2018-12-02 02:54:48,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:54:48,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:54:48,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:54:48,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:54:48,465 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:54:48,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:54:48,542 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:54:48,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:54:48,542 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 02:54:48,542 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-02 02:54:48,543 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [9], [14], [16], [22], [23], [27], [32], [38], [43], [44], [51], [52], [53], [55] [2018-12-02 02:54:48,544 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 02:54:48,544 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 02:54:48,579 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 02:54:48,579 INFO L272 AbstractInterpreter]: Visited 17 different actions 32 times. Merged at 5 different actions 15 times. Never widened. Performed 282 root evaluator evaluations with a maximum evaluation depth of 3. Performed 282 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 25 variables. [2018-12-02 02:54:48,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:54:48,582 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 02:54:48,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:54:48,582 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c8688e2-3e13-40b5-9c36-fb57cd9b37d0/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 02:54:48,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:54:48,591 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 02:54:48,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:54:48,605 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:54:48,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-02 02:54:48,615 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 02:54:48,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-02 02:54:48,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 02:54:48,624 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 02:54:48,634 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:54:48,649 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-02 02:54:48,649 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:25, output treesize:15 [2018-12-02 02:54:48,728 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:54:48,728 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 02:54:48,832 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:54:48,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 02:54:48,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 21 [2018-12-02 02:54:48,846 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 02:54:48,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-02 02:54:48,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-02 02:54:48,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2018-12-02 02:54:48,847 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 15 states. [2018-12-02 02:54:49,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:54:49,066 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2018-12-02 02:54:49,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 02:54:49,066 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2018-12-02 02:54:49,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:54:49,067 INFO L225 Difference]: With dead ends: 47 [2018-12-02 02:54:49,067 INFO L226 Difference]: Without dead ends: 47 [2018-12-02 02:54:49,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2018-12-02 02:54:49,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-02 02:54:49,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 38. [2018-12-02 02:54:49,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-02 02:54:49,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-12-02 02:54:49,069 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 18 [2018-12-02 02:54:49,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:54:49,070 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-12-02 02:54:49,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-02 02:54:49,070 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-12-02 02:54:49,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 02:54:49,070 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:54:49,070 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-02 02:54:49,070 INFO L423 AbstractCegarLoop]: === Iteration 12 === [cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 02:54:49,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:54:49,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1659911589, now seen corresponding path program 1 times [2018-12-02 02:54:49,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:54:49,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:54:49,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:54:49,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:54:49,071 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:54:49,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:54:49,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:54:49,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:54:49,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 02:54:49,103 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:54:49,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 02:54:49,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 02:54:49,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 02:54:49,103 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 4 states. [2018-12-02 02:54:49,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:54:49,123 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2018-12-02 02:54:49,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 02:54:49,124 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-12-02 02:54:49,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:54:49,124 INFO L225 Difference]: With dead ends: 37 [2018-12-02 02:54:49,124 INFO L226 Difference]: Without dead ends: 22 [2018-12-02 02:54:49,124 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-02 02:54:49,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-02 02:54:49,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-02 02:54:49,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-02 02:54:49,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-12-02 02:54:49,125 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 20 [2018-12-02 02:54:49,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:54:49,126 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-12-02 02:54:49,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 02:54:49,126 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-12-02 02:54:49,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 02:54:49,126 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:54:49,126 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:54:49,126 INFO L423 AbstractCegarLoop]: === Iteration 13 === [cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 02:54:49,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:54:49,126 INFO L82 PathProgramCache]: Analyzing trace with hash 549831877, now seen corresponding path program 2 times [2018-12-02 02:54:49,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:54:49,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:54:49,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:54:49,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:54:49,127 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:54:49,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:54:49,302 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:54:49,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:54:49,302 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 02:54:49,302 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 02:54:49,302 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 02:54:49,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:54:49,302 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c8688e2-3e13-40b5-9c36-fb57cd9b37d0/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 02:54:49,309 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 02:54:49,309 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 02:54:49,324 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-02 02:54:49,324 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 02:54:49,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:54:49,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-02 02:54:49,335 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 02:54:49,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-02 02:54:49,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 02:54:49,351 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 02:54:49,354 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:54:49,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:54:49,358 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 [2018-12-02 02:54:49,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-02 02:54:49,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-12-02 02:54:49,375 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:54:49,376 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:54:49,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:54:49,381 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-12-02 02:54:49,443 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 24 treesize of output 25 [2018-12-02 02:54:49,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 02:54:49,445 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:54:49,448 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:54:49,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:54:49,454 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:22 [2018-12-02 02:54:49,495 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 16 [2018-12-02 02:54:49,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-12-02 02:54:49,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 02:54:49,502 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 02:54:49,509 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-02 02:54:49,509 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:49 [2018-12-02 02:54:49,538 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:54:49,538 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 02:54:49,786 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 65 treesize of output 55 [2018-12-02 02:54:49,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-02 02:54:49,804 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:54:49,820 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-02 02:54:49,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-12-02 02:54:49,822 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 02:54:49,825 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:54:49,826 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-02 02:54:49,828 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-02 02:54:49,828 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 02:54:49,830 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:54:49,844 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-02 02:54:49,888 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 63 treesize of output 53 [2018-12-02 02:54:49,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-02 02:54:49,907 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 02:54:49,923 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-02 02:54:49,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-12-02 02:54:49,926 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 02:54:49,929 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:54:49,930 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-02 02:54:49,932 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-02 02:54:49,932 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 02:54:49,934 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:54:49,947 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-02 02:54:50,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-12-02 02:54:50,005 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:129, output treesize:244 [2018-12-02 02:54:50,095 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:54:50,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 02:54:50,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 25 [2018-12-02 02:54:50,110 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 02:54:50,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-02 02:54:50,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-02 02:54:50,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=573, Unknown=0, NotChecked=0, Total=650 [2018-12-02 02:54:50,111 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 17 states. [2018-12-02 02:54:50,647 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 34 [2018-12-02 02:54:51,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:54:51,085 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-12-02 02:54:51,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 02:54:51,086 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 21 [2018-12-02 02:54:51,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:54:51,087 INFO L225 Difference]: With dead ends: 24 [2018-12-02 02:54:51,087 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 02:54:51,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=201, Invalid=1131, Unknown=0, NotChecked=0, Total=1332 [2018-12-02 02:54:51,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 02:54:51,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 02:54:51,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 02:54:51,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 02:54:51,090 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2018-12-02 02:54:51,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:54:51,090 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 02:54:51,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-02 02:54:51,091 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 02:54:51,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 02:54:51,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 02:54:51 BoogieIcfgContainer [2018-12-02 02:54:51,099 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 02:54:51,099 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 02:54:51,099 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 02:54:51,100 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 02:54:51,100 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:54:46" (3/4) ... [2018-12-02 02:54:51,105 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 02:54:51,112 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrcpy [2018-12-02 02:54:51,112 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 02:54:51,113 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 02:54:51,116 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2018-12-02 02:54:51,116 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-12-02 02:54:51,116 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-02 02:54:51,141 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_6c8688e2-3e13-40b5-9c36-fb57cd9b37d0/bin-2019/utaipan/witness.graphml [2018-12-02 02:54:51,141 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 02:54:51,142 INFO L168 Benchmark]: Toolchain (without parser) took 4862.46 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 315.6 MB). Free memory was 953.4 MB in the beginning and 1.2 GB in the end (delta: -234.4 MB). Peak memory consumption was 81.2 MB. Max. memory is 11.5 GB. [2018-12-02 02:54:51,142 INFO L168 Benchmark]: CDTParser took 0.16 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-02 02:54:51,143 INFO L168 Benchmark]: CACSL2BoogieTranslator took 258.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 953.4 MB in the beginning and 1.1 GB in the end (delta: -182.7 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. [2018-12-02 02:54:51,143 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.78 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-02 02:54:51,143 INFO L168 Benchmark]: Boogie Preprocessor took 15.86 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-02 02:54:51,143 INFO L168 Benchmark]: RCFGBuilder took 165.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-02 02:54:51,144 INFO L168 Benchmark]: TraceAbstraction took 4360.59 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 157.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -87.3 MB). Peak memory consumption was 70.5 MB. Max. memory is 11.5 GB. [2018-12-02 02:54:51,144 INFO L168 Benchmark]: Witness Printer took 42.28 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 11.5 GB. [2018-12-02 02:54:51,145 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.16 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 258.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 953.4 MB in the beginning and 1.1 GB in the end (delta: -182.7 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 16.78 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 15.86 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 165.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 4360.59 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 157.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -87.3 MB). Peak memory consumption was 70.5 MB. Max. memory is 11.5 GB. * Witness Printer took 42.28 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 559]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 559]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 7 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 31 locations, 7 error locations. SAFE Result, 4.3s OverallTime, 13 OverallIterations, 2 TraceHistogramMax, 1.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 272 SDtfs, 286 SDslu, 827 SDs, 0 SdLazy, 661 SolverSat, 85 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 213 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 40 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 243 NumberOfCodeBlocks, 243 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 280 ConstructedInterpolants, 18 QuantifiedInterpolants, 42445 SizeOfPredicates, 45 NumberOfNonLiveVariables, 344 ConjunctsInSsa, 87 ConjunctsInUnsatCore, 19 InterpolantComputations, 10 PerfectInterpolantSequences, 1/28 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...