./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstrnlen-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_8983e65f-880c-493d-94c9-aa20284b68b5/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8983e65f-880c-493d-94c9-aa20284b68b5/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8983e65f-880c-493d-94c9-aa20284b68b5/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8983e65f-880c-493d-94c9-aa20284b68b5/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrnlen-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_8983e65f-880c-493d-94c9-aa20284b68b5/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8983e65f-880c-493d-94c9-aa20284b68b5/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 12318f34040209c37cd54fcab38029595d0807d6 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 06:58:56,095 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 06:58:56,096 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 06:58:56,104 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 06:58:56,104 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 06:58:56,105 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 06:58:56,106 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 06:58:56,107 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 06:58:56,108 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 06:58:56,108 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 06:58:56,109 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 06:58:56,109 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 06:58:56,110 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 06:58:56,110 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 06:58:56,111 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 06:58:56,112 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 06:58:56,112 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 06:58:56,113 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 06:58:56,115 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 06:58:56,116 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 06:58:56,117 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 06:58:56,117 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 06:58:56,119 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 06:58:56,119 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 06:58:56,119 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 06:58:56,120 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 06:58:56,121 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 06:58:56,121 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 06:58:56,122 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 06:58:56,123 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 06:58:56,123 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 06:58:56,123 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 06:58:56,123 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 06:58:56,124 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 06:58:56,124 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 06:58:56,125 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 06:58:56,125 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8983e65f-880c-493d-94c9-aa20284b68b5/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-02 06:58:56,135 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 06:58:56,136 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 06:58:56,136 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 06:58:56,136 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 06:58:56,136 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 06:58:56,136 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 06:58:56,136 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 06:58:56,136 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 06:58:56,137 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 06:58:56,137 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 06:58:56,137 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 06:58:56,137 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 06:58:56,137 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 06:58:56,137 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 06:58:56,137 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 06:58:56,138 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 06:58:56,138 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 06:58:56,138 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 06:58:56,138 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 06:58:56,138 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 06:58:56,138 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 06:58:56,138 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-02 06:58:56,139 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-02 06:58:56,139 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-02 06:58:56,139 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 06:58:56,139 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 06:58:56,139 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 06:58:56,139 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 06:58:56,139 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 06:58:56,139 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 06:58:56,139 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 06:58:56,139 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 06:58:56,139 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 06:58:56,139 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 06:58:56,140 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 06:58:56,140 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 06:58:56,140 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_8983e65f-880c-493d-94c9-aa20284b68b5/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 -> 12318f34040209c37cd54fcab38029595d0807d6 [2018-12-02 06:58:56,161 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 06:58:56,168 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 06:58:56,170 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 06:58:56,171 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 06:58:56,171 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 06:58:56,171 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8983e65f-880c-493d-94c9-aa20284b68b5/bin-2019/utaipan/../../sv-benchmarks/c/array-memsafety/openbsd_cstrnlen-alloca_true-valid-memsafety_true-termination.i [2018-12-02 06:58:56,205 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8983e65f-880c-493d-94c9-aa20284b68b5/bin-2019/utaipan/data/eecc32422/0289b5fc2ecb496c8bb531790e739128/FLAG2f962db10 [2018-12-02 06:58:56,600 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 06:58:56,600 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8983e65f-880c-493d-94c9-aa20284b68b5/sv-benchmarks/c/array-memsafety/openbsd_cstrnlen-alloca_true-valid-memsafety_true-termination.i [2018-12-02 06:58:56,606 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8983e65f-880c-493d-94c9-aa20284b68b5/bin-2019/utaipan/data/eecc32422/0289b5fc2ecb496c8bb531790e739128/FLAG2f962db10 [2018-12-02 06:58:56,614 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8983e65f-880c-493d-94c9-aa20284b68b5/bin-2019/utaipan/data/eecc32422/0289b5fc2ecb496c8bb531790e739128 [2018-12-02 06:58:56,615 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 06:58:56,616 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 06:58:56,617 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 06:58:56,617 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 06:58:56,619 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 06:58:56,619 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:58:56" (1/1) ... [2018-12-02 06:58:56,621 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b0ff27c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:58:56, skipping insertion in model container [2018-12-02 06:58:56,621 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:58:56" (1/1) ... [2018-12-02 06:58:56,626 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 06:58:56,649 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 06:58:56,808 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 06:58:56,814 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 06:58:56,872 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 06:58:56,898 INFO L195 MainTranslator]: Completed translation [2018-12-02 06:58:56,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:58:56 WrapperNode [2018-12-02 06:58:56,899 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 06:58:56,899 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 06:58:56,899 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 06:58:56,899 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 06:58:56,904 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:58:56" (1/1) ... [2018-12-02 06:58:56,912 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:58:56" (1/1) ... [2018-12-02 06:58:56,917 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 06:58:56,917 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 06:58:56,917 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 06:58:56,917 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 06:58:56,922 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:58:56" (1/1) ... [2018-12-02 06:58:56,923 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:58:56" (1/1) ... [2018-12-02 06:58:56,924 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:58:56" (1/1) ... [2018-12-02 06:58:56,924 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:58:56" (1/1) ... [2018-12-02 06:58:56,928 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:58:56" (1/1) ... [2018-12-02 06:58:56,931 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:58:56" (1/1) ... [2018-12-02 06:58:56,932 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:58:56" (1/1) ... [2018-12-02 06:58:56,933 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 06:58:56,933 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 06:58:56,933 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 06:58:56,933 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 06:58:56,934 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:58:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8983e65f-880c-493d-94c9-aa20284b68b5/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 06:58:56,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 06:58:56,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 06:58:56,965 INFO L130 BoogieDeclarations]: Found specification of procedure cstrnlen [2018-12-02 06:58:56,965 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrnlen [2018-12-02 06:58:56,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 06:58:56,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 06:58:56,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 06:58:56,965 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 06:58:56,965 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 06:58:56,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 06:58:56,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 06:58:56,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 06:58:57,089 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 06:58:57,089 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-02 06:58:57,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:58:57 BoogieIcfgContainer [2018-12-02 06:58:57,089 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 06:58:57,090 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 06:58:57,090 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 06:58:57,092 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 06:58:57,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 06:58:56" (1/3) ... [2018-12-02 06:58:57,092 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@205cc01a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 06:58:57, skipping insertion in model container [2018-12-02 06:58:57,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:58:56" (2/3) ... [2018-12-02 06:58:57,092 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@205cc01a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 06:58:57, skipping insertion in model container [2018-12-02 06:58:57,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:58:57" (3/3) ... [2018-12-02 06:58:57,093 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstrnlen-alloca_true-valid-memsafety_true-termination.i [2018-12-02 06:58:57,099 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 06:58:57,103 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-12-02 06:58:57,112 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2018-12-02 06:58:57,126 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 06:58:57,126 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-02 06:58:57,126 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 06:58:57,126 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 06:58:57,126 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 06:58:57,126 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 06:58:57,126 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 06:58:57,127 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 06:58:57,134 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-12-02 06:58:57,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 06:58:57,140 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:58:57,140 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:58:57,142 INFO L423 AbstractCegarLoop]: === Iteration 1 === [cstrnlenErr0REQUIRES_VIOLATION, cstrnlenErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-02 06:58:57,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:58:57,146 INFO L82 PathProgramCache]: Analyzing trace with hash 406375827, now seen corresponding path program 1 times [2018-12-02 06:58:57,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:58:57,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:58:57,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:58:57,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:58:57,175 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:58:57,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:58:57,254 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 06:58:57,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:58:57,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:58:57,255 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:58:57,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 06:58:57,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 06:58:57,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 06:58:57,267 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 4 states. [2018-12-02 06:58:57,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:58:57,289 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-12-02 06:58:57,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 06:58:57,291 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-02 06:58:57,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:58:57,296 INFO L225 Difference]: With dead ends: 30 [2018-12-02 06:58:57,296 INFO L226 Difference]: Without dead ends: 27 [2018-12-02 06:58:57,297 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 06:58:57,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-02 06:58:57,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-02 06:58:57,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-02 06:58:57,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2018-12-02 06:58:57,317 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 10 [2018-12-02 06:58:57,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:58:57,318 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-12-02 06:58:57,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 06:58:57,318 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-12-02 06:58:57,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 06:58:57,318 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:58:57,318 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:58:57,318 INFO L423 AbstractCegarLoop]: === Iteration 2 === [cstrnlenErr0REQUIRES_VIOLATION, cstrnlenErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-02 06:58:57,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:58:57,319 INFO L82 PathProgramCache]: Analyzing trace with hash 406375826, now seen corresponding path program 1 times [2018-12-02 06:58:57,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:58:57,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:58:57,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:58:57,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:58:57,320 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:58:57,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:58:57,339 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 06:58:57,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:58:57,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 06:58:57,340 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:58:57,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:58:57,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:58:57,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:58:57,342 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 3 states. [2018-12-02 06:58:57,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:58:57,355 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2018-12-02 06:58:57,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:58:57,356 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-02 06:58:57,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:58:57,356 INFO L225 Difference]: With dead ends: 26 [2018-12-02 06:58:57,356 INFO L226 Difference]: Without dead ends: 26 [2018-12-02 06:58:57,357 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 06:58:57,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-02 06:58:57,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-02 06:58:57,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-02 06:58:57,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2018-12-02 06:58:57,360 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 10 [2018-12-02 06:58:57,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:58:57,360 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2018-12-02 06:58:57,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:58:57,360 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-12-02 06:58:57,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-02 06:58:57,360 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:58:57,360 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:58:57,360 INFO L423 AbstractCegarLoop]: === Iteration 3 === [cstrnlenErr0REQUIRES_VIOLATION, cstrnlenErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-02 06:58:57,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:58:57,361 INFO L82 PathProgramCache]: Analyzing trace with hash 382877998, now seen corresponding path program 1 times [2018-12-02 06:58:57,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:58:57,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:58:57,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:58:57,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:58:57,361 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:58:57,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:58:57,403 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 06:58:57,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:58:57,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 06:58:57,403 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:58:57,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 06:58:57,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 06:58:57,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:58:57,404 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 5 states. [2018-12-02 06:58:57,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:58:57,441 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2018-12-02 06:58:57,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 06:58:57,441 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-12-02 06:58:57,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:58:57,442 INFO L225 Difference]: With dead ends: 25 [2018-12-02 06:58:57,442 INFO L226 Difference]: Without dead ends: 25 [2018-12-02 06:58:57,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 06:58:57,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-02 06:58:57,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-02 06:58:57,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-02 06:58:57,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-12-02 06:58:57,444 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 15 [2018-12-02 06:58:57,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:58:57,444 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-12-02 06:58:57,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 06:58:57,444 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-12-02 06:58:57,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-02 06:58:57,444 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:58:57,445 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:58:57,445 INFO L423 AbstractCegarLoop]: === Iteration 4 === [cstrnlenErr0REQUIRES_VIOLATION, cstrnlenErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-02 06:58:57,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:58:57,445 INFO L82 PathProgramCache]: Analyzing trace with hash 382877999, now seen corresponding path program 1 times [2018-12-02 06:58:57,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:58:57,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:58:57,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:58:57,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:58:57,446 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:58:57,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:58:57,503 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 06:58:57,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:58:57,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 06:58:57,503 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:58:57,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 06:58:57,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 06:58:57,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 06:58:57,503 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 7 states. [2018-12-02 06:58:57,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:58:57,542 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2018-12-02 06:58:57,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 06:58:57,543 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-12-02 06:58:57,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:58:57,545 INFO L225 Difference]: With dead ends: 34 [2018-12-02 06:58:57,545 INFO L226 Difference]: Without dead ends: 34 [2018-12-02 06:58:57,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-02 06:58:57,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-02 06:58:57,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2018-12-02 06:58:57,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-02 06:58:57,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-12-02 06:58:57,548 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 15 [2018-12-02 06:58:57,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:58:57,548 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-12-02 06:58:57,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 06:58:57,548 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-12-02 06:58:57,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-02 06:58:57,549 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:58:57,549 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:58:57,549 INFO L423 AbstractCegarLoop]: === Iteration 5 === [cstrnlenErr0REQUIRES_VIOLATION, cstrnlenErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-02 06:58:57,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:58:57,549 INFO L82 PathProgramCache]: Analyzing trace with hash -14252764, now seen corresponding path program 1 times [2018-12-02 06:58:57,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:58:57,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:58:57,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:58:57,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:58:57,550 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:58:57,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:58:57,568 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 06:58:57,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:58:57,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:58:57,569 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:58:57,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:58:57,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:58:57,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:58:57,569 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 3 states. [2018-12-02 06:58:57,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:58:57,575 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-12-02 06:58:57,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:58:57,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-02 06:58:57,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:58:57,575 INFO L225 Difference]: With dead ends: 29 [2018-12-02 06:58:57,576 INFO L226 Difference]: Without dead ends: 29 [2018-12-02 06:58:57,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:58:57,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-02 06:58:57,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-02 06:58:57,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-02 06:58:57,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-12-02 06:58:57,578 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 19 [2018-12-02 06:58:57,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:58:57,578 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-12-02 06:58:57,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:58:57,578 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-12-02 06:58:57,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 06:58:57,578 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:58:57,579 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:58:57,579 INFO L423 AbstractCegarLoop]: === Iteration 6 === [cstrnlenErr0REQUIRES_VIOLATION, cstrnlenErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-02 06:58:57,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:58:57,579 INFO L82 PathProgramCache]: Analyzing trace with hash -494696181, now seen corresponding path program 1 times [2018-12-02 06:58:57,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:58:57,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:58:57,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:58:57,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:58:57,580 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:58:57,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:58:57,639 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 06:58:57,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:58:57,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 06:58:57,640 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:58:57,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 06:58:57,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 06:58:57,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 06:58:57,640 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 6 states. [2018-12-02 06:58:57,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:58:57,695 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2018-12-02 06:58:57,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 06:58:57,696 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-12-02 06:58:57,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:58:57,697 INFO L225 Difference]: With dead ends: 45 [2018-12-02 06:58:57,697 INFO L226 Difference]: Without dead ends: 45 [2018-12-02 06:58:57,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-02 06:58:57,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-02 06:58:57,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 36. [2018-12-02 06:58:57,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-02 06:58:57,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2018-12-02 06:58:57,705 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 20 [2018-12-02 06:58:57,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:58:57,705 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-12-02 06:58:57,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 06:58:57,706 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2018-12-02 06:58:57,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 06:58:57,707 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:58:57,707 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:58:57,707 INFO L423 AbstractCegarLoop]: === Iteration 7 === [cstrnlenErr0REQUIRES_VIOLATION, cstrnlenErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-02 06:58:57,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:58:57,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1081502195, now seen corresponding path program 1 times [2018-12-02 06:58:57,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:58:57,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:58:57,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:58:57,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:58:57,709 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:58:57,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:58:57,744 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 06:58:57,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:58:57,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:58:57,744 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:58:57,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 06:58:57,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 06:58:57,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 06:58:57,745 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 4 states. [2018-12-02 06:58:57,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:58:57,766 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2018-12-02 06:58:57,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 06:58:57,766 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-12-02 06:58:57,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:58:57,767 INFO L225 Difference]: With dead ends: 35 [2018-12-02 06:58:57,767 INFO L226 Difference]: Without dead ends: 25 [2018-12-02 06:58:57,767 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 06:58:57,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-02 06:58:57,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2018-12-02 06:58:57,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-02 06:58:57,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-12-02 06:58:57,769 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 20 [2018-12-02 06:58:57,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:58:57,769 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-12-02 06:58:57,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 06:58:57,769 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-12-02 06:58:57,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 06:58:57,769 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:58:57,769 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:58:57,770 INFO L423 AbstractCegarLoop]: === Iteration 8 === [cstrnlenErr0REQUIRES_VIOLATION, cstrnlenErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-02 06:58:57,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:58:57,770 INFO L82 PathProgramCache]: Analyzing trace with hash 171402567, now seen corresponding path program 1 times [2018-12-02 06:58:57,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:58:57,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:58:57,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:58:57,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:58:57,771 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:58:57,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:58:57,821 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:58:57,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 06:58:57,822 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 06:58:57,822 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-12-02 06:58:57,824 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [12], [13], [21], [23], [32], [35], [41], [45], [46], [53], [54], [55], [57] [2018-12-02 06:58:57,844 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 06:58:57,844 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 06:58:57,942 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 06:58:57,943 INFO L272 AbstractInterpreter]: Visited 19 different actions 21 times. Merged at 2 different actions 2 times. Never widened. Performed 147 root evaluator evaluations with a maximum evaluation depth of 4. Performed 147 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 23 variables. [2018-12-02 06:58:57,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:58:57,951 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 06:58:57,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 06:58:57,952 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8983e65f-880c-493d-94c9-aa20284b68b5/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 06:58:57,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:58:57,958 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 06:58:57,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:58:57,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:58:58,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 06:58:58,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 06:58:58,012 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 06:58:58,013 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:58:58,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:58:58,014 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-12-02 06:58:58,047 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-02 06:58:58,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 06:58:58,049 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 06:58:58,050 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:58:58,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:58:58,051 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-12-02 06:58:58,064 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:58:58,064 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 06:58:58,072 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 06:58:58,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-12-02 06:58:58,082 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 06:58:58,083 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:58:58,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:58:58,084 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:3 [2018-12-02 06:58:58,087 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:58:58,102 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 06:58:58,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [7] total 12 [2018-12-02 06:58:58,102 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:58:58,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 06:58:58,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 06:58:58,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-02 06:58:58,103 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 8 states. [2018-12-02 06:58:58,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:58:58,163 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-12-02 06:58:58,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 06:58:58,163 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-12-02 06:58:58,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:58:58,164 INFO L225 Difference]: With dead ends: 32 [2018-12-02 06:58:58,164 INFO L226 Difference]: Without dead ends: 22 [2018-12-02 06:58:58,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2018-12-02 06:58:58,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-02 06:58:58,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-02 06:58:58,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-02 06:58:58,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-12-02 06:58:58,165 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 21 [2018-12-02 06:58:58,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:58:58,166 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-12-02 06:58:58,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 06:58:58,166 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-12-02 06:58:58,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 06:58:58,166 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:58:58,166 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:58:58,166 INFO L423 AbstractCegarLoop]: === Iteration 9 === [cstrnlenErr0REQUIRES_VIOLATION, cstrnlenErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-02 06:58:58,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:58:58,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1108461111, now seen corresponding path program 1 times [2018-12-02 06:58:58,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:58:58,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:58:58,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:58:58,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:58:58,167 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:58:58,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:58:58,214 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:58:58,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 06:58:58,215 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 06:58:58,215 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-12-02 06:58:58,215 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [12], [13], [21], [23], [32], [37], [41], [45], [46], [53], [54], [55], [57] [2018-12-02 06:58:58,216 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 06:58:58,216 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 06:58:58,245 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 06:58:58,245 INFO L272 AbstractInterpreter]: Visited 19 different actions 21 times. Merged at 2 different actions 2 times. Never widened. Performed 145 root evaluator evaluations with a maximum evaluation depth of 4. Performed 145 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 23 variables. [2018-12-02 06:58:58,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:58:58,247 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 06:58:58,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 06:58:58,247 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8983e65f-880c-493d-94c9-aa20284b68b5/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 06:58:58,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:58:58,254 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 06:58:58,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:58:58,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:58:58,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 06:58:58,269 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 06:58:58,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:58:58,272 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 06:58:58,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-12-02 06:58:58,285 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 06:58:58,285 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 06:58:58,287 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:58:58,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:58:58,291 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-12-02 06:58:58,319 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 06:58:58,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-12-02 06:58:58,325 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 06:58:58,328 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 06:58:58,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 06:58:58,333 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2018-12-02 06:58:58,409 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 06:58:58,409 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 06:58:58,559 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 06:58:58,567 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 06:58:58,568 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 06:58:58,569 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:58:58,575 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 06:58:58,576 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:35 [2018-12-02 06:58:58,629 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 06:58:58,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 06:58:58,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 23 [2018-12-02 06:58:58,643 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 06:58:58,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-02 06:58:58,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-02 06:58:58,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2018-12-02 06:58:58,644 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 15 states. [2018-12-02 06:58:59,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:58:59,154 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-12-02 06:58:59,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-02 06:58:59,154 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2018-12-02 06:58:59,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:58:59,155 INFO L225 Difference]: With dead ends: 36 [2018-12-02 06:58:59,155 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 06:58:59,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=288, Invalid=1352, Unknown=0, NotChecked=0, Total=1640 [2018-12-02 06:58:59,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 06:58:59,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 06:58:59,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 06:58:59,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 06:58:59,156 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2018-12-02 06:58:59,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:58:59,156 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 06:58:59,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-02 06:58:59,156 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 06:58:59,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 06:58:59,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 06:58:59 BoogieIcfgContainer [2018-12-02 06:58:59,159 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 06:58:59,159 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 06:58:59,159 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 06:58:59,159 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 06:58:59,159 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:58:57" (3/4) ... [2018-12-02 06:58:59,161 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 06:58:59,165 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 06:58:59,165 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrnlen [2018-12-02 06:58:59,165 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 06:58:59,167 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2018-12-02 06:58:59,167 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-12-02 06:58:59,167 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-02 06:58:59,191 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_8983e65f-880c-493d-94c9-aa20284b68b5/bin-2019/utaipan/witness.graphml [2018-12-02 06:58:59,191 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 06:58:59,191 INFO L168 Benchmark]: Toolchain (without parser) took 2575.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 194.0 MB). Free memory was 953.4 MB in the beginning and 1.1 GB in the end (delta: -119.3 MB). Peak memory consumption was 74.6 MB. Max. memory is 11.5 GB. [2018-12-02 06:58:59,192 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 981.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 06:58:59,192 INFO L168 Benchmark]: CACSL2BoogieTranslator took 282.06 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.8 MB). Free memory was 953.4 MB in the beginning and 1.1 GB in the end (delta: -137.6 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-12-02 06:58:59,192 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.84 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-12-02 06:58:59,193 INFO L168 Benchmark]: Boogie Preprocessor took 15.81 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 06:58:59,193 INFO L168 Benchmark]: RCFGBuilder took 156.27 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2018-12-02 06:58:59,193 INFO L168 Benchmark]: TraceAbstraction took 2069.17 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 90.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -9.5 MB). Peak memory consumption was 80.7 MB. Max. memory is 11.5 GB. [2018-12-02 06:58:59,193 INFO L168 Benchmark]: Witness Printer took 31.79 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.6 MB). Peak memory consumption was 5.6 MB. Max. memory is 11.5 GB. [2018-12-02 06:58:59,195 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 981.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 282.06 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.8 MB). Free memory was 953.4 MB in the beginning and 1.1 GB in the end (delta: -137.6 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.84 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.81 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 156.27 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2069.17 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 90.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -9.5 MB). Peak memory consumption was 80.7 MB. Max. memory is 11.5 GB. * Witness Printer took 31.79 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.6 MB). Peak memory consumption was 5.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 558]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 558]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 31 locations, 5 error locations. SAFE Result, 2.0s OverallTime, 9 OverallIterations, 2 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 200 SDtfs, 141 SDslu, 452 SDs, 0 SdLazy, 319 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 150 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=6, 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, 9 MinimizatonAttempts, 18 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 193 NumberOfCodeBlocks, 193 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 222 ConstructedInterpolants, 5 QuantifiedInterpolants, 19827 SizeOfPredicates, 24 NumberOfNonLiveVariables, 186 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 13 InterpolantComputations, 9 PerfectInterpolantSequences, 10/20 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...