./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/rec_strlen-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_f8501f8f-912e-4a16-83f0-f39ff4d22afe/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f8501f8f-912e-4a16-83f0-f39ff4d22afe/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f8501f8f-912e-4a16-83f0-f39ff4d22afe/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f8501f8f-912e-4a16-83f0-f39ff4d22afe/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/rec_strlen-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_f8501f8f-912e-4a16-83f0-f39ff4d22afe/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f8501f8f-912e-4a16-83f0-f39ff4d22afe/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 1f736ad3d73bcf44f292b11858e0429161a038cf .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 00:54:29,742 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 00:54:29,743 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 00:54:29,749 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 00:54:29,749 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 00:54:29,750 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 00:54:29,750 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 00:54:29,751 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 00:54:29,752 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 00:54:29,752 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 00:54:29,753 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 00:54:29,753 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 00:54:29,753 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 00:54:29,754 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 00:54:29,754 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 00:54:29,755 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 00:54:29,755 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 00:54:29,756 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 00:54:29,757 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 00:54:29,758 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 00:54:29,758 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 00:54:29,759 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 00:54:29,760 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 00:54:29,760 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 00:54:29,760 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 00:54:29,761 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 00:54:29,761 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 00:54:29,761 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 00:54:29,762 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 00:54:29,762 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 00:54:29,762 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 00:54:29,763 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 00:54:29,763 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 00:54:29,763 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 00:54:29,763 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 00:54:29,764 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 00:54:29,764 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f8501f8f-912e-4a16-83f0-f39ff4d22afe/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-09 00:54:29,771 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 00:54:29,772 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 00:54:29,772 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 00:54:29,772 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 00:54:29,772 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 00:54:29,773 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 00:54:29,773 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 00:54:29,773 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 00:54:29,773 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 00:54:29,773 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 00:54:29,773 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 00:54:29,773 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 00:54:29,773 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 00:54:29,774 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 00:54:29,774 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 00:54:29,774 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 00:54:29,774 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 00:54:29,774 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 00:54:29,774 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 00:54:29,774 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 00:54:29,774 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 00:54:29,774 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 00:54:29,774 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 00:54:29,775 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 00:54:29,775 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 00:54:29,775 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 00:54:29,775 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 00:54:29,775 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 00:54:29,775 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 00:54:29,775 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 00:54:29,775 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 00:54:29,775 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 00:54:29,775 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 00:54:29,776 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 00:54:29,776 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 00:54:29,776 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 00:54:29,776 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_f8501f8f-912e-4a16-83f0-f39ff4d22afe/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 -> 1f736ad3d73bcf44f292b11858e0429161a038cf [2018-12-09 00:54:29,793 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 00:54:29,800 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 00:54:29,802 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 00:54:29,803 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 00:54:29,803 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 00:54:29,803 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f8501f8f-912e-4a16-83f0-f39ff4d22afe/bin-2019/utaipan/../../sv-benchmarks/c/array-memsafety/rec_strlen-alloca_true-valid-memsafety_true-termination.i [2018-12-09 00:54:29,840 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f8501f8f-912e-4a16-83f0-f39ff4d22afe/bin-2019/utaipan/data/c2c558dbf/3447f226de934cadba0b84b3f9b04479/FLAG3b8680af3 [2018-12-09 00:54:30,283 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 00:54:30,284 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f8501f8f-912e-4a16-83f0-f39ff4d22afe/sv-benchmarks/c/array-memsafety/rec_strlen-alloca_true-valid-memsafety_true-termination.i [2018-12-09 00:54:30,289 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f8501f8f-912e-4a16-83f0-f39ff4d22afe/bin-2019/utaipan/data/c2c558dbf/3447f226de934cadba0b84b3f9b04479/FLAG3b8680af3 [2018-12-09 00:54:30,297 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f8501f8f-912e-4a16-83f0-f39ff4d22afe/bin-2019/utaipan/data/c2c558dbf/3447f226de934cadba0b84b3f9b04479 [2018-12-09 00:54:30,299 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 00:54:30,300 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 00:54:30,300 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 00:54:30,300 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 00:54:30,302 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 00:54:30,303 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:54:30" (1/1) ... [2018-12-09 00:54:30,304 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e9d864a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:54:30, skipping insertion in model container [2018-12-09 00:54:30,304 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:54:30" (1/1) ... [2018-12-09 00:54:30,310 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 00:54:30,331 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 00:54:30,471 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:54:30,477 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 00:54:30,547 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:54:30,566 INFO L195 MainTranslator]: Completed translation [2018-12-09 00:54:30,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:54:30 WrapperNode [2018-12-09 00:54:30,567 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 00:54:30,567 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 00:54:30,568 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 00:54:30,568 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 00:54:30,573 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:54:30" (1/1) ... [2018-12-09 00:54:30,580 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:54:30" (1/1) ... [2018-12-09 00:54:30,585 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 00:54:30,585 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 00:54:30,585 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 00:54:30,585 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 00:54:30,590 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:54:30" (1/1) ... [2018-12-09 00:54:30,591 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:54:30" (1/1) ... [2018-12-09 00:54:30,592 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:54:30" (1/1) ... [2018-12-09 00:54:30,592 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:54:30" (1/1) ... [2018-12-09 00:54:30,596 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:54:30" (1/1) ... [2018-12-09 00:54:30,597 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:54:30" (1/1) ... [2018-12-09 00:54:30,598 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:54:30" (1/1) ... [2018-12-09 00:54:30,599 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 00:54:30,599 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 00:54:30,599 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 00:54:30,599 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 00:54:30,600 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:54:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f8501f8f-912e-4a16-83f0-f39ff4d22afe/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 00:54:30,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 00:54:30,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 00:54:30,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 00:54:30,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 00:54:30,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 00:54:30,630 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 00:54:30,630 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 00:54:30,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 00:54:30,631 INFO L130 BoogieDeclarations]: Found specification of procedure strlen_rec [2018-12-09 00:54:30,631 INFO L138 BoogieDeclarations]: Found implementation of procedure strlen_rec [2018-12-09 00:54:30,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 00:54:30,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 00:54:30,735 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 00:54:30,735 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-09 00:54:30,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:54:30 BoogieIcfgContainer [2018-12-09 00:54:30,735 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 00:54:30,736 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 00:54:30,736 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 00:54:30,738 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 00:54:30,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 12:54:30" (1/3) ... [2018-12-09 00:54:30,738 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3344491f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:54:30, skipping insertion in model container [2018-12-09 00:54:30,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:54:30" (2/3) ... [2018-12-09 00:54:30,739 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3344491f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:54:30, skipping insertion in model container [2018-12-09 00:54:30,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:54:30" (3/3) ... [2018-12-09 00:54:30,740 INFO L112 eAbstractionObserver]: Analyzing ICFG rec_strlen-alloca_true-valid-memsafety_true-termination.i [2018-12-09 00:54:30,745 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 00:54:30,749 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-12-09 00:54:30,758 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2018-12-09 00:54:30,773 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 00:54:30,773 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 00:54:30,773 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 00:54:30,773 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 00:54:30,773 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 00:54:30,773 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 00:54:30,773 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 00:54:30,773 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 00:54:30,781 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-12-09 00:54:30,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-09 00:54:30,788 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:54:30,788 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:54:30,790 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, strlen_recErr0REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION]=== [2018-12-09 00:54:30,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:54:30,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1441242725, now seen corresponding path program 1 times [2018-12-09 00:54:30,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:54:30,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:54:30,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:54:30,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:54:30,822 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:54:30,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:54:30,882 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 00:54:30,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:54:30,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 00:54:30,883 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:54:30,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:54:30,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:54:30,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:54:30,895 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 3 states. [2018-12-09 00:54:30,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:54:30,919 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2018-12-09 00:54:30,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:54:30,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-12-09 00:54:30,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:54:30,926 INFO L225 Difference]: With dead ends: 26 [2018-12-09 00:54:30,926 INFO L226 Difference]: Without dead ends: 23 [2018-12-09 00:54:30,927 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 00:54:30,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-09 00:54:30,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-09 00:54:30,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-09 00:54:30,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-12-09 00:54:30,949 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 9 [2018-12-09 00:54:30,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:54:30,949 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-12-09 00:54:30,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:54:30,949 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-12-09 00:54:30,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-09 00:54:30,950 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:54:30,950 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:54:30,950 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, strlen_recErr0REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION]=== [2018-12-09 00:54:30,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:54:30,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1441242726, now seen corresponding path program 1 times [2018-12-09 00:54:30,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:54:30,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:54:30,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:54:30,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:54:30,951 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:54:30,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:54:30,984 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 00:54:30,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:54:30,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:54:30,985 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:54:30,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:54:30,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:54:30,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:54:30,986 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 4 states. [2018-12-09 00:54:30,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:54:30,999 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-12-09 00:54:30,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 00:54:30,999 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-12-09 00:54:30,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:54:30,999 INFO L225 Difference]: With dead ends: 22 [2018-12-09 00:54:31,000 INFO L226 Difference]: Without dead ends: 22 [2018-12-09 00:54:31,000 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 00:54:31,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-09 00:54:31,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-09 00:54:31,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-09 00:54:31,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-12-09 00:54:31,002 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 9 [2018-12-09 00:54:31,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:54:31,002 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-12-09 00:54:31,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:54:31,002 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-12-09 00:54:31,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-09 00:54:31,003 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:54:31,003 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:54:31,003 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, strlen_recErr0REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION]=== [2018-12-09 00:54:31,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:54:31,004 INFO L82 PathProgramCache]: Analyzing trace with hash -726033151, now seen corresponding path program 1 times [2018-12-09 00:54:31,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:54:31,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:54:31,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:54:31,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:54:31,005 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:54:31,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:54:31,040 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 00:54:31,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:54:31,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 00:54:31,040 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:54:31,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:54:31,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:54:31,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:54:31,041 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 5 states. [2018-12-09 00:54:31,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:54:31,082 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2018-12-09 00:54:31,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 00:54:31,082 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-12-09 00:54:31,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:54:31,083 INFO L225 Difference]: With dead ends: 21 [2018-12-09 00:54:31,083 INFO L226 Difference]: Without dead ends: 21 [2018-12-09 00:54:31,083 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 00:54:31,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-09 00:54:31,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-09 00:54:31,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-09 00:54:31,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-12-09 00:54:31,085 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 12 [2018-12-09 00:54:31,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:54:31,085 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-12-09 00:54:31,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:54:31,086 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-12-09 00:54:31,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-09 00:54:31,086 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:54:31,086 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:54:31,086 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, strlen_recErr0REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION]=== [2018-12-09 00:54:31,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:54:31,086 INFO L82 PathProgramCache]: Analyzing trace with hash -726033150, now seen corresponding path program 1 times [2018-12-09 00:54:31,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:54:31,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:54:31,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:54:31,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:54:31,087 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:54:31,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:54:31,160 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 00:54:31,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:54:31,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:54:31,161 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:54:31,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 00:54:31,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 00:54:31,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:54:31,162 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 7 states. [2018-12-09 00:54:31,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:54:31,197 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-12-09 00:54:31,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 00:54:31,197 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-12-09 00:54:31,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:54:31,198 INFO L225 Difference]: With dead ends: 28 [2018-12-09 00:54:31,198 INFO L226 Difference]: Without dead ends: 28 [2018-12-09 00:54:31,198 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 00:54:31,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-09 00:54:31,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-09 00:54:31,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-09 00:54:31,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-12-09 00:54:31,201 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 12 [2018-12-09 00:54:31,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:54:31,201 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-12-09 00:54:31,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 00:54:31,201 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-12-09 00:54:31,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-09 00:54:31,202 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:54:31,202 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:54:31,202 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, strlen_recErr0REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION]=== [2018-12-09 00:54:31,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:54:31,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1957687405, now seen corresponding path program 1 times [2018-12-09 00:54:31,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:54:31,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:54:31,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:54:31,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:54:31,203 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:54:31,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:54:31,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:54:31,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:54:31,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 00:54:31,273 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:54:31,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 00:54:31,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 00:54:31,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:54:31,274 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 8 states. [2018-12-09 00:54:31,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:54:31,328 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-12-09 00:54:31,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 00:54:31,328 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-09 00:54:31,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:54:31,329 INFO L225 Difference]: With dead ends: 39 [2018-12-09 00:54:31,329 INFO L226 Difference]: Without dead ends: 39 [2018-12-09 00:54:31,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-12-09 00:54:31,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-09 00:54:31,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-12-09 00:54:31,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-09 00:54:31,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2018-12-09 00:54:31,332 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 16 [2018-12-09 00:54:31,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:54:31,332 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2018-12-09 00:54:31,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 00:54:31,332 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2018-12-09 00:54:31,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-09 00:54:31,333 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:54:31,333 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:54:31,333 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, strlen_recErr0REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION]=== [2018-12-09 00:54:31,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:54:31,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1564660395, now seen corresponding path program 1 times [2018-12-09 00:54:31,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:54:31,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:54:31,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:54:31,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:54:31,334 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:54:31,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:54:31,441 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:54:31,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:54:31,441 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 00:54:31,442 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-09 00:54:31,443 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [10], [12], [13], [20], [21], [23], [27], [31], [32], [33], [35], [37] [2018-12-09 00:54:31,463 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 00:54:31,464 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 00:54:31,575 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 00:54:31,576 INFO L272 AbstractInterpreter]: Visited 15 different actions 40 times. Never merged. Widened at 1 different actions 2 times. Performed 258 root evaluator evaluations with a maximum evaluation depth of 3. Performed 258 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 16 variables. [2018-12-09 00:54:31,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:54:31,583 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 00:54:31,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:54:31,583 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f8501f8f-912e-4a16-83f0-f39ff4d22afe/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 00:54:31,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:54:31,591 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 00:54:31,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:54:31,607 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:54:31,635 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 00:54:31,638 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 00:54:31,638 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:54:31,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:54:31,649 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 00:54:31,649 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-12-09 00:54:31,710 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 00:54:31,717 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 00:54:31,718 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 00:54:31,721 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 00:54:31,730 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 00:54:31,730 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-12-09 00:54:31,787 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:54:31,787 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:54:31,930 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 00:54:31,931 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 00:54:31,938 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 00:54:31,946 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 00:54:31,946 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 00:54:31,947 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:54:31,953 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 00:54:31,953 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-12-09 00:54:31,961 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:54:31,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 00:54:31,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 22 [2018-12-09 00:54:31,979 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 00:54:31,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-09 00:54:31,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-09 00:54:31,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2018-12-09 00:54:31,979 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 16 states. [2018-12-09 00:54:32,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:54:32,257 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-12-09 00:54:32,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 00:54:32,257 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2018-12-09 00:54:32,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:54:32,259 INFO L225 Difference]: With dead ends: 45 [2018-12-09 00:54:32,259 INFO L226 Difference]: Without dead ends: 45 [2018-12-09 00:54:32,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=678, Unknown=0, NotChecked=0, Total=812 [2018-12-09 00:54:32,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-09 00:54:32,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-12-09 00:54:32,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-09 00:54:32,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-12-09 00:54:32,263 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 16 [2018-12-09 00:54:32,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:54:32,263 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-12-09 00:54:32,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-09 00:54:32,263 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-12-09 00:54:32,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-09 00:54:32,264 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:54:32,264 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:54:32,264 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, strlen_recErr0REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION]=== [2018-12-09 00:54:32,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:54:32,264 INFO L82 PathProgramCache]: Analyzing trace with hash 557650562, now seen corresponding path program 1 times [2018-12-09 00:54:32,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:54:32,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:54:32,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:54:32,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:54:32,265 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:54:32,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:54:32,291 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 00:54:32,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:54:32,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:54:32,291 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:54:32,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:54:32,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:54:32,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:54:32,292 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 4 states. [2018-12-09 00:54:32,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:54:32,317 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-12-09 00:54:32,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 00:54:32,318 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-12-09 00:54:32,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:54:32,318 INFO L225 Difference]: With dead ends: 42 [2018-12-09 00:54:32,318 INFO L226 Difference]: Without dead ends: 23 [2018-12-09 00:54:32,318 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 00:54:32,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-09 00:54:32,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-12-09 00:54:32,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-09 00:54:32,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-12-09 00:54:32,320 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 17 [2018-12-09 00:54:32,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:54:32,320 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-12-09 00:54:32,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:54:32,321 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-12-09 00:54:32,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 00:54:32,321 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:54:32,321 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:54:32,321 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, strlen_recErr0REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION]=== [2018-12-09 00:54:32,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:54:32,322 INFO L82 PathProgramCache]: Analyzing trace with hash -2065421930, now seen corresponding path program 2 times [2018-12-09 00:54:32,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:54:32,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:54:32,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:54:32,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:54:32,323 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:54:32,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:54:32,508 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:54:32,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:54:32,509 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 00:54:32,509 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 00:54:32,509 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 00:54:32,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:54:32,509 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f8501f8f-912e-4a16-83f0-f39ff4d22afe/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 00:54:32,515 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 00:54:32,515 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 00:54:32,528 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-09 00:54:32,528 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 00:54:32,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:54:32,532 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 00:54:32,533 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 00:54:32,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:54:32,535 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 00:54:32,553 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 16 treesize of output 13 [2018-12-09 00:54:32,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-12-09 00:54:32,554 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:54:32,555 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:54:32,559 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 00:54:32,559 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2018-12-09 00:54:32,610 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 00:54:32,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-12-09 00:54:32,617 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 00:54:32,619 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 00:54:32,629 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 00:54:32,630 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:39 [2018-12-09 00:54:32,711 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 00:54:32,711 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:54:32,904 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 00:54:32,911 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 00:54:32,911 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:54:32,912 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:54:32,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:54:32,918 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:44 [2018-12-09 00:54:32,947 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 00:54:32,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 00:54:32,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 27 [2018-12-09 00:54:32,962 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 00:54:32,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-09 00:54:32,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-09 00:54:32,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=675, Unknown=0, NotChecked=0, Total=756 [2018-12-09 00:54:32,963 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2018-12-09 00:54:33,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:54:33,490 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-12-09 00:54:33,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 00:54:33,491 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2018-12-09 00:54:33,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:54:33,491 INFO L225 Difference]: With dead ends: 22 [2018-12-09 00:54:33,491 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 00:54:33,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=248, Invalid=1392, Unknown=0, NotChecked=0, Total=1640 [2018-12-09 00:54:33,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 00:54:33,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 00:54:33,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 00:54:33,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 00:54:33,492 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2018-12-09 00:54:33,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:54:33,492 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 00:54:33,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-09 00:54:33,492 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 00:54:33,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 00:54:33,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 12:54:33 BoogieIcfgContainer [2018-12-09 00:54:33,496 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 00:54:33,496 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 00:54:33,496 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 00:54:33,496 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 00:54:33,496 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:54:30" (3/4) ... [2018-12-09 00:54:33,499 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 00:54:33,502 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 00:54:33,503 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 00:54:33,503 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure strlen_rec [2018-12-09 00:54:33,505 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2018-12-09 00:54:33,505 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-09 00:54:33,505 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-09 00:54:33,529 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f8501f8f-912e-4a16-83f0-f39ff4d22afe/bin-2019/utaipan/witness.graphml [2018-12-09 00:54:33,529 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 00:54:33,530 INFO L168 Benchmark]: Toolchain (without parser) took 3230.54 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 226.0 MB). Free memory was 945.9 MB in the beginning and 965.9 MB in the end (delta: -19.9 MB). Peak memory consumption was 206.0 MB. Max. memory is 11.5 GB. [2018-12-09 00:54:33,531 INFO L168 Benchmark]: CDTParser took 0.14 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-09 00:54:33,531 INFO L168 Benchmark]: CACSL2BoogieTranslator took 266.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -191.5 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2018-12-09 00:54:33,531 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.37 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-12-09 00:54:33,531 INFO L168 Benchmark]: Boogie Preprocessor took 13.72 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 00:54:33,531 INFO L168 Benchmark]: RCFGBuilder took 136.58 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.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2018-12-09 00:54:33,532 INFO L168 Benchmark]: TraceAbstraction took 2759.92 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 76.0 MB). Free memory was 1.1 GB in the beginning and 965.9 MB in the end (delta: 149.8 MB). Peak memory consumption was 225.8 MB. Max. memory is 11.5 GB. [2018-12-09 00:54:33,532 INFO L168 Benchmark]: Witness Printer took 33.41 ms. Allocated memory is still 1.3 GB. Free memory is still 965.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:54:33,533 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.14 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 266.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -191.5 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.37 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.72 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 136.58 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.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2759.92 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 76.0 MB). Free memory was 1.1 GB in the beginning and 965.9 MB in the end (delta: 149.8 MB). Peak memory consumption was 225.8 MB. Max. memory is 11.5 GB. * Witness Printer took 33.41 ms. Allocated memory is still 1.3 GB. Free memory is still 965.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 552]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 552]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 541]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 541]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 27 locations, 5 error locations. SAFE Result, 2.7s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 150 SDtfs, 123 SDslu, 485 SDs, 0 SdLazy, 479 SolverSat, 61 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 142 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred 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, 7 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 147 NumberOfCodeBlocks, 147 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 171 ConstructedInterpolants, 19 QuantifiedInterpolants, 22066 SizeOfPredicates, 24 NumberOfNonLiveVariables, 169 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 6/32 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...