./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/strreplace-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_6c49455f-a899-4e3a-9590-c21c0c02e4f7/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6c49455f-a899-4e3a-9590-c21c0c02e4f7/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6c49455f-a899-4e3a-9590-c21c0c02e4f7/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6c49455f-a899-4e3a-9590-c21c0c02e4f7/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/strreplace-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_6c49455f-a899-4e3a-9590-c21c0c02e4f7/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6c49455f-a899-4e3a-9590-c21c0c02e4f7/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 04214bcb8e1f50bae63b15c1fa309fb3edc667ba ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 16:23:41,412 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 16:23:41,413 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 16:23:41,419 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 16:23:41,419 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 16:23:41,420 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 16:23:41,420 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 16:23:41,421 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 16:23:41,422 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 16:23:41,423 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 16:23:41,423 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 16:23:41,423 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 16:23:41,424 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 16:23:41,425 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 16:23:41,425 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 16:23:41,426 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 16:23:41,426 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 16:23:41,427 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 16:23:41,428 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 16:23:41,429 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 16:23:41,429 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 16:23:41,430 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 16:23:41,431 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 16:23:41,431 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 16:23:41,431 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 16:23:41,432 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 16:23:41,432 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 16:23:41,433 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 16:23:41,433 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 16:23:41,433 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 16:23:41,434 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 16:23:41,434 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 16:23:41,434 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 16:23:41,434 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 16:23:41,435 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 16:23:41,435 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 16:23:41,435 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6c49455f-a899-4e3a-9590-c21c0c02e4f7/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-09 16:23:41,443 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 16:23:41,443 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 16:23:41,444 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 16:23:41,444 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 16:23:41,444 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 16:23:41,444 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 16:23:41,444 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 16:23:41,444 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 16:23:41,444 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 16:23:41,444 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 16:23:41,444 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 16:23:41,445 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 16:23:41,445 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 16:23:41,445 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 16:23:41,445 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 16:23:41,445 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 16:23:41,445 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 16:23:41,445 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 16:23:41,446 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 16:23:41,446 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 16:23:41,446 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 16:23:41,446 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 16:23:41,446 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 16:23:41,446 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 16:23:41,446 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 16:23:41,446 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 16:23:41,446 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 16:23:41,446 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 16:23:41,446 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 16:23:41,446 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 16:23:41,447 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 16:23:41,447 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 16:23:41,447 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 16:23:41,447 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 16:23:41,447 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 16:23:41,447 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 16:23:41,447 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_6c49455f-a899-4e3a-9590-c21c0c02e4f7/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 -> 04214bcb8e1f50bae63b15c1fa309fb3edc667ba [2018-12-09 16:23:41,465 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 16:23:41,473 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 16:23:41,475 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 16:23:41,476 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 16:23:41,476 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 16:23:41,476 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6c49455f-a899-4e3a-9590-c21c0c02e4f7/bin-2019/utaipan/../../sv-benchmarks/c/array-memsafety/strreplace-alloca_true-valid-memsafety_true-termination.i [2018-12-09 16:23:41,513 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6c49455f-a899-4e3a-9590-c21c0c02e4f7/bin-2019/utaipan/data/e36cf7a94/8ed2f5561492443cb61c0102d0f00f4e/FLAG4d8091087 [2018-12-09 16:23:41,913 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 16:23:41,913 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6c49455f-a899-4e3a-9590-c21c0c02e4f7/sv-benchmarks/c/array-memsafety/strreplace-alloca_true-valid-memsafety_true-termination.i [2018-12-09 16:23:41,919 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6c49455f-a899-4e3a-9590-c21c0c02e4f7/bin-2019/utaipan/data/e36cf7a94/8ed2f5561492443cb61c0102d0f00f4e/FLAG4d8091087 [2018-12-09 16:23:41,926 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6c49455f-a899-4e3a-9590-c21c0c02e4f7/bin-2019/utaipan/data/e36cf7a94/8ed2f5561492443cb61c0102d0f00f4e [2018-12-09 16:23:41,928 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 16:23:41,929 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 16:23:41,929 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 16:23:41,930 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 16:23:41,931 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 16:23:41,932 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:23:41" (1/1) ... [2018-12-09 16:23:41,933 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c091ba1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:23:41, skipping insertion in model container [2018-12-09 16:23:41,934 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:23:41" (1/1) ... [2018-12-09 16:23:41,939 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 16:23:41,961 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 16:23:42,109 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 16:23:42,116 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 16:23:42,177 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 16:23:42,196 INFO L195 MainTranslator]: Completed translation [2018-12-09 16:23:42,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:23:42 WrapperNode [2018-12-09 16:23:42,197 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 16:23:42,197 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 16:23:42,197 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 16:23:42,197 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 16:23:42,202 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:23:42" (1/1) ... [2018-12-09 16:23:42,210 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:23:42" (1/1) ... [2018-12-09 16:23:42,214 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 16:23:42,215 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 16:23:42,215 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 16:23:42,215 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 16:23:42,220 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:23:42" (1/1) ... [2018-12-09 16:23:42,220 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:23:42" (1/1) ... [2018-12-09 16:23:42,221 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:23:42" (1/1) ... [2018-12-09 16:23:42,222 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:23:42" (1/1) ... [2018-12-09 16:23:42,225 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:23:42" (1/1) ... [2018-12-09 16:23:42,228 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:23:42" (1/1) ... [2018-12-09 16:23:42,229 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:23:42" (1/1) ... [2018-12-09 16:23:42,230 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 16:23:42,230 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 16:23:42,230 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 16:23:42,230 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 16:23:42,231 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:23:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c49455f-a899-4e3a-9590-c21c0c02e4f7/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 16:23:42,261 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 16:23:42,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 16:23:42,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 16:23:42,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 16:23:42,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 16:23:42,262 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 16:23:42,262 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 16:23:42,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 16:23:42,262 INFO L130 BoogieDeclarations]: Found specification of procedure cstrreplace [2018-12-09 16:23:42,262 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrreplace [2018-12-09 16:23:42,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 16:23:42,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 16:23:42,390 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 16:23:42,390 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-09 16:23:42,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:23:42 BoogieIcfgContainer [2018-12-09 16:23:42,391 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 16:23:42,391 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 16:23:42,391 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 16:23:42,393 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 16:23:42,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 04:23:41" (1/3) ... [2018-12-09 16:23:42,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53b01055 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:23:42, skipping insertion in model container [2018-12-09 16:23:42,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:23:42" (2/3) ... [2018-12-09 16:23:42,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53b01055 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:23:42, skipping insertion in model container [2018-12-09 16:23:42,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:23:42" (3/3) ... [2018-12-09 16:23:42,395 INFO L112 eAbstractionObserver]: Analyzing ICFG strreplace-alloca_true-valid-memsafety_true-termination.i [2018-12-09 16:23:42,401 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 16:23:42,405 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-12-09 16:23:42,415 INFO L257 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2018-12-09 16:23:42,430 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 16:23:42,430 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 16:23:42,430 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 16:23:42,430 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 16:23:42,431 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 16:23:42,431 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 16:23:42,431 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 16:23:42,431 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 16:23:42,441 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-12-09 16:23:42,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-09 16:23:42,446 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:23:42,446 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:23:42,448 INFO L423 AbstractCegarLoop]: === Iteration 1 === [cstrreplaceErr2REQUIRES_VIOLATION, cstrreplaceErr1REQUIRES_VIOLATION, cstrreplaceErr0REQUIRES_VIOLATION, cstrreplaceErr5REQUIRES_VIOLATION, cstrreplaceErr4REQUIRES_VIOLATION, cstrreplaceErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 16:23:42,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:23:42,451 INFO L82 PathProgramCache]: Analyzing trace with hash 983094075, now seen corresponding path program 1 times [2018-12-09 16:23:42,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:23:42,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:23:42,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:23:42,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:23:42,482 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:23:42,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:23:42,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:23:42,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:23:42,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 16:23:42,545 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:23:42,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 16:23:42,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 16:23:42,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 16:23:42,558 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 3 states. [2018-12-09 16:23:42,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:23:42,591 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-12-09 16:23:42,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 16:23:42,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-12-09 16:23:42,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:23:42,597 INFO L225 Difference]: With dead ends: 35 [2018-12-09 16:23:42,597 INFO L226 Difference]: Without dead ends: 32 [2018-12-09 16:23:42,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 16:23:42,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-09 16:23:42,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-09 16:23:42,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-09 16:23:42,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-12-09 16:23:42,618 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 9 [2018-12-09 16:23:42,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:23:42,619 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-12-09 16:23:42,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 16:23:42,619 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-12-09 16:23:42,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-09 16:23:42,619 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:23:42,619 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:23:42,619 INFO L423 AbstractCegarLoop]: === Iteration 2 === [cstrreplaceErr2REQUIRES_VIOLATION, cstrreplaceErr1REQUIRES_VIOLATION, cstrreplaceErr0REQUIRES_VIOLATION, cstrreplaceErr5REQUIRES_VIOLATION, cstrreplaceErr4REQUIRES_VIOLATION, cstrreplaceErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 16:23:42,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:23:42,620 INFO L82 PathProgramCache]: Analyzing trace with hash 983094076, now seen corresponding path program 1 times [2018-12-09 16:23:42,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:23:42,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:23:42,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:23:42,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:23:42,621 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:23:42,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:23:42,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:23:42,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:23:42,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 16:23:42,664 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:23:42,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 16:23:42,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 16:23:42,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 16:23:42,666 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 4 states. [2018-12-09 16:23:42,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:23:42,689 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2018-12-09 16:23:42,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 16:23:42,690 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-12-09 16:23:42,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:23:42,690 INFO L225 Difference]: With dead ends: 31 [2018-12-09 16:23:42,690 INFO L226 Difference]: Without dead ends: 31 [2018-12-09 16:23:42,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 16:23:42,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-09 16:23:42,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-09 16:23:42,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-09 16:23:42,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-12-09 16:23:42,694 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 9 [2018-12-09 16:23:42,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:23:42,695 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-12-09 16:23:42,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 16:23:42,695 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-12-09 16:23:42,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-09 16:23:42,695 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:23:42,695 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:23:42,696 INFO L423 AbstractCegarLoop]: === Iteration 3 === [cstrreplaceErr2REQUIRES_VIOLATION, cstrreplaceErr1REQUIRES_VIOLATION, cstrreplaceErr0REQUIRES_VIOLATION, cstrreplaceErr5REQUIRES_VIOLATION, cstrreplaceErr4REQUIRES_VIOLATION, cstrreplaceErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 16:23:42,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:23:42,696 INFO L82 PathProgramCache]: Analyzing trace with hash -817934775, now seen corresponding path program 1 times [2018-12-09 16:23:42,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:23:42,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:23:42,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:23:42,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:23:42,697 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:23:42,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:23:42,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:23:42,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:23:42,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 16:23:42,740 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:23:42,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 16:23:42,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 16:23:42,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 16:23:42,740 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 5 states. [2018-12-09 16:23:42,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:23:42,783 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2018-12-09 16:23:42,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 16:23:42,784 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-12-09 16:23:42,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:23:42,784 INFO L225 Difference]: With dead ends: 28 [2018-12-09 16:23:42,784 INFO L226 Difference]: Without dead ends: 28 [2018-12-09 16:23:42,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 16:23:42,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-09 16:23:42,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-09 16:23:42,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-09 16:23:42,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-12-09 16:23:42,786 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 13 [2018-12-09 16:23:42,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:23:42,787 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-12-09 16:23:42,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 16:23:42,787 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-12-09 16:23:42,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-09 16:23:42,787 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:23:42,787 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:23:42,787 INFO L423 AbstractCegarLoop]: === Iteration 4 === [cstrreplaceErr2REQUIRES_VIOLATION, cstrreplaceErr1REQUIRES_VIOLATION, cstrreplaceErr0REQUIRES_VIOLATION, cstrreplaceErr5REQUIRES_VIOLATION, cstrreplaceErr4REQUIRES_VIOLATION, cstrreplaceErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 16:23:42,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:23:42,787 INFO L82 PathProgramCache]: Analyzing trace with hash -817934774, now seen corresponding path program 1 times [2018-12-09 16:23:42,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:23:42,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:23:42,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:23:42,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:23:42,788 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:23:42,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:23:42,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:23:42,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:23:42,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 16:23:42,836 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:23:42,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 16:23:42,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 16:23:42,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 16:23:42,836 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 7 states. [2018-12-09 16:23:42,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:23:42,882 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2018-12-09 16:23:42,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 16:23:42,883 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-12-09 16:23:42,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:23:42,884 INFO L225 Difference]: With dead ends: 38 [2018-12-09 16:23:42,884 INFO L226 Difference]: Without dead ends: 38 [2018-12-09 16:23:42,885 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-09 16:23:42,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-09 16:23:42,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 33. [2018-12-09 16:23:42,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-09 16:23:42,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-12-09 16:23:42,887 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 13 [2018-12-09 16:23:42,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:23:42,888 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-12-09 16:23:42,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 16:23:42,888 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-12-09 16:23:42,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 16:23:42,888 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:23:42,888 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:23:42,888 INFO L423 AbstractCegarLoop]: === Iteration 5 === [cstrreplaceErr2REQUIRES_VIOLATION, cstrreplaceErr1REQUIRES_VIOLATION, cstrreplaceErr0REQUIRES_VIOLATION, cstrreplaceErr5REQUIRES_VIOLATION, cstrreplaceErr4REQUIRES_VIOLATION, cstrreplaceErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 16:23:42,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:23:42,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1976229470, now seen corresponding path program 1 times [2018-12-09 16:23:42,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:23:42,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:23:42,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:23:42,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:23:42,889 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:23:42,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:23:42,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:23:42,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:23:42,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 16:23:42,965 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:23:42,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 16:23:42,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 16:23:42,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 16:23:42,966 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 8 states. [2018-12-09 16:23:43,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:23:43,019 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2018-12-09 16:23:43,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 16:23:43,020 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-12-09 16:23:43,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:23:43,020 INFO L225 Difference]: With dead ends: 46 [2018-12-09 16:23:43,020 INFO L226 Difference]: Without dead ends: 46 [2018-12-09 16:23:43,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-12-09 16:23:43,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-09 16:23:43,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2018-12-09 16:23:43,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-09 16:23:43,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-12-09 16:23:43,025 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 18 [2018-12-09 16:23:43,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:23:43,025 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-12-09 16:23:43,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 16:23:43,026 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-12-09 16:23:43,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 16:23:43,026 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:23:43,026 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:23:43,027 INFO L423 AbstractCegarLoop]: === Iteration 6 === [cstrreplaceErr2REQUIRES_VIOLATION, cstrreplaceErr1REQUIRES_VIOLATION, cstrreplaceErr0REQUIRES_VIOLATION, cstrreplaceErr5REQUIRES_VIOLATION, cstrreplaceErr4REQUIRES_VIOLATION, cstrreplaceErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 16:23:43,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:23:43,027 INFO L82 PathProgramCache]: Analyzing trace with hash -2060572388, now seen corresponding path program 1 times [2018-12-09 16:23:43,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:23:43,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:23:43,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:23:43,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:23:43,028 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:23:43,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:23:43,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:23:43,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:23:43,167 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:23:43,167 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-09 16:23:43,168 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [7], [9], [14], [15], [26], [28], [37], [42], [44], [45], [48], [53], [54], [55], [57] [2018-12-09 16:23:43,192 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 16:23:43,192 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 16:23:43,284 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 16:23:43,285 INFO L272 AbstractInterpreter]: Visited 18 different actions 18 times. Never merged. Never widened. Performed 124 root evaluator evaluations with a maximum evaluation depth of 3. Performed 124 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 25 variables. [2018-12-09 16:23:43,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:23:43,294 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 16:23:43,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:23:43,294 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c49455f-a899-4e3a-9590-c21c0c02e4f7/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 16:23:43,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:23:43,300 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 16:23:43,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:23:43,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:23:43,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-09 16:23:43,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-09 16:23:43,353 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:23:43,355 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:23:43,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 16:23:43,360 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-12-09 16:23:43,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-12-09 16:23:43,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-12-09 16:23:43,421 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 16:23:43,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 16:23:43,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 16:23:43,436 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-12-09 16:23:43,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:23:43,496 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:23:43,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-12-09 16:23:43,619 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:23:43,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-12-09 16:23:43,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-12-09 16:23:43,634 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 16:23:43,635 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:23:43,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:23:43,640 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-12-09 16:23:43,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:23:43,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 16:23:43,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2018-12-09 16:23:43,659 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 16:23:43,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-09 16:23:43,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-09 16:23:43,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2018-12-09 16:23:43,661 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 15 states. [2018-12-09 16:23:44,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:23:44,855 INFO L93 Difference]: Finished difference Result 95 states and 106 transitions. [2018-12-09 16:23:44,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 16:23:44,855 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2018-12-09 16:23:44,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:23:44,856 INFO L225 Difference]: With dead ends: 95 [2018-12-09 16:23:44,856 INFO L226 Difference]: Without dead ends: 95 [2018-12-09 16:23:44,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=155, Invalid=715, Unknown=0, NotChecked=0, Total=870 [2018-12-09 16:23:44,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-09 16:23:44,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 50. [2018-12-09 16:23:44,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-09 16:23:44,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-12-09 16:23:44,861 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 18 [2018-12-09 16:23:44,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:23:44,861 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-12-09 16:23:44,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-09 16:23:44,861 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-12-09 16:23:44,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-09 16:23:44,861 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:23:44,861 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:23:44,862 INFO L423 AbstractCegarLoop]: === Iteration 7 === [cstrreplaceErr2REQUIRES_VIOLATION, cstrreplaceErr1REQUIRES_VIOLATION, cstrreplaceErr0REQUIRES_VIOLATION, cstrreplaceErr5REQUIRES_VIOLATION, cstrreplaceErr4REQUIRES_VIOLATION, cstrreplaceErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 16:23:44,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:23:44,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1092251671, now seen corresponding path program 1 times [2018-12-09 16:23:44,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:23:44,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:23:44,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:23:44,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:23:44,863 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:23:44,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:23:44,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:23:44,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:23:44,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 16:23:44,894 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:23:44,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 16:23:44,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 16:23:44,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 16:23:44,895 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 4 states. [2018-12-09 16:23:44,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:23:44,921 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2018-12-09 16:23:44,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 16:23:44,921 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-12-09 16:23:44,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:23:44,922 INFO L225 Difference]: With dead ends: 49 [2018-12-09 16:23:44,922 INFO L226 Difference]: Without dead ends: 34 [2018-12-09 16:23:44,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 16:23:44,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-09 16:23:44,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-09 16:23:44,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-09 16:23:44,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-12-09 16:23:44,924 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 19 [2018-12-09 16:23:44,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:23:44,924 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2018-12-09 16:23:44,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 16:23:44,924 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-12-09 16:23:44,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 16:23:44,924 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:23:44,925 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:23:44,925 INFO L423 AbstractCegarLoop]: === Iteration 8 === [cstrreplaceErr2REQUIRES_VIOLATION, cstrreplaceErr1REQUIRES_VIOLATION, cstrreplaceErr0REQUIRES_VIOLATION, cstrreplaceErr5REQUIRES_VIOLATION, cstrreplaceErr4REQUIRES_VIOLATION, cstrreplaceErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 16:23:44,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:23:44,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1418856756, now seen corresponding path program 2 times [2018-12-09 16:23:44,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:23:44,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:23:44,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:23:44,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:23:44,926 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:23:44,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:23:45,116 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:23:45,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:23:45,117 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:23:45,117 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 16:23:45,117 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 16:23:45,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:23:45,117 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c49455f-a899-4e3a-9590-c21c0c02e4f7/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 16:23:45,123 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 16:23:45,123 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 16:23:45,141 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-09 16:23:45,141 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 16:23:45,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:23:45,145 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-09 16:23:45,145 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:23:45,148 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:23:45,148 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 16:23:45,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-12-09 16:23:45,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 16:23:45,158 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:23:45,159 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:23:45,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:23:45,160 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-12-09 16:23:45,211 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-09 16:23:45,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-09 16:23:45,213 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:23:45,214 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:23:45,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:23:45,218 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:19 [2018-12-09 16:23:45,268 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 16:23:45,268 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:23:45,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-12-09 16:23:45,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-12-09 16:23:45,413 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:23:45,415 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:23:45,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 16:23:45,423 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:35 [2018-12-09 16:23:45,458 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 16:23:45,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 16:23:45,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2018-12-09 16:23:45,473 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 16:23:45,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-09 16:23:45,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-09 16:23:45,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2018-12-09 16:23:45,474 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 17 states. [2018-12-09 16:23:45,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:23:45,938 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2018-12-09 16:23:45,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-09 16:23:45,939 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 23 [2018-12-09 16:23:45,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:23:45,939 INFO L225 Difference]: With dead ends: 36 [2018-12-09 16:23:45,939 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 16:23:45,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=290, Invalid=1270, Unknown=0, NotChecked=0, Total=1560 [2018-12-09 16:23:45,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 16:23:45,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 16:23:45,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 16:23:45,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 16:23:45,940 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2018-12-09 16:23:45,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:23:45,940 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 16:23:45,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-09 16:23:45,940 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 16:23:45,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 16:23:45,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 04:23:45 BoogieIcfgContainer [2018-12-09 16:23:45,944 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 16:23:45,944 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 16:23:45,944 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 16:23:45,944 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 16:23:45,944 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:23:42" (3/4) ... [2018-12-09 16:23:45,947 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 16:23:45,950 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 16:23:45,951 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrreplace [2018-12-09 16:23:45,951 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 16:23:45,953 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2018-12-09 16:23:45,954 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-12-09 16:23:45,954 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-09 16:23:45,980 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_6c49455f-a899-4e3a-9590-c21c0c02e4f7/bin-2019/utaipan/witness.graphml [2018-12-09 16:23:45,980 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 16:23:45,981 INFO L168 Benchmark]: Toolchain (without parser) took 4052.31 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 224.4 MB). Free memory was 953.5 MB in the beginning and 974.4 MB in the end (delta: -20.9 MB). Peak memory consumption was 203.5 MB. Max. memory is 11.5 GB. [2018-12-09 16:23:45,982 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 16:23:45,982 INFO L168 Benchmark]: CACSL2BoogieTranslator took 267.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -168.1 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. [2018-12-09 16:23:45,982 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.34 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 16:23:45,983 INFO L168 Benchmark]: Boogie Preprocessor took 15.40 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 16:23:45,983 INFO L168 Benchmark]: RCFGBuilder took 160.48 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: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2018-12-09 16:23:45,983 INFO L168 Benchmark]: TraceAbstraction took 3552.68 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 86.5 MB). Free memory was 1.1 GB in the beginning and 982.7 MB in the end (delta: 113.0 MB). Peak memory consumption was 199.5 MB. Max. memory is 11.5 GB. [2018-12-09 16:23:45,983 INFO L168 Benchmark]: Witness Printer took 36.34 ms. Allocated memory is still 1.3 GB. Free memory was 982.7 MB in the beginning and 974.4 MB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. [2018-12-09 16:23:45,985 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 267.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -168.1 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.34 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.40 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 160.48 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: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3552.68 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 86.5 MB). Free memory was 1.1 GB in the beginning and 982.7 MB in the end (delta: 113.0 MB). Peak memory consumption was 199.5 MB. Max. memory is 11.5 GB. * Witness Printer took 36.34 ms. Allocated memory is still 1.3 GB. Free memory was 982.7 MB in the beginning and 974.4 MB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 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: 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: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: 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: 559]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 553]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 559]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 36 locations, 9 error locations. SAFE Result, 3.5s OverallTime, 8 OverallIterations, 2 TraceHistogramMax, 1.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 192 SDtfs, 298 SDslu, 623 SDs, 0 SdLazy, 537 SolverSat, 102 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 157 GetRequests, 63 SyntacticMatches, 4 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred 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, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 53 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 163 NumberOfCodeBlocks, 163 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 192 ConstructedInterpolants, 16 QuantifiedInterpolants, 30159 SizeOfPredicates, 25 NumberOfNonLiveVariables, 208 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 5/25 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...