./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/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_3588ac72-4656-4e5e-9d45-e39b4edbaa8d/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3588ac72-4656-4e5e-9d45-e39b4edbaa8d/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3588ac72-4656-4e5e-9d45-e39b4edbaa8d/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3588ac72-4656-4e5e-9d45-e39b4edbaa8d/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/cstrcpy-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_3588ac72-4656-4e5e-9d45-e39b4edbaa8d/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3588ac72-4656-4e5e-9d45-e39b4edbaa8d/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 109b8bf9931c925f911ad0fbf9e2b946a30b466d ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 04:29:08,048 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 04:29:08,049 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 04:29:08,055 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 04:29:08,055 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 04:29:08,055 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 04:29:08,056 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 04:29:08,057 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 04:29:08,057 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 04:29:08,058 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 04:29:08,058 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 04:29:08,059 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 04:29:08,059 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 04:29:08,060 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 04:29:08,060 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 04:29:08,060 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 04:29:08,061 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 04:29:08,062 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 04:29:08,063 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 04:29:08,063 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 04:29:08,064 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 04:29:08,065 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 04:29:08,066 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 04:29:08,066 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 04:29:08,066 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 04:29:08,067 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 04:29:08,067 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 04:29:08,067 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 04:29:08,068 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 04:29:08,068 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 04:29:08,069 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 04:29:08,069 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 04:29:08,069 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 04:29:08,069 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 04:29:08,070 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 04:29:08,070 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 04:29:08,070 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3588ac72-4656-4e5e-9d45-e39b4edbaa8d/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-02 04:29:08,077 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 04:29:08,077 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 04:29:08,078 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 04:29:08,078 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 04:29:08,078 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 04:29:08,078 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 04:29:08,078 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 04:29:08,079 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 04:29:08,079 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 04:29:08,079 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 04:29:08,079 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 04:29:08,079 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 04:29:08,079 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 04:29:08,080 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 04:29:08,080 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 04:29:08,080 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 04:29:08,080 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 04:29:08,080 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 04:29:08,080 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 04:29:08,080 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 04:29:08,080 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 04:29:08,080 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-02 04:29:08,081 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-02 04:29:08,081 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-02 04:29:08,081 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 04:29:08,081 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 04:29:08,081 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 04:29:08,081 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 04:29:08,081 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 04:29:08,081 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 04:29:08,082 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 04:29:08,082 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 04:29:08,082 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 04:29:08,082 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 04:29:08,082 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 04:29:08,082 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 04:29:08,082 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_3588ac72-4656-4e5e-9d45-e39b4edbaa8d/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 -> 109b8bf9931c925f911ad0fbf9e2b946a30b466d [2018-12-02 04:29:08,101 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 04:29:08,109 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 04:29:08,111 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 04:29:08,112 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 04:29:08,112 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 04:29:08,113 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3588ac72-4656-4e5e-9d45-e39b4edbaa8d/bin-2019/utaipan/../../sv-benchmarks/c/array-memsafety/cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-12-02 04:29:08,151 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3588ac72-4656-4e5e-9d45-e39b4edbaa8d/bin-2019/utaipan/data/8cf9f2c37/d66470ba021c4388a1349c58b318ab8c/FLAG068979008 [2018-12-02 04:29:08,568 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 04:29:08,568 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3588ac72-4656-4e5e-9d45-e39b4edbaa8d/sv-benchmarks/c/array-memsafety/cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-12-02 04:29:08,574 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3588ac72-4656-4e5e-9d45-e39b4edbaa8d/bin-2019/utaipan/data/8cf9f2c37/d66470ba021c4388a1349c58b318ab8c/FLAG068979008 [2018-12-02 04:29:08,581 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3588ac72-4656-4e5e-9d45-e39b4edbaa8d/bin-2019/utaipan/data/8cf9f2c37/d66470ba021c4388a1349c58b318ab8c [2018-12-02 04:29:08,583 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 04:29:08,584 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 04:29:08,584 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 04:29:08,584 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 04:29:08,586 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 04:29:08,587 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:29:08" (1/1) ... [2018-12-02 04:29:08,588 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@89db293 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:29:08, skipping insertion in model container [2018-12-02 04:29:08,588 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:29:08" (1/1) ... [2018-12-02 04:29:08,593 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 04:29:08,610 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 04:29:08,747 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 04:29:08,791 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 04:29:08,810 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 04:29:08,829 INFO L195 MainTranslator]: Completed translation [2018-12-02 04:29:08,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:29:08 WrapperNode [2018-12-02 04:29:08,830 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 04:29:08,830 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 04:29:08,830 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 04:29:08,830 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 04:29:08,835 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:29:08" (1/1) ... [2018-12-02 04:29:08,843 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:29:08" (1/1) ... [2018-12-02 04:29:08,848 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 04:29:08,848 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 04:29:08,848 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 04:29:08,848 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 04:29:08,853 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:29:08" (1/1) ... [2018-12-02 04:29:08,853 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:29:08" (1/1) ... [2018-12-02 04:29:08,855 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:29:08" (1/1) ... [2018-12-02 04:29:08,855 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:29:08" (1/1) ... [2018-12-02 04:29:08,859 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:29:08" (1/1) ... [2018-12-02 04:29:08,861 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:29:08" (1/1) ... [2018-12-02 04:29:08,862 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:29:08" (1/1) ... [2018-12-02 04:29:08,863 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 04:29:08,863 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 04:29:08,864 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 04:29:08,864 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 04:29:08,864 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:29:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3588ac72-4656-4e5e-9d45-e39b4edbaa8d/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 04:29:08,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 04:29:08,896 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 04:29:08,896 INFO L130 BoogieDeclarations]: Found specification of procedure cstrcpy [2018-12-02 04:29:08,896 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrcpy [2018-12-02 04:29:08,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 04:29:08,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 04:29:08,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 04:29:08,896 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 04:29:08,896 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 04:29:08,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 04:29:08,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 04:29:08,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 04:29:09,026 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 04:29:09,026 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-02 04:29:09,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:29:09 BoogieIcfgContainer [2018-12-02 04:29:09,026 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 04:29:09,027 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 04:29:09,027 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 04:29:09,029 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 04:29:09,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 04:29:08" (1/3) ... [2018-12-02 04:29:09,029 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@586354ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 04:29:09, skipping insertion in model container [2018-12-02 04:29:09,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:29:08" (2/3) ... [2018-12-02 04:29:09,030 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@586354ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 04:29:09, skipping insertion in model container [2018-12-02 04:29:09,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:29:09" (3/3) ... [2018-12-02 04:29:09,031 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-12-02 04:29:09,037 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 04:29:09,041 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-12-02 04:29:09,051 INFO L257 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2018-12-02 04:29:09,066 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 04:29:09,067 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-02 04:29:09,067 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 04:29:09,067 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 04:29:09,067 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 04:29:09,067 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 04:29:09,067 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 04:29:09,067 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 04:29:09,076 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-12-02 04:29:09,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 04:29:09,082 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:29:09,083 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:29:09,084 INFO L423 AbstractCegarLoop]: === Iteration 1 === [cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2018-12-02 04:29:09,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:29:09,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1835221779, now seen corresponding path program 1 times [2018-12-02 04:29:09,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:29:09,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:29:09,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:29:09,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:29:09,119 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:29:09,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:29:09,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:29:09,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:29:09,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 04:29:09,184 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:29:09,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 04:29:09,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 04:29:09,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:29:09,196 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 4 states. [2018-12-02 04:29:09,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:29:09,242 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-12-02 04:29:09,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 04:29:09,243 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-02 04:29:09,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:29:09,248 INFO L225 Difference]: With dead ends: 35 [2018-12-02 04:29:09,248 INFO L226 Difference]: Without dead ends: 31 [2018-12-02 04:29:09,249 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 04:29:09,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-02 04:29:09,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-12-02 04:29:09,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-02 04:29:09,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-12-02 04:29:09,270 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 10 [2018-12-02 04:29:09,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:29:09,270 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-12-02 04:29:09,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 04:29:09,270 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-12-02 04:29:09,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 04:29:09,270 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:29:09,271 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:29:09,271 INFO L423 AbstractCegarLoop]: === Iteration 2 === [cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2018-12-02 04:29:09,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:29:09,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1835221805, now seen corresponding path program 1 times [2018-12-02 04:29:09,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:29:09,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:29:09,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:29:09,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:29:09,272 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:29:09,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:29:09,298 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 04:29:09,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:29:09,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 04:29:09,298 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:29:09,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 04:29:09,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 04:29:09,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 04:29:09,300 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 3 states. [2018-12-02 04:29:09,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:29:09,317 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-12-02 04:29:09,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 04:29:09,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-02 04:29:09,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:29:09,318 INFO L225 Difference]: With dead ends: 28 [2018-12-02 04:29:09,319 INFO L226 Difference]: Without dead ends: 28 [2018-12-02 04:29:09,319 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 04:29:09,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-02 04:29:09,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-02 04:29:09,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-02 04:29:09,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-12-02 04:29:09,322 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 10 [2018-12-02 04:29:09,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:29:09,322 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-12-02 04:29:09,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 04:29:09,323 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-12-02 04:29:09,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 04:29:09,323 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:29:09,323 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:29:09,323 INFO L423 AbstractCegarLoop]: === Iteration 3 === [cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2018-12-02 04:29:09,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:29:09,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1835221806, now seen corresponding path program 1 times [2018-12-02 04:29:09,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:29:09,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:29:09,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:29:09,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:29:09,325 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:29:09,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:29:09,366 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 04:29:09,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:29:09,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 04:29:09,367 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:29:09,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 04:29:09,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 04:29:09,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:29:09,367 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 4 states. [2018-12-02 04:29:09,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:29:09,381 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-12-02 04:29:09,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 04:29:09,382 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-02 04:29:09,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:29:09,382 INFO L225 Difference]: With dead ends: 29 [2018-12-02 04:29:09,382 INFO L226 Difference]: Without dead ends: 29 [2018-12-02 04:29:09,383 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 04:29:09,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-02 04:29:09,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-12-02 04:29:09,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-02 04:29:09,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2018-12-02 04:29:09,385 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 10 [2018-12-02 04:29:09,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:29:09,386 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-12-02 04:29:09,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 04:29:09,386 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-12-02 04:29:09,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 04:29:09,386 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:29:09,386 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:29:09,386 INFO L423 AbstractCegarLoop]: === Iteration 4 === [cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2018-12-02 04:29:09,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:29:09,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1835223701, now seen corresponding path program 1 times [2018-12-02 04:29:09,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:29:09,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:29:09,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:29:09,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:29:09,388 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:29:09,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:29:09,402 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 04:29:09,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:29:09,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 04:29:09,402 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:29:09,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 04:29:09,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 04:29:09,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 04:29:09,403 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 3 states. [2018-12-02 04:29:09,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:29:09,421 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2018-12-02 04:29:09,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 04:29:09,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-02 04:29:09,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:29:09,422 INFO L225 Difference]: With dead ends: 28 [2018-12-02 04:29:09,422 INFO L226 Difference]: Without dead ends: 27 [2018-12-02 04:29:09,422 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 04:29:09,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-02 04:29:09,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-12-02 04:29:09,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-02 04:29:09,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-12-02 04:29:09,424 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 10 [2018-12-02 04:29:09,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:29:09,424 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-12-02 04:29:09,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 04:29:09,425 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-12-02 04:29:09,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-02 04:29:09,425 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:29:09,425 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:29:09,425 INFO L423 AbstractCegarLoop]: === Iteration 5 === [cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2018-12-02 04:29:09,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:29:09,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1232155081, now seen corresponding path program 1 times [2018-12-02 04:29:09,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:29:09,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:29:09,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:29:09,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:29:09,426 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:29:09,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:29:09,454 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 04:29:09,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:29:09,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 04:29:09,454 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:29:09,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 04:29:09,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 04:29:09,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 04:29:09,455 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 6 states. [2018-12-02 04:29:09,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:29:09,491 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-12-02 04:29:09,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 04:29:09,491 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-12-02 04:29:09,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:29:09,491 INFO L225 Difference]: With dead ends: 25 [2018-12-02 04:29:09,491 INFO L226 Difference]: Without dead ends: 25 [2018-12-02 04:29:09,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 04:29:09,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-02 04:29:09,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-02 04:29:09,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-02 04:29:09,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-12-02 04:29:09,493 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 14 [2018-12-02 04:29:09,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:29:09,493 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-12-02 04:29:09,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 04:29:09,494 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-12-02 04:29:09,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-02 04:29:09,494 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:29:09,494 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:29:09,494 INFO L423 AbstractCegarLoop]: === Iteration 6 === [cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2018-12-02 04:29:09,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:29:09,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1232155080, now seen corresponding path program 1 times [2018-12-02 04:29:09,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:29:09,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:29:09,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:29:09,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:29:09,495 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:29:09,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:29:09,555 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 04:29:09,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:29:09,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 04:29:09,555 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:29:09,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 04:29:09,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 04:29:09,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-02 04:29:09,556 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 8 states. [2018-12-02 04:29:09,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:29:09,612 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-12-02 04:29:09,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 04:29:09,612 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-12-02 04:29:09,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:29:09,613 INFO L225 Difference]: With dead ends: 31 [2018-12-02 04:29:09,613 INFO L226 Difference]: Without dead ends: 31 [2018-12-02 04:29:09,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-12-02 04:29:09,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-02 04:29:09,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2018-12-02 04:29:09,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-02 04:29:09,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-12-02 04:29:09,615 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 14 [2018-12-02 04:29:09,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:29:09,615 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-12-02 04:29:09,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 04:29:09,615 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-12-02 04:29:09,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-02 04:29:09,615 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:29:09,615 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:29:09,616 INFO L423 AbstractCegarLoop]: === Iteration 7 === [cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2018-12-02 04:29:09,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:29:09,616 INFO L82 PathProgramCache]: Analyzing trace with hash 457898132, now seen corresponding path program 1 times [2018-12-02 04:29:09,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:29:09,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:29:09,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:29:09,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:29:09,616 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:29:09,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:29:09,662 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 04:29:09,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:29:09,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 04:29:09,663 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:29:09,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 04:29:09,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 04:29:09,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 04:29:09,663 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 7 states. [2018-12-02 04:29:09,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:29:09,695 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2018-12-02 04:29:09,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 04:29:09,696 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-12-02 04:29:09,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:29:09,696 INFO L225 Difference]: With dead ends: 26 [2018-12-02 04:29:09,696 INFO L226 Difference]: Without dead ends: 26 [2018-12-02 04:29:09,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-02 04:29:09,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-02 04:29:09,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-02 04:29:09,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-02 04:29:09,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-12-02 04:29:09,699 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 15 [2018-12-02 04:29:09,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:29:09,699 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-12-02 04:29:09,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 04:29:09,699 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-12-02 04:29:09,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-02 04:29:09,700 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:29:09,700 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:29:09,700 INFO L423 AbstractCegarLoop]: === Iteration 8 === [cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2018-12-02 04:29:09,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:29:09,700 INFO L82 PathProgramCache]: Analyzing trace with hash 457898133, now seen corresponding path program 1 times [2018-12-02 04:29:09,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:29:09,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:29:09,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:29:09,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:29:09,701 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:29:09,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:29:09,754 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 04:29:09,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:29:09,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 04:29:09,754 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:29:09,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 04:29:09,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 04:29:09,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 04:29:09,755 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 7 states. [2018-12-02 04:29:09,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:29:09,801 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-12-02 04:29:09,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 04:29:09,802 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-12-02 04:29:09,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:29:09,802 INFO L225 Difference]: With dead ends: 28 [2018-12-02 04:29:09,802 INFO L226 Difference]: Without dead ends: 28 [2018-12-02 04:29:09,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-12-02 04:29:09,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-02 04:29:09,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-12-02 04:29:09,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-02 04:29:09,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-12-02 04:29:09,804 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 15 [2018-12-02 04:29:09,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:29:09,804 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-12-02 04:29:09,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 04:29:09,804 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-12-02 04:29:09,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-02 04:29:09,805 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:29:09,805 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 04:29:09,805 INFO L423 AbstractCegarLoop]: === Iteration 9 === [cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2018-12-02 04:29:09,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:29:09,805 INFO L82 PathProgramCache]: Analyzing trace with hash 427104064, now seen corresponding path program 1 times [2018-12-02 04:29:09,805 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:29:09,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:29:09,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:29:09,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:29:09,806 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:29:09,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:29:09,879 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:29:09,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:29:09,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 04:29:09,879 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:29:09,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 04:29:09,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 04:29:09,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-02 04:29:09,880 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 9 states. [2018-12-02 04:29:09,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:29:09,948 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2018-12-02 04:29:09,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 04:29:09,949 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-12-02 04:29:09,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:29:09,949 INFO L225 Difference]: With dead ends: 41 [2018-12-02 04:29:09,949 INFO L226 Difference]: Without dead ends: 41 [2018-12-02 04:29:09,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-12-02 04:29:09,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-02 04:29:09,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2018-12-02 04:29:09,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-02 04:29:09,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-12-02 04:29:09,952 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 18 [2018-12-02 04:29:09,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:29:09,952 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-12-02 04:29:09,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 04:29:09,952 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-12-02 04:29:09,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-02 04:29:09,953 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:29:09,953 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 04:29:09,953 INFO L423 AbstractCegarLoop]: === Iteration 10 === [cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2018-12-02 04:29:09,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:29:09,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1128168642, now seen corresponding path program 1 times [2018-12-02 04:29:09,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:29:09,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:29:09,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:29:09,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:29:09,954 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:29:09,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:29:10,091 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 04:29:10,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:29:10,091 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:29:10,092 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-02 04:29:10,093 INFO L205 CegarAbsIntRunner]: [0], [5], [6], [8], [9], [16], [22], [23], [27], [32], [38], [43], [44], [51], [52], [53], [55] [2018-12-02 04:29:10,114 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 04:29:10,114 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 04:29:10,222 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 04:29:10,223 INFO L272 AbstractInterpreter]: Visited 17 different actions 22 times. Merged at 5 different actions 5 times. Never widened. Performed 224 root evaluator evaluations with a maximum evaluation depth of 3. Performed 224 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 27 variables. [2018-12-02 04:29:10,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:29:10,230 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 04:29:10,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:29:10,230 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3588ac72-4656-4e5e-9d45-e39b4edbaa8d/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 04:29:10,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:29:10,238 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 04:29:10,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:29:10,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:29:10,288 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 04:29:10,290 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 04:29:10,290 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:29:10,292 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:29:10,299 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 04:29:10,299 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-12-02 04:29:10,401 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 04:29:10,407 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 04:29:10,407 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 04:29:10,410 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 04:29:10,420 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 04:29:10,421 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-12-02 04:29:10,448 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 04:29:10,449 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:29:10,606 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 04:29:10,606 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 04:29:10,612 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 04:29:10,620 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 04:29:10,620 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 04:29:10,622 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:29:10,626 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 04:29:10,626 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-12-02 04:29:10,632 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 04:29:10,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 04:29:10,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 22 [2018-12-02 04:29:10,647 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 04:29:10,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-02 04:29:10,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-02 04:29:10,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-12-02 04:29:10,648 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 16 states. [2018-12-02 04:29:10,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:29:10,977 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-12-02 04:29:10,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 04:29:10,978 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-12-02 04:29:10,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:29:10,980 INFO L225 Difference]: With dead ends: 44 [2018-12-02 04:29:10,980 INFO L226 Difference]: Without dead ends: 44 [2018-12-02 04:29:10,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=119, Invalid=693, Unknown=0, NotChecked=0, Total=812 [2018-12-02 04:29:10,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-02 04:29:10,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2018-12-02 04:29:10,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-02 04:29:10,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-12-02 04:29:10,984 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 18 [2018-12-02 04:29:10,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:29:10,984 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-12-02 04:29:10,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-02 04:29:10,984 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-12-02 04:29:10,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-02 04:29:10,985 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:29:10,985 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:29:10,985 INFO L423 AbstractCegarLoop]: === Iteration 11 === [cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2018-12-02 04:29:10,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:29:10,986 INFO L82 PathProgramCache]: Analyzing trace with hash 613489483, now seen corresponding path program 1 times [2018-12-02 04:29:10,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:29:10,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:29:10,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:29:10,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:29:10,987 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:29:10,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:29:11,103 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:29:11,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:29:11,104 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:29:11,104 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2018-12-02 04:29:11,104 INFO L205 CegarAbsIntRunner]: [0], [5], [6], [9], [11], [16], [22], [23], [27], [32], [38], [43], [44], [51], [52], [53], [55] [2018-12-02 04:29:11,105 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 04:29:11,105 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 04:29:11,133 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 04:29:11,134 INFO L272 AbstractInterpreter]: Visited 17 different actions 22 times. Merged at 5 different actions 5 times. Never widened. Performed 224 root evaluator evaluations with a maximum evaluation depth of 3. Performed 224 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 27 variables. [2018-12-02 04:29:11,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:29:11,138 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 04:29:11,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:29:11,138 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3588ac72-4656-4e5e-9d45-e39b4edbaa8d/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 04:29:11,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:29:11,144 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 04:29:11,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:29:11,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:29:11,171 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 04:29:11,171 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 04:29:11,184 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 04:29:11,186 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 04:29:11,187 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 04:29:11,190 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:29:11,196 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 04:29:11,196 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:25, output treesize:15 [2018-12-02 04:29:11,325 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:29:11,325 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:29:11,480 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:29:11,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 04:29:11,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 26 [2018-12-02 04:29:11,495 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 04:29:11,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-02 04:29:11,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-02 04:29:11,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=609, Unknown=0, NotChecked=0, Total=702 [2018-12-02 04:29:11,496 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 19 states. [2018-12-02 04:29:11,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:29:11,910 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-12-02 04:29:11,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 04:29:11,910 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2018-12-02 04:29:11,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:29:11,911 INFO L225 Difference]: With dead ends: 45 [2018-12-02 04:29:11,911 INFO L226 Difference]: Without dead ends: 45 [2018-12-02 04:29:11,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=219, Invalid=1113, Unknown=0, NotChecked=0, Total=1332 [2018-12-02 04:29:11,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-02 04:29:11,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2018-12-02 04:29:11,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-02 04:29:11,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-12-02 04:29:11,913 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 19 [2018-12-02 04:29:11,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:29:11,913 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-12-02 04:29:11,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-02 04:29:11,913 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-12-02 04:29:11,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 04:29:11,914 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:29:11,914 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:29:11,914 INFO L423 AbstractCegarLoop]: === Iteration 12 === [cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2018-12-02 04:29:11,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:29:11,914 INFO L82 PathProgramCache]: Analyzing trace with hash 2121077022, now seen corresponding path program 1 times [2018-12-02 04:29:11,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:29:11,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:29:11,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:29:11,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:29:11,915 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:29:11,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:29:11,939 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 04:29:11,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:29:11,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 04:29:11,939 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:29:11,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 04:29:11,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 04:29:11,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:29:11,940 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 4 states. [2018-12-02 04:29:11,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:29:11,960 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-12-02 04:29:11,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 04:29:11,960 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-12-02 04:29:11,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:29:11,961 INFO L225 Difference]: With dead ends: 39 [2018-12-02 04:29:11,961 INFO L226 Difference]: Without dead ends: 23 [2018-12-02 04:29:11,961 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 04:29:11,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-02 04:29:11,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-02 04:29:11,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-02 04:29:11,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-12-02 04:29:11,962 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 21 [2018-12-02 04:29:11,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:29:11,962 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-12-02 04:29:11,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 04:29:11,962 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-12-02 04:29:11,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 04:29:11,962 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:29:11,963 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:29:11,963 INFO L423 AbstractCegarLoop]: === Iteration 13 === [cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2018-12-02 04:29:11,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:29:11,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1379299530, now seen corresponding path program 2 times [2018-12-02 04:29:11,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:29:11,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:29:11,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:29:11,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:29:11,963 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:29:11,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:29:12,191 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:29:12,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:29:12,191 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:29:12,191 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 04:29:12,191 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 04:29:12,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:29:12,191 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3588ac72-4656-4e5e-9d45-e39b4edbaa8d/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 04:29:12,197 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 04:29:12,197 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 04:29:12,218 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-02 04:29:12,218 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 04:29:12,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:29:12,232 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 04:29:12,232 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 04:29:12,236 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 04:29:12,238 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 04:29:12,238 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 04:29:12,241 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:29:12,245 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 04:29:12,245 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 [2018-12-02 04:29:12,259 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 04:29:12,260 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 04:29:12,260 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:29:12,261 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:29:12,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:29:12,268 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-12-02 04:29:12,352 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 04:29:12,354 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 04:29:12,354 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:29:12,358 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:29:12,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 04:29:12,364 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:28 [2018-12-02 04:29:12,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-12-02 04:29:12,423 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 18 treesize of output 15 [2018-12-02 04:29:12,424 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 04:29:12,427 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 04:29:12,435 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 04:29:12,435 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:47 [2018-12-02 04:29:12,468 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:29:12,468 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:29:12,805 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 04:29:12,824 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 04:29:12,824 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 04:29:12,839 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 04:29:12,841 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 04:29:12,841 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 04:29:12,844 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:29:12,845 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 04:29:12,847 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 04:29:12,847 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 04:29:12,849 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:29:12,862 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 04:29:12,908 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 04:29:12,926 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 04:29:12,926 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 04:29:12,941 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 04:29:12,943 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 04:29:12,943 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 04:29:12,944 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:29:12,945 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 04:29:12,947 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 04:29:12,947 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 04:29:12,949 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:29:12,962 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 04:29:13,015 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 04:29:13,015 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:129, output treesize:244 [2018-12-02 04:29:13,201 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 26 [2018-12-02 04:29:13,220 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:29:13,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 04:29:13,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 30 [2018-12-02 04:29:13,258 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 04:29:13,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-02 04:29:13,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-02 04:29:13,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=839, Unknown=0, NotChecked=0, Total=930 [2018-12-02 04:29:13,259 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 21 states. [2018-12-02 04:29:14,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:29:14,002 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-12-02 04:29:14,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 04:29:14,003 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 22 [2018-12-02 04:29:14,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:29:14,004 INFO L225 Difference]: With dead ends: 24 [2018-12-02 04:29:14,004 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 04:29:14,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=224, Invalid=1582, Unknown=0, NotChecked=0, Total=1806 [2018-12-02 04:29:14,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 04:29:14,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 04:29:14,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 04:29:14,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 04:29:14,007 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2018-12-02 04:29:14,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:29:14,007 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 04:29:14,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-02 04:29:14,007 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 04:29:14,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 04:29:14,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 04:29:14 BoogieIcfgContainer [2018-12-02 04:29:14,017 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 04:29:14,017 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 04:29:14,017 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 04:29:14,018 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 04:29:14,019 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:29:09" (3/4) ... [2018-12-02 04:29:14,024 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 04:29:14,031 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrcpy [2018-12-02 04:29:14,031 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 04:29:14,031 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 04:29:14,035 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2018-12-02 04:29:14,035 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-02 04:29:14,035 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-02 04:29:14,063 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3588ac72-4656-4e5e-9d45-e39b4edbaa8d/bin-2019/utaipan/witness.graphml [2018-12-02 04:29:14,063 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 04:29:14,063 INFO L168 Benchmark]: Toolchain (without parser) took 5480.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.0 MB). Free memory was 948.1 MB in the beginning and 974.0 MB in the end (delta: -25.9 MB). Peak memory consumption was 146.1 MB. Max. memory is 11.5 GB. [2018-12-02 04:29:14,064 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 04:29:14,064 INFO L168 Benchmark]: CACSL2BoogieTranslator took 245.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -168.3 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. [2018-12-02 04:29:14,064 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.39 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-02 04:29:14,064 INFO L168 Benchmark]: Boogie Preprocessor took 15.47 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 04:29:14,064 INFO L168 Benchmark]: RCFGBuilder took 162.80 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: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-12-02 04:29:14,065 INFO L168 Benchmark]: TraceAbstraction took 4989.99 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 45.1 MB). Free memory was 1.1 GB in the beginning and 974.8 MB in the end (delta: 116.5 MB). Peak memory consumption was 161.6 MB. Max. memory is 11.5 GB. [2018-12-02 04:29:14,065 INFO L168 Benchmark]: Witness Printer took 45.68 ms. Allocated memory is still 1.2 GB. Free memory was 974.8 MB in the beginning and 974.0 MB in the end (delta: 861.2 kB). Peak memory consumption was 861.2 kB. Max. memory is 11.5 GB. [2018-12-02 04:29:14,066 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 245.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -168.3 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.39 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.47 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 162.80 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: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4989.99 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 45.1 MB). Free memory was 1.1 GB in the beginning and 974.8 MB in the end (delta: 116.5 MB). Peak memory consumption was 161.6 MB. Max. memory is 11.5 GB. * Witness Printer took 45.68 ms. Allocated memory is still 1.2 GB. Free memory was 974.8 MB in the beginning and 974.0 MB in the end (delta: 861.2 kB). Peak memory consumption was 861.2 kB. 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: 560]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 560]: 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.9s OverallTime, 13 OverallIterations, 3 TraceHistogramMax, 1.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 268 SDtfs, 258 SDslu, 977 SDs, 0 SdLazy, 861 SolverSat, 84 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 237 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred 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, 21 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 255 NumberOfCodeBlocks, 255 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 295 ConstructedInterpolants, 22 QuantifiedInterpolants, 51885 SizeOfPredicates, 63 NumberOfNonLiveVariables, 436 ConjunctsInSsa, 135 ConjunctsInUnsatCore, 19 InterpolantComputations, 10 PerfectInterpolantSequences, 3/41 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...