./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cbzero-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_1f10fa71-a466-4642-8c5e-4e5c47d2c528/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1f10fa71-a466-4642-8c5e-4e5c47d2c528/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1f10fa71-a466-4642-8c5e-4e5c47d2c528/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1f10fa71-a466-4642-8c5e-4e5c47d2c528/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cbzero-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_1f10fa71-a466-4642-8c5e-4e5c47d2c528/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1f10fa71-a466-4642-8c5e-4e5c47d2c528/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 aa22a20876a8e4326d678ff2db099090fa4b56ec ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 02:49:39,133 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 02:49:39,134 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 02:49:39,140 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 02:49:39,140 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 02:49:39,141 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 02:49:39,142 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 02:49:39,142 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 02:49:39,143 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 02:49:39,143 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 02:49:39,144 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 02:49:39,144 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 02:49:39,144 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 02:49:39,145 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 02:49:39,145 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 02:49:39,146 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 02:49:39,146 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 02:49:39,147 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 02:49:39,148 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 02:49:39,148 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 02:49:39,149 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 02:49:39,149 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 02:49:39,150 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 02:49:39,151 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 02:49:39,151 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 02:49:39,151 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 02:49:39,151 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 02:49:39,152 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 02:49:39,152 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 02:49:39,153 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 02:49:39,153 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 02:49:39,153 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 02:49:39,153 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 02:49:39,153 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 02:49:39,154 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 02:49:39,154 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 02:49:39,154 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1f10fa71-a466-4642-8c5e-4e5c47d2c528/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-02 02:49:39,161 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 02:49:39,161 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 02:49:39,162 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 02:49:39,162 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 02:49:39,162 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 02:49:39,163 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 02:49:39,163 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 02:49:39,163 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 02:49:39,163 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 02:49:39,163 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 02:49:39,163 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 02:49:39,164 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 02:49:39,164 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 02:49:39,164 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 02:49:39,164 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 02:49:39,165 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 02:49:39,165 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 02:49:39,165 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 02:49:39,165 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 02:49:39,165 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 02:49:39,165 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 02:49:39,165 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-02 02:49:39,166 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-02 02:49:39,166 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-02 02:49:39,166 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 02:49:39,166 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 02:49:39,166 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 02:49:39,166 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 02:49:39,166 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 02:49:39,167 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 02:49:39,167 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 02:49:39,167 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 02:49:39,167 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 02:49:39,167 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 02:49:39,167 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 02:49:39,167 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 02:49:39,167 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_1f10fa71-a466-4642-8c5e-4e5c47d2c528/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 -> aa22a20876a8e4326d678ff2db099090fa4b56ec [2018-12-02 02:49:39,185 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 02:49:39,194 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 02:49:39,196 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 02:49:39,197 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 02:49:39,198 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 02:49:39,198 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1f10fa71-a466-4642-8c5e-4e5c47d2c528/bin-2019/utaipan/../../sv-benchmarks/c/array-memsafety/openbsd_cbzero-alloca_true-valid-memsafety_true-termination.i [2018-12-02 02:49:39,242 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1f10fa71-a466-4642-8c5e-4e5c47d2c528/bin-2019/utaipan/data/5adeba21b/7810506aa19c494c9123686235c9ce9c/FLAG9a3c73924 [2018-12-02 02:49:39,640 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 02:49:39,640 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1f10fa71-a466-4642-8c5e-4e5c47d2c528/sv-benchmarks/c/array-memsafety/openbsd_cbzero-alloca_true-valid-memsafety_true-termination.i [2018-12-02 02:49:39,646 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1f10fa71-a466-4642-8c5e-4e5c47d2c528/bin-2019/utaipan/data/5adeba21b/7810506aa19c494c9123686235c9ce9c/FLAG9a3c73924 [2018-12-02 02:49:39,654 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1f10fa71-a466-4642-8c5e-4e5c47d2c528/bin-2019/utaipan/data/5adeba21b/7810506aa19c494c9123686235c9ce9c [2018-12-02 02:49:39,656 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 02:49:39,657 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 02:49:39,658 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 02:49:39,658 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 02:49:39,660 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 02:49:39,660 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:49:39" (1/1) ... [2018-12-02 02:49:39,662 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f9c013a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:49:39, skipping insertion in model container [2018-12-02 02:49:39,662 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:49:39" (1/1) ... [2018-12-02 02:49:39,666 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 02:49:39,684 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 02:49:39,821 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 02:49:39,827 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 02:49:39,881 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 02:49:39,900 INFO L195 MainTranslator]: Completed translation [2018-12-02 02:49:39,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:49:39 WrapperNode [2018-12-02 02:49:39,900 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 02:49:39,901 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 02:49:39,901 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 02:49:39,901 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 02:49:39,905 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:49:39" (1/1) ... [2018-12-02 02:49:39,913 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:49:39" (1/1) ... [2018-12-02 02:49:39,917 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 02:49:39,918 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 02:49:39,918 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 02:49:39,918 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 02:49:39,923 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:49:39" (1/1) ... [2018-12-02 02:49:39,923 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:49:39" (1/1) ... [2018-12-02 02:49:39,924 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:49:39" (1/1) ... [2018-12-02 02:49:39,925 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:49:39" (1/1) ... [2018-12-02 02:49:39,928 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:49:39" (1/1) ... [2018-12-02 02:49:39,930 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:49:39" (1/1) ... [2018-12-02 02:49:39,931 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:49:39" (1/1) ... [2018-12-02 02:49:39,932 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 02:49:39,932 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 02:49:39,932 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 02:49:39,933 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 02:49:39,933 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:49:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1f10fa71-a466-4642-8c5e-4e5c47d2c528/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 02:49:39,964 INFO L130 BoogieDeclarations]: Found specification of procedure cbzero [2018-12-02 02:49:39,964 INFO L138 BoogieDeclarations]: Found implementation of procedure cbzero [2018-12-02 02:49:39,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 02:49:39,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 02:49:39,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 02:49:39,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 02:49:39,964 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 02:49:39,964 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 02:49:39,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 02:49:39,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 02:49:39,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 02:49:40,083 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 02:49:40,083 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-02 02:49:40,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:49:40 BoogieIcfgContainer [2018-12-02 02:49:40,083 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 02:49:40,084 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 02:49:40,084 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 02:49:40,086 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 02:49:40,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:49:39" (1/3) ... [2018-12-02 02:49:40,087 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c472e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:49:40, skipping insertion in model container [2018-12-02 02:49:40,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:49:39" (2/3) ... [2018-12-02 02:49:40,087 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c472e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:49:40, skipping insertion in model container [2018-12-02 02:49:40,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:49:40" (3/3) ... [2018-12-02 02:49:40,089 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cbzero-alloca_true-valid-memsafety_true-termination.i [2018-12-02 02:49:40,094 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 02:49:40,099 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-02 02:49:40,109 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-02 02:49:40,126 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 02:49:40,126 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-02 02:49:40,126 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 02:49:40,126 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 02:49:40,126 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 02:49:40,127 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 02:49:40,127 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 02:49:40,127 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 02:49:40,136 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-12-02 02:49:40,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 02:49:40,143 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:49:40,145 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:49:40,147 INFO L423 AbstractCegarLoop]: === Iteration 1 === [cbzeroErr0REQUIRES_VIOLATION, cbzeroErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-02 02:49:40,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:49:40,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1063245867, now seen corresponding path program 1 times [2018-12-02 02:49:40,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:49:40,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:49:40,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:49:40,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:49:40,186 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:49:40,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:49:40,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:49:40,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:49:40,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 02:49:40,254 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:49:40,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 02:49:40,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 02:49:40,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 02:49:40,266 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 4 states. [2018-12-02 02:49:40,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:49:40,296 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-12-02 02:49:40,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 02:49:40,297 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-02 02:49:40,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:49:40,302 INFO L225 Difference]: With dead ends: 29 [2018-12-02 02:49:40,302 INFO L226 Difference]: Without dead ends: 25 [2018-12-02 02:49:40,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 02:49:40,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-02 02:49:40,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-12-02 02:49:40,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-02 02:49:40,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2018-12-02 02:49:40,323 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 10 [2018-12-02 02:49:40,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:49:40,324 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-12-02 02:49:40,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 02:49:40,324 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2018-12-02 02:49:40,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 02:49:40,324 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:49:40,324 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:49:40,324 INFO L423 AbstractCegarLoop]: === Iteration 2 === [cbzeroErr0REQUIRES_VIOLATION, cbzeroErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-02 02:49:40,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:49:40,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1063243945, now seen corresponding path program 1 times [2018-12-02 02:49:40,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:49:40,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:49:40,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:49:40,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:49:40,325 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:49:40,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:49:40,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:49:40,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:49:40,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 02:49:40,341 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:49:40,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 02:49:40,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:49:40,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:49:40,342 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 3 states. [2018-12-02 02:49:40,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:49:40,363 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-12-02 02:49:40,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:49:40,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-02 02:49:40,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:49:40,363 INFO L225 Difference]: With dead ends: 24 [2018-12-02 02:49:40,363 INFO L226 Difference]: Without dead ends: 23 [2018-12-02 02:49:40,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:49:40,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-02 02:49:40,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-12-02 02:49:40,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-02 02:49:40,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-12-02 02:49:40,366 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 10 [2018-12-02 02:49:40,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:49:40,366 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-12-02 02:49:40,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 02:49:40,366 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-12-02 02:49:40,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-02 02:49:40,366 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:49:40,366 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:49:40,367 INFO L423 AbstractCegarLoop]: === Iteration 3 === [cbzeroErr0REQUIRES_VIOLATION, cbzeroErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-02 02:49:40,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:49:40,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1544819489, now seen corresponding path program 1 times [2018-12-02 02:49:40,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:49:40,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:49:40,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:49:40,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:49:40,368 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:49:40,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:49:40,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:49:40,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:49:40,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 02:49:40,420 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:49:40,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 02:49:40,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 02:49:40,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 02:49:40,421 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 6 states. [2018-12-02 02:49:40,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:49:40,460 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2018-12-02 02:49:40,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 02:49:40,460 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-12-02 02:49:40,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:49:40,461 INFO L225 Difference]: With dead ends: 21 [2018-12-02 02:49:40,461 INFO L226 Difference]: Without dead ends: 21 [2018-12-02 02:49:40,461 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 02:49:40,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-02 02:49:40,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-02 02:49:40,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-02 02:49:40,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-12-02 02:49:40,464 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 14 [2018-12-02 02:49:40,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:49:40,464 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-12-02 02:49:40,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 02:49:40,465 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-12-02 02:49:40,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-02 02:49:40,465 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:49:40,465 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:49:40,465 INFO L423 AbstractCegarLoop]: === Iteration 4 === [cbzeroErr0REQUIRES_VIOLATION, cbzeroErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-02 02:49:40,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:49:40,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1544819488, now seen corresponding path program 1 times [2018-12-02 02:49:40,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:49:40,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:49:40,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:49:40,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:49:40,467 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:49:40,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:49:40,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:49:40,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:49:40,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 02:49:40,527 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:49:40,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 02:49:40,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 02:49:40,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 02:49:40,528 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 7 states. [2018-12-02 02:49:40,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:49:40,587 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-12-02 02:49:40,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 02:49:40,587 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-12-02 02:49:40,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:49:40,589 INFO L225 Difference]: With dead ends: 27 [2018-12-02 02:49:40,589 INFO L226 Difference]: Without dead ends: 27 [2018-12-02 02:49:40,589 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 02:49:40,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-02 02:49:40,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2018-12-02 02:49:40,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-02 02:49:40,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2018-12-02 02:49:40,592 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 14 [2018-12-02 02:49:40,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:49:40,593 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-12-02 02:49:40,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 02:49:40,593 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-12-02 02:49:40,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-02 02:49:40,593 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:49:40,593 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:49:40,594 INFO L423 AbstractCegarLoop]: === Iteration 5 === [cbzeroErr0REQUIRES_VIOLATION, cbzeroErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-02 02:49:40,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:49:40,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1144409268, now seen corresponding path program 1 times [2018-12-02 02:49:40,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:49:40,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:49:40,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:49:40,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:49:40,595 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:49:40,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:49:40,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:49:40,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:49:40,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 02:49:40,661 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:49:40,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 02:49:40,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 02:49:40,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 02:49:40,661 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 6 states. [2018-12-02 02:49:40,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:49:40,683 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-12-02 02:49:40,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 02:49:40,683 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-12-02 02:49:40,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:49:40,684 INFO L225 Difference]: With dead ends: 31 [2018-12-02 02:49:40,684 INFO L226 Difference]: Without dead ends: 31 [2018-12-02 02:49:40,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 02:49:40,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-02 02:49:40,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2018-12-02 02:49:40,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-02 02:49:40,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-12-02 02:49:40,691 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 17 [2018-12-02 02:49:40,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:49:40,691 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-12-02 02:49:40,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 02:49:40,691 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-12-02 02:49:40,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-02 02:49:40,692 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:49:40,692 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:49:40,692 INFO L423 AbstractCegarLoop]: === Iteration 6 === [cbzeroErr0REQUIRES_VIOLATION, cbzeroErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-02 02:49:40,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:49:40,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1537436278, now seen corresponding path program 1 times [2018-12-02 02:49:40,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:49:40,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:49:40,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:49:40,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:49:40,693 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:49:40,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:49:40,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:49:40,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:49:40,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 02:49:40,725 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:49:40,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 02:49:40,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 02:49:40,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 02:49:40,726 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 4 states. [2018-12-02 02:49:40,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:49:40,750 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-12-02 02:49:40,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 02:49:40,751 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-12-02 02:49:40,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:49:40,751 INFO L225 Difference]: With dead ends: 27 [2018-12-02 02:49:40,751 INFO L226 Difference]: Without dead ends: 21 [2018-12-02 02:49:40,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 02:49:40,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-02 02:49:40,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2018-12-02 02:49:40,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-02 02:49:40,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2018-12-02 02:49:40,753 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 17 [2018-12-02 02:49:40,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:49:40,753 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-12-02 02:49:40,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 02:49:40,753 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-12-02 02:49:40,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-02 02:49:40,754 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:49:40,754 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:49:40,754 INFO L423 AbstractCegarLoop]: === Iteration 7 === [cbzeroErr0REQUIRES_VIOLATION, cbzeroErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-02 02:49:40,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:49:40,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1068064744, now seen corresponding path program 1 times [2018-12-02 02:49:40,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:49:40,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:49:40,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:49:40,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:49:40,755 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:49:40,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:49:40,807 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 02:49:40,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:49:40,808 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 02:49:40,808 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-02 02:49:40,810 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [9], [14], [15], [17], [18], [24], [27], [33], [40], [45], [46], [47], [49] [2018-12-02 02:49:40,832 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 02:49:40,832 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 02:49:40,945 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 02:49:40,946 INFO L272 AbstractInterpreter]: Visited 16 different actions 18 times. Merged at 2 different actions 2 times. Never widened. Performed 141 root evaluator evaluations with a maximum evaluation depth of 4. Performed 141 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 21 variables. [2018-12-02 02:49:40,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:49:40,952 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 02:49:40,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:49:40,953 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1f10fa71-a466-4642-8c5e-4e5c47d2c528/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 02:49:40,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:49:40,960 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 02:49:40,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:49:40,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:49:41,004 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 02:49:41,005 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 02:49:41,056 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 02:49:41,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 02:49:41,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-02 02:49:41,070 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 02:49:41,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 02:49:41,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 02:49:41,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-12-02 02:49:41,071 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 8 states. [2018-12-02 02:49:41,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:49:41,113 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-12-02 02:49:41,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 02:49:41,113 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-12-02 02:49:41,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:49:41,113 INFO L225 Difference]: With dead ends: 28 [2018-12-02 02:49:41,114 INFO L226 Difference]: Without dead ends: 19 [2018-12-02 02:49:41,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2018-12-02 02:49:41,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-02 02:49:41,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-02 02:49:41,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-02 02:49:41,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-12-02 02:49:41,116 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 18 [2018-12-02 02:49:41,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:49:41,116 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-12-02 02:49:41,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 02:49:41,116 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-12-02 02:49:41,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-02 02:49:41,116 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:49:41,117 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:49:41,117 INFO L423 AbstractCegarLoop]: === Iteration 8 === [cbzeroErr0REQUIRES_VIOLATION, cbzeroErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-02 02:49:41,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:49:41,117 INFO L82 PathProgramCache]: Analyzing trace with hash -367000166, now seen corresponding path program 1 times [2018-12-02 02:49:41,117 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:49:41,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:49:41,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:49:41,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:49:41,118 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:49:41,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:49:41,189 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 02:49:41,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:49:41,189 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 02:49:41,189 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-02 02:49:41,190 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [9], [14], [15], [17], [18], [24], [27], [35], [40], [45], [46], [47], [49] [2018-12-02 02:49:41,191 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 02:49:41,191 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 02:49:41,226 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 02:49:41,226 INFO L272 AbstractInterpreter]: Visited 16 different actions 21 times. Merged at 5 different actions 5 times. Never widened. Performed 164 root evaluator evaluations with a maximum evaluation depth of 4. Performed 164 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 21 variables. [2018-12-02 02:49:41,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:49:41,231 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 02:49:41,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:49:41,231 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1f10fa71-a466-4642-8c5e-4e5c47d2c528/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 02:49:41,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:49:41,237 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 02:49:41,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:49:41,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:49:41,270 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 02:49:41,270 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 02:49:41,355 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 02:49:41,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 02:49:41,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2018-12-02 02:49:41,371 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 02:49:41,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 02:49:41,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 02:49:41,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2018-12-02 02:49:41,372 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 10 states. [2018-12-02 02:49:41,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:49:41,424 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-12-02 02:49:41,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 02:49:41,425 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-12-02 02:49:41,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:49:41,425 INFO L225 Difference]: With dead ends: 29 [2018-12-02 02:49:41,425 INFO L226 Difference]: Without dead ends: 19 [2018-12-02 02:49:41,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2018-12-02 02:49:41,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-02 02:49:41,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-02 02:49:41,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-02 02:49:41,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-12-02 02:49:41,427 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 18 [2018-12-02 02:49:41,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:49:41,427 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-12-02 02:49:41,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 02:49:41,427 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-12-02 02:49:41,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-02 02:49:41,427 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:49:41,427 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:49:41,427 INFO L423 AbstractCegarLoop]: === Iteration 9 === [cbzeroErr0REQUIRES_VIOLATION, cbzeroErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-02 02:49:41,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:49:41,428 INFO L82 PathProgramCache]: Analyzing trace with hash -108834728, now seen corresponding path program 1 times [2018-12-02 02:49:41,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:49:41,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:49:41,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:49:41,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:49:41,428 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:49:41,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:49:41,550 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 02:49:41,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:49:41,550 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 02:49:41,550 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-02 02:49:41,550 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [9], [14], [15], [17], [18], [24], [29], [35], [40], [45], [46], [47], [49] [2018-12-02 02:49:41,551 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 02:49:41,551 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 02:49:41,571 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 02:49:41,571 INFO L272 AbstractInterpreter]: Visited 16 different actions 21 times. Merged at 5 different actions 5 times. Never widened. Performed 162 root evaluator evaluations with a maximum evaluation depth of 4. Performed 162 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 21 variables. [2018-12-02 02:49:41,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:49:41,572 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 02:49:41,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:49:41,572 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1f10fa71-a466-4642-8c5e-4e5c47d2c528/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 02:49:41,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:49:41,578 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 02:49:41,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:49:41,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:49:41,601 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 02:49:41,602 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 02:49:41,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:49:41,612 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:12 [2018-12-02 02:49:41,718 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 02:49:41,718 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 02:49:41,894 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 02:49:41,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 02:49:41,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2018-12-02 02:49:41,908 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 02:49:41,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-02 02:49:41,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-02 02:49:41,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=664, Unknown=0, NotChecked=0, Total=756 [2018-12-02 02:49:41,909 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 19 states. [2018-12-02 02:49:42,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:49:42,077 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-12-02 02:49:42,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 02:49:42,077 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2018-12-02 02:49:42,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:49:42,078 INFO L225 Difference]: With dead ends: 24 [2018-12-02 02:49:42,078 INFO L226 Difference]: Without dead ends: 24 [2018-12-02 02:49:42,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=971, Unknown=0, NotChecked=0, Total=1122 [2018-12-02 02:49:42,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-02 02:49:42,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-12-02 02:49:42,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-02 02:49:42,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-12-02 02:49:42,079 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 18 [2018-12-02 02:49:42,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:49:42,080 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-12-02 02:49:42,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-02 02:49:42,080 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-12-02 02:49:42,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 02:49:42,080 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:49:42,080 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:49:42,080 INFO L423 AbstractCegarLoop]: === Iteration 10 === [cbzeroErr0REQUIRES_VIOLATION, cbzeroErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-02 02:49:42,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:49:42,080 INFO L82 PathProgramCache]: Analyzing trace with hash -333478000, now seen corresponding path program 2 times [2018-12-02 02:49:42,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:49:42,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:49:42,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:49:42,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:49:42,081 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:49:42,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:49:42,256 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:49:42,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:49:42,256 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 02:49:42,256 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 02:49:42,257 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 02:49:42,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:49:42,257 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1f10fa71-a466-4642-8c5e-4e5c47d2c528/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 02:49:42,262 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 02:49:42,263 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 02:49:42,276 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-02 02:49:42,276 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 02:49:42,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:49:42,283 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 02:49:42,283 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 02:49:42,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:49:42,293 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:12 [2018-12-02 02:49:42,493 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:49:42,493 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 02:49:42,875 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:49:42,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 02:49:42,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 34 [2018-12-02 02:49:42,890 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 02:49:42,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-02 02:49:42,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-02 02:49:42,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1062, Unknown=0, NotChecked=0, Total=1190 [2018-12-02 02:49:42,891 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 24 states. [2018-12-02 02:49:43,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:49:43,489 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-12-02 02:49:43,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-02 02:49:43,489 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 22 [2018-12-02 02:49:43,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:49:43,490 INFO L225 Difference]: With dead ends: 27 [2018-12-02 02:49:43,490 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 02:49:43,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=273, Invalid=1889, Unknown=0, NotChecked=0, Total=2162 [2018-12-02 02:49:43,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 02:49:43,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 02:49:43,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 02:49:43,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 02:49:43,491 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2018-12-02 02:49:43,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:49:43,491 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 02:49:43,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-02 02:49:43,492 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 02:49:43,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 02:49:43,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 02:49:43 BoogieIcfgContainer [2018-12-02 02:49:43,495 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 02:49:43,495 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 02:49:43,495 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 02:49:43,495 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 02:49:43,496 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:49:40" (3/4) ... [2018-12-02 02:49:43,497 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 02:49:43,501 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 02:49:43,501 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cbzero [2018-12-02 02:49:43,501 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 02:49:43,503 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2018-12-02 02:49:43,503 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-02 02:49:43,504 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-02 02:49:43,528 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_1f10fa71-a466-4642-8c5e-4e5c47d2c528/bin-2019/utaipan/witness.graphml [2018-12-02 02:49:43,528 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 02:49:43,529 INFO L168 Benchmark]: Toolchain (without parser) took 3872.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 948.1 MB in the beginning and 979.7 MB in the end (delta: -31.7 MB). Peak memory consumption was 110.4 MB. Max. memory is 11.5 GB. [2018-12-02 02:49:43,529 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 02:49:43,530 INFO L168 Benchmark]: CACSL2BoogieTranslator took 242.78 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.6 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -141.0 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-12-02 02:49:43,530 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.87 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 02:49:43,530 INFO L168 Benchmark]: Boogie Preprocessor took 14.57 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 02:49:43,530 INFO L168 Benchmark]: RCFGBuilder took 150.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: 17.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 11.5 GB. [2018-12-02 02:49:43,531 INFO L168 Benchmark]: TraceAbstraction took 3411.39 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 42.5 MB). Free memory was 1.1 GB in the beginning and 984.5 MB in the end (delta: 84.7 MB). Peak memory consumption was 127.2 MB. Max. memory is 11.5 GB. [2018-12-02 02:49:43,531 INFO L168 Benchmark]: Witness Printer took 33.04 ms. Allocated memory is still 1.2 GB. Free memory was 984.5 MB in the beginning and 979.7 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 11.5 GB. [2018-12-02 02:49:43,532 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 242.78 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.6 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -141.0 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 16.87 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.57 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 150.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: 17.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3411.39 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 42.5 MB). Free memory was 1.1 GB in the beginning and 984.5 MB in the end (delta: 84.7 MB). Peak memory consumption was 127.2 MB. Max. memory is 11.5 GB. * Witness Printer took 33.04 ms. Allocated memory is still 1.2 GB. Free memory was 984.5 MB in the beginning and 979.7 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 25 locations, 3 error locations. SAFE Result, 3.3s OverallTime, 10 OverallIterations, 3 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 174 SDtfs, 117 SDslu, 679 SDs, 0 SdLazy, 511 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 245 GetRequests, 110 SyntacticMatches, 2 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 620 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 3 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 12 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 234 NumberOfCodeBlocks, 234 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 292 ConstructedInterpolants, 2 QuantifiedInterpolants, 35558 SizeOfPredicates, 36 NumberOfNonLiveVariables, 425 ConjunctsInSsa, 118 ConjunctsInUnsatCore, 18 InterpolantComputations, 6 PerfectInterpolantSequences, 6/57 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...