./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memory-alloca/c.03-alloca_true-valid-memsafety.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_6c917911-7d35-43f0-81a4-f092c61821bd/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6c917911-7d35-43f0-81a4-f092c61821bd/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6c917911-7d35-43f0-81a4-f092c61821bd/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6c917911-7d35-43f0-81a4-f092c61821bd/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memory-alloca/c.03-alloca_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_6c917911-7d35-43f0-81a4-f092c61821bd/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6c917911-7d35-43f0-81a4-f092c61821bd/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 fbf9a4dabe36f21a3bd9a13ccbb8820aa048cd2e ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 19:35:35,046 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 19:35:35,047 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 19:35:35,053 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 19:35:35,053 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 19:35:35,054 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 19:35:35,055 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 19:35:35,055 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 19:35:35,056 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 19:35:35,057 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 19:35:35,057 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 19:35:35,057 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 19:35:35,058 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 19:35:35,058 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 19:35:35,059 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 19:35:35,059 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 19:35:35,060 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 19:35:35,061 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 19:35:35,061 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 19:35:35,062 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 19:35:35,063 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 19:35:35,063 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 19:35:35,065 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 19:35:35,065 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 19:35:35,065 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 19:35:35,065 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 19:35:35,066 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 19:35:35,066 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 19:35:35,067 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 19:35:35,067 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 19:35:35,067 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 19:35:35,068 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 19:35:35,068 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 19:35:35,068 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 19:35:35,069 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 19:35:35,069 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 19:35:35,069 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6c917911-7d35-43f0-81a4-f092c61821bd/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-09 19:35:35,076 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 19:35:35,077 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 19:35:35,077 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 19:35:35,077 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 19:35:35,077 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 19:35:35,078 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 19:35:35,078 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 19:35:35,078 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 19:35:35,078 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 19:35:35,078 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 19:35:35,078 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 19:35:35,078 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 19:35:35,078 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 19:35:35,079 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 19:35:35,079 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 19:35:35,079 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 19:35:35,079 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 19:35:35,079 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 19:35:35,080 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 19:35:35,080 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 19:35:35,080 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 19:35:35,080 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 19:35:35,080 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 19:35:35,080 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 19:35:35,080 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 19:35:35,080 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 19:35:35,081 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 19:35:35,081 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 19:35:35,081 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 19:35:35,081 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 19:35:35,081 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 19:35:35,081 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 19:35:35,081 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 19:35:35,081 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 19:35:35,082 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 19:35:35,082 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 19:35:35,082 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_6c917911-7d35-43f0-81a4-f092c61821bd/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 -> fbf9a4dabe36f21a3bd9a13ccbb8820aa048cd2e [2018-12-09 19:35:35,100 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 19:35:35,109 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 19:35:35,111 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 19:35:35,112 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 19:35:35,112 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 19:35:35,113 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6c917911-7d35-43f0-81a4-f092c61821bd/bin-2019/utaipan/../../sv-benchmarks/c/memory-alloca/c.03-alloca_true-valid-memsafety.i [2018-12-09 19:35:35,150 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6c917911-7d35-43f0-81a4-f092c61821bd/bin-2019/utaipan/data/b553958f1/6c113acfccd94952874f640fcf42159c/FLAG899a2dc0d [2018-12-09 19:35:35,511 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 19:35:35,512 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6c917911-7d35-43f0-81a4-f092c61821bd/sv-benchmarks/c/memory-alloca/c.03-alloca_true-valid-memsafety.i [2018-12-09 19:35:35,517 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6c917911-7d35-43f0-81a4-f092c61821bd/bin-2019/utaipan/data/b553958f1/6c113acfccd94952874f640fcf42159c/FLAG899a2dc0d [2018-12-09 19:35:35,882 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6c917911-7d35-43f0-81a4-f092c61821bd/bin-2019/utaipan/data/b553958f1/6c113acfccd94952874f640fcf42159c [2018-12-09 19:35:35,883 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 19:35:35,884 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 19:35:35,885 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 19:35:35,885 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 19:35:35,887 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 19:35:35,887 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:35:35" (1/1) ... [2018-12-09 19:35:35,889 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68649384 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:35:35, skipping insertion in model container [2018-12-09 19:35:35,889 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:35:35" (1/1) ... [2018-12-09 19:35:35,893 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 19:35:35,910 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 19:35:36,048 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:35:36,055 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 19:35:36,108 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:35:36,128 INFO L195 MainTranslator]: Completed translation [2018-12-09 19:35:36,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:35:36 WrapperNode [2018-12-09 19:35:36,128 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 19:35:36,129 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 19:35:36,129 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 19:35:36,129 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 19:35:36,134 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:35:36" (1/1) ... [2018-12-09 19:35:36,142 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:35:36" (1/1) ... [2018-12-09 19:35:36,147 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 19:35:36,147 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 19:35:36,147 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 19:35:36,148 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 19:35:36,153 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:35:36" (1/1) ... [2018-12-09 19:35:36,153 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:35:36" (1/1) ... [2018-12-09 19:35:36,155 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:35:36" (1/1) ... [2018-12-09 19:35:36,155 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:35:36" (1/1) ... [2018-12-09 19:35:36,158 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:35:36" (1/1) ... [2018-12-09 19:35:36,161 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:35:36" (1/1) ... [2018-12-09 19:35:36,162 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:35:36" (1/1) ... [2018-12-09 19:35:36,163 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 19:35:36,163 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 19:35:36,164 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 19:35:36,164 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 19:35:36,164 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:35:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c917911-7d35-43f0-81a4-f092c61821bd/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 19:35:36,194 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 19:35:36,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 19:35:36,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 19:35:36,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 19:35:36,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 19:35:36,195 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 19:35:36,195 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 19:35:36,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 19:35:36,195 INFO L130 BoogieDeclarations]: Found specification of procedure test_fun [2018-12-09 19:35:36,195 INFO L138 BoogieDeclarations]: Found implementation of procedure test_fun [2018-12-09 19:35:36,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 19:35:36,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 19:35:36,390 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 19:35:36,390 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-09 19:35:36,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:35:36 BoogieIcfgContainer [2018-12-09 19:35:36,391 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 19:35:36,391 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 19:35:36,391 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 19:35:36,393 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 19:35:36,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 07:35:35" (1/3) ... [2018-12-09 19:35:36,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dc16cb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:35:36, skipping insertion in model container [2018-12-09 19:35:36,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:35:36" (2/3) ... [2018-12-09 19:35:36,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dc16cb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:35:36, skipping insertion in model container [2018-12-09 19:35:36,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:35:36" (3/3) ... [2018-12-09 19:35:36,395 INFO L112 eAbstractionObserver]: Analyzing ICFG c.03-alloca_true-valid-memsafety.i [2018-12-09 19:35:36,401 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 19:35:36,406 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 31 error locations. [2018-12-09 19:35:36,417 INFO L257 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2018-12-09 19:35:36,435 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 19:35:36,435 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 19:35:36,435 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 19:35:36,435 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 19:35:36,435 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 19:35:36,436 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 19:35:36,436 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 19:35:36,436 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 19:35:36,446 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states. [2018-12-09 19:35:36,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-09 19:35:36,453 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:35:36,453 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:35:36,455 INFO L423 AbstractCegarLoop]: === Iteration 1 === [test_funErr8REQUIRES_VIOLATION, test_funErr29REQUIRES_VIOLATION, test_funErr7REQUIRES_VIOLATION, test_funErr9REQUIRES_VIOLATION, test_funErr10REQUIRES_VIOLATION, test_funErr12REQUIRES_VIOLATION, test_funErr11REQUIRES_VIOLATION, test_funErr24REQUIRES_VIOLATION, test_funErr2REQUIRES_VIOLATION, test_funErr23REQUIRES_VIOLATION, test_funErr4REQUIRES_VIOLATION, test_funErr25REQUIRES_VIOLATION, test_funErr3REQUIRES_VIOLATION, test_funErr5REQUIRES_VIOLATION, test_funErr26REQUIRES_VIOLATION, test_funErr28REQUIRES_VIOLATION, test_funErr6REQUIRES_VIOLATION, test_funErr27REQUIRES_VIOLATION, test_funErr18REQUIRES_VIOLATION, test_funErr20REQUIRES_VIOLATION, test_funErr19REQUIRES_VIOLATION, test_funErr21REQUIRES_VIOLATION, test_funErr0REQUIRES_VIOLATION, test_funErr1REQUIRES_VIOLATION, test_funErr22REQUIRES_VIOLATION, test_funErr13REQUIRES_VIOLATION, test_funErr14REQUIRES_VIOLATION, test_funErr16REQUIRES_VIOLATION, test_funErr15REQUIRES_VIOLATION, test_funErr17REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 19:35:36,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:35:36,458 INFO L82 PathProgramCache]: Analyzing trace with hash 2003430011, now seen corresponding path program 1 times [2018-12-09 19:35:36,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:35:36,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:36,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:35:36,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:36,488 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:35:36,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:35:36,567 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 19:35:36,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:35:36,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 19:35:36,568 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:35:36,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:35:36,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:35:36,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:35:36,581 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 3 states. [2018-12-09 19:35:36,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:35:36,634 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2018-12-09 19:35:36,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:35:36,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-12-09 19:35:36,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:35:36,641 INFO L225 Difference]: With dead ends: 62 [2018-12-09 19:35:36,641 INFO L226 Difference]: Without dead ends: 59 [2018-12-09 19:35:36,642 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 19:35:36,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-09 19:35:36,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-09 19:35:36,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-09 19:35:36,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-12-09 19:35:36,664 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 9 [2018-12-09 19:35:36,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:35:36,664 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-12-09 19:35:36,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:35:36,664 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-12-09 19:35:36,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-09 19:35:36,665 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:35:36,665 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:35:36,665 INFO L423 AbstractCegarLoop]: === Iteration 2 === [test_funErr8REQUIRES_VIOLATION, test_funErr29REQUIRES_VIOLATION, test_funErr7REQUIRES_VIOLATION, test_funErr9REQUIRES_VIOLATION, test_funErr10REQUIRES_VIOLATION, test_funErr12REQUIRES_VIOLATION, test_funErr11REQUIRES_VIOLATION, test_funErr24REQUIRES_VIOLATION, test_funErr2REQUIRES_VIOLATION, test_funErr23REQUIRES_VIOLATION, test_funErr4REQUIRES_VIOLATION, test_funErr25REQUIRES_VIOLATION, test_funErr3REQUIRES_VIOLATION, test_funErr5REQUIRES_VIOLATION, test_funErr26REQUIRES_VIOLATION, test_funErr28REQUIRES_VIOLATION, test_funErr6REQUIRES_VIOLATION, test_funErr27REQUIRES_VIOLATION, test_funErr18REQUIRES_VIOLATION, test_funErr20REQUIRES_VIOLATION, test_funErr19REQUIRES_VIOLATION, test_funErr21REQUIRES_VIOLATION, test_funErr0REQUIRES_VIOLATION, test_funErr1REQUIRES_VIOLATION, test_funErr22REQUIRES_VIOLATION, test_funErr13REQUIRES_VIOLATION, test_funErr14REQUIRES_VIOLATION, test_funErr16REQUIRES_VIOLATION, test_funErr15REQUIRES_VIOLATION, test_funErr17REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 19:35:36,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:35:36,665 INFO L82 PathProgramCache]: Analyzing trace with hash 2003430012, now seen corresponding path program 1 times [2018-12-09 19:35:36,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:35:36,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:36,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:35:36,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:36,666 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:35:36,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:35:36,700 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 19:35:36,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:35:36,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 19:35:36,700 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:35:36,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:35:36,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:35:36,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:35:36,702 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 3 states. [2018-12-09 19:35:36,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:35:36,731 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2018-12-09 19:35:36,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:35:36,731 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-12-09 19:35:36,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:35:36,732 INFO L225 Difference]: With dead ends: 54 [2018-12-09 19:35:36,732 INFO L226 Difference]: Without dead ends: 54 [2018-12-09 19:35:36,733 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 19:35:36,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-09 19:35:36,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-12-09 19:35:36,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-09 19:35:36,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2018-12-09 19:35:36,737 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 9 [2018-12-09 19:35:36,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:35:36,737 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2018-12-09 19:35:36,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:35:36,737 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-12-09 19:35:36,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 19:35:36,738 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:35:36,738 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:35:36,738 INFO L423 AbstractCegarLoop]: === Iteration 3 === [test_funErr8REQUIRES_VIOLATION, test_funErr29REQUIRES_VIOLATION, test_funErr7REQUIRES_VIOLATION, test_funErr9REQUIRES_VIOLATION, test_funErr10REQUIRES_VIOLATION, test_funErr12REQUIRES_VIOLATION, test_funErr11REQUIRES_VIOLATION, test_funErr24REQUIRES_VIOLATION, test_funErr2REQUIRES_VIOLATION, test_funErr23REQUIRES_VIOLATION, test_funErr4REQUIRES_VIOLATION, test_funErr25REQUIRES_VIOLATION, test_funErr3REQUIRES_VIOLATION, test_funErr5REQUIRES_VIOLATION, test_funErr26REQUIRES_VIOLATION, test_funErr28REQUIRES_VIOLATION, test_funErr6REQUIRES_VIOLATION, test_funErr27REQUIRES_VIOLATION, test_funErr18REQUIRES_VIOLATION, test_funErr20REQUIRES_VIOLATION, test_funErr19REQUIRES_VIOLATION, test_funErr21REQUIRES_VIOLATION, test_funErr0REQUIRES_VIOLATION, test_funErr1REQUIRES_VIOLATION, test_funErr22REQUIRES_VIOLATION, test_funErr13REQUIRES_VIOLATION, test_funErr14REQUIRES_VIOLATION, test_funErr16REQUIRES_VIOLATION, test_funErr15REQUIRES_VIOLATION, test_funErr17REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 19:35:36,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:35:36,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1976788173, now seen corresponding path program 1 times [2018-12-09 19:35:36,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:35:36,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:36,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:35:36,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:36,739 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:35:36,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:35:36,768 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 19:35:36,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:35:36,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 19:35:36,768 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:35:36,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:35:36,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:35:36,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:35:36,769 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 3 states. [2018-12-09 19:35:36,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:35:36,797 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2018-12-09 19:35:36,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:35:36,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-09 19:35:36,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:35:36,798 INFO L225 Difference]: With dead ends: 52 [2018-12-09 19:35:36,798 INFO L226 Difference]: Without dead ends: 52 [2018-12-09 19:35:36,798 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 19:35:36,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-09 19:35:36,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-09 19:35:36,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-09 19:35:36,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2018-12-09 19:35:36,801 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 10 [2018-12-09 19:35:36,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:35:36,801 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2018-12-09 19:35:36,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:35:36,802 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2018-12-09 19:35:36,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 19:35:36,802 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:35:36,802 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:35:36,802 INFO L423 AbstractCegarLoop]: === Iteration 4 === [test_funErr8REQUIRES_VIOLATION, test_funErr29REQUIRES_VIOLATION, test_funErr7REQUIRES_VIOLATION, test_funErr9REQUIRES_VIOLATION, test_funErr10REQUIRES_VIOLATION, test_funErr12REQUIRES_VIOLATION, test_funErr11REQUIRES_VIOLATION, test_funErr24REQUIRES_VIOLATION, test_funErr2REQUIRES_VIOLATION, test_funErr23REQUIRES_VIOLATION, test_funErr4REQUIRES_VIOLATION, test_funErr25REQUIRES_VIOLATION, test_funErr3REQUIRES_VIOLATION, test_funErr5REQUIRES_VIOLATION, test_funErr26REQUIRES_VIOLATION, test_funErr28REQUIRES_VIOLATION, test_funErr6REQUIRES_VIOLATION, test_funErr27REQUIRES_VIOLATION, test_funErr18REQUIRES_VIOLATION, test_funErr20REQUIRES_VIOLATION, test_funErr19REQUIRES_VIOLATION, test_funErr21REQUIRES_VIOLATION, test_funErr0REQUIRES_VIOLATION, test_funErr1REQUIRES_VIOLATION, test_funErr22REQUIRES_VIOLATION, test_funErr13REQUIRES_VIOLATION, test_funErr14REQUIRES_VIOLATION, test_funErr16REQUIRES_VIOLATION, test_funErr15REQUIRES_VIOLATION, test_funErr17REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 19:35:36,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:35:36,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1976788174, now seen corresponding path program 1 times [2018-12-09 19:35:36,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:35:36,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:36,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:35:36,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:36,803 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:35:36,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:35:36,825 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 19:35:36,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:35:36,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 19:35:36,826 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:35:36,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:35:36,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:35:36,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:35:36,826 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 3 states. [2018-12-09 19:35:36,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:35:36,854 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2018-12-09 19:35:36,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:35:36,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-09 19:35:36,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:35:36,855 INFO L225 Difference]: With dead ends: 50 [2018-12-09 19:35:36,855 INFO L226 Difference]: Without dead ends: 50 [2018-12-09 19:35:36,855 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 19:35:36,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-09 19:35:36,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-12-09 19:35:36,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-09 19:35:36,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2018-12-09 19:35:36,857 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 10 [2018-12-09 19:35:36,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:35:36,857 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2018-12-09 19:35:36,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:35:36,858 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2018-12-09 19:35:36,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 19:35:36,858 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:35:36,858 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:35:36,858 INFO L423 AbstractCegarLoop]: === Iteration 5 === [test_funErr8REQUIRES_VIOLATION, test_funErr29REQUIRES_VIOLATION, test_funErr7REQUIRES_VIOLATION, test_funErr9REQUIRES_VIOLATION, test_funErr10REQUIRES_VIOLATION, test_funErr12REQUIRES_VIOLATION, test_funErr11REQUIRES_VIOLATION, test_funErr24REQUIRES_VIOLATION, test_funErr2REQUIRES_VIOLATION, test_funErr23REQUIRES_VIOLATION, test_funErr4REQUIRES_VIOLATION, test_funErr25REQUIRES_VIOLATION, test_funErr3REQUIRES_VIOLATION, test_funErr5REQUIRES_VIOLATION, test_funErr26REQUIRES_VIOLATION, test_funErr28REQUIRES_VIOLATION, test_funErr6REQUIRES_VIOLATION, test_funErr27REQUIRES_VIOLATION, test_funErr18REQUIRES_VIOLATION, test_funErr20REQUIRES_VIOLATION, test_funErr19REQUIRES_VIOLATION, test_funErr21REQUIRES_VIOLATION, test_funErr0REQUIRES_VIOLATION, test_funErr1REQUIRES_VIOLATION, test_funErr22REQUIRES_VIOLATION, test_funErr13REQUIRES_VIOLATION, test_funErr14REQUIRES_VIOLATION, test_funErr16REQUIRES_VIOLATION, test_funErr15REQUIRES_VIOLATION, test_funErr17REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 19:35:36,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:35:36,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1150891198, now seen corresponding path program 1 times [2018-12-09 19:35:36,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:35:36,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:36,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:35:36,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:36,859 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:35:36,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:35:36,874 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 19:35:36,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:35:36,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 19:35:36,875 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:35:36,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:35:36,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:35:36,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:35:36,875 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 3 states. [2018-12-09 19:35:36,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:35:36,900 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2018-12-09 19:35:36,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:35:36,900 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-09 19:35:36,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:35:36,901 INFO L225 Difference]: With dead ends: 46 [2018-12-09 19:35:36,901 INFO L226 Difference]: Without dead ends: 46 [2018-12-09 19:35:36,901 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 19:35:36,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-09 19:35:36,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-12-09 19:35:36,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-09 19:35:36,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-12-09 19:35:36,903 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 11 [2018-12-09 19:35:36,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:35:36,903 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-12-09 19:35:36,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:35:36,903 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-12-09 19:35:36,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 19:35:36,903 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:35:36,904 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:35:36,904 INFO L423 AbstractCegarLoop]: === Iteration 6 === [test_funErr8REQUIRES_VIOLATION, test_funErr29REQUIRES_VIOLATION, test_funErr7REQUIRES_VIOLATION, test_funErr9REQUIRES_VIOLATION, test_funErr10REQUIRES_VIOLATION, test_funErr12REQUIRES_VIOLATION, test_funErr11REQUIRES_VIOLATION, test_funErr24REQUIRES_VIOLATION, test_funErr2REQUIRES_VIOLATION, test_funErr23REQUIRES_VIOLATION, test_funErr4REQUIRES_VIOLATION, test_funErr25REQUIRES_VIOLATION, test_funErr3REQUIRES_VIOLATION, test_funErr5REQUIRES_VIOLATION, test_funErr26REQUIRES_VIOLATION, test_funErr28REQUIRES_VIOLATION, test_funErr6REQUIRES_VIOLATION, test_funErr27REQUIRES_VIOLATION, test_funErr18REQUIRES_VIOLATION, test_funErr20REQUIRES_VIOLATION, test_funErr19REQUIRES_VIOLATION, test_funErr21REQUIRES_VIOLATION, test_funErr0REQUIRES_VIOLATION, test_funErr1REQUIRES_VIOLATION, test_funErr22REQUIRES_VIOLATION, test_funErr13REQUIRES_VIOLATION, test_funErr14REQUIRES_VIOLATION, test_funErr16REQUIRES_VIOLATION, test_funErr15REQUIRES_VIOLATION, test_funErr17REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 19:35:36,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:35:36,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1150891199, now seen corresponding path program 1 times [2018-12-09 19:35:36,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:35:36,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:36,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:35:36,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:36,905 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:35:36,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:35:36,923 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 19:35:36,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:35:36,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 19:35:36,923 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:35:36,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:35:36,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:35:36,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:35:36,924 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 3 states. [2018-12-09 19:35:36,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:35:36,948 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2018-12-09 19:35:36,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:35:36,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-09 19:35:36,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:35:36,949 INFO L225 Difference]: With dead ends: 42 [2018-12-09 19:35:36,949 INFO L226 Difference]: Without dead ends: 42 [2018-12-09 19:35:36,950 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 19:35:36,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-09 19:35:36,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-09 19:35:36,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-09 19:35:36,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-12-09 19:35:36,953 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 11 [2018-12-09 19:35:36,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:35:36,953 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-12-09 19:35:36,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:35:36,953 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-12-09 19:35:36,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-09 19:35:36,954 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:35:36,954 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:35:36,954 INFO L423 AbstractCegarLoop]: === Iteration 7 === [test_funErr8REQUIRES_VIOLATION, test_funErr29REQUIRES_VIOLATION, test_funErr7REQUIRES_VIOLATION, test_funErr9REQUIRES_VIOLATION, test_funErr10REQUIRES_VIOLATION, test_funErr12REQUIRES_VIOLATION, test_funErr11REQUIRES_VIOLATION, test_funErr24REQUIRES_VIOLATION, test_funErr2REQUIRES_VIOLATION, test_funErr23REQUIRES_VIOLATION, test_funErr4REQUIRES_VIOLATION, test_funErr25REQUIRES_VIOLATION, test_funErr3REQUIRES_VIOLATION, test_funErr5REQUIRES_VIOLATION, test_funErr26REQUIRES_VIOLATION, test_funErr28REQUIRES_VIOLATION, test_funErr6REQUIRES_VIOLATION, test_funErr27REQUIRES_VIOLATION, test_funErr18REQUIRES_VIOLATION, test_funErr20REQUIRES_VIOLATION, test_funErr19REQUIRES_VIOLATION, test_funErr21REQUIRES_VIOLATION, test_funErr0REQUIRES_VIOLATION, test_funErr1REQUIRES_VIOLATION, test_funErr22REQUIRES_VIOLATION, test_funErr13REQUIRES_VIOLATION, test_funErr14REQUIRES_VIOLATION, test_funErr16REQUIRES_VIOLATION, test_funErr15REQUIRES_VIOLATION, test_funErr17REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 19:35:36,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:35:36,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1317888752, now seen corresponding path program 1 times [2018-12-09 19:35:36,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:35:36,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:36,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:35:36,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:36,956 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:35:36,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:35:36,976 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 19:35:36,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:35:36,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 19:35:36,977 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:35:36,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:35:36,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:35:36,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:35:36,978 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 3 states. [2018-12-09 19:35:36,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:35:36,997 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2018-12-09 19:35:36,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:35:36,997 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-12-09 19:35:36,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:35:36,998 INFO L225 Difference]: With dead ends: 38 [2018-12-09 19:35:36,998 INFO L226 Difference]: Without dead ends: 38 [2018-12-09 19:35:36,998 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 19:35:36,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-09 19:35:37,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-09 19:35:37,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-09 19:35:37,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-12-09 19:35:37,001 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 12 [2018-12-09 19:35:37,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:35:37,001 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2018-12-09 19:35:37,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:35:37,002 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-12-09 19:35:37,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-09 19:35:37,002 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:35:37,002 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:35:37,002 INFO L423 AbstractCegarLoop]: === Iteration 8 === [test_funErr8REQUIRES_VIOLATION, test_funErr29REQUIRES_VIOLATION, test_funErr7REQUIRES_VIOLATION, test_funErr9REQUIRES_VIOLATION, test_funErr10REQUIRES_VIOLATION, test_funErr12REQUIRES_VIOLATION, test_funErr11REQUIRES_VIOLATION, test_funErr24REQUIRES_VIOLATION, test_funErr2REQUIRES_VIOLATION, test_funErr23REQUIRES_VIOLATION, test_funErr4REQUIRES_VIOLATION, test_funErr25REQUIRES_VIOLATION, test_funErr3REQUIRES_VIOLATION, test_funErr5REQUIRES_VIOLATION, test_funErr26REQUIRES_VIOLATION, test_funErr28REQUIRES_VIOLATION, test_funErr6REQUIRES_VIOLATION, test_funErr27REQUIRES_VIOLATION, test_funErr18REQUIRES_VIOLATION, test_funErr20REQUIRES_VIOLATION, test_funErr19REQUIRES_VIOLATION, test_funErr21REQUIRES_VIOLATION, test_funErr0REQUIRES_VIOLATION, test_funErr1REQUIRES_VIOLATION, test_funErr22REQUIRES_VIOLATION, test_funErr13REQUIRES_VIOLATION, test_funErr14REQUIRES_VIOLATION, test_funErr16REQUIRES_VIOLATION, test_funErr15REQUIRES_VIOLATION, test_funErr17REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 19:35:37,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:35:37,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1317888753, now seen corresponding path program 1 times [2018-12-09 19:35:37,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:35:37,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:37,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:35:37,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:37,004 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:35:37,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:35:37,029 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 19:35:37,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:35:37,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 19:35:37,030 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:35:37,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:35:37,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:35:37,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:35:37,030 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 3 states. [2018-12-09 19:35:37,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:35:37,049 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-12-09 19:35:37,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:35:37,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-12-09 19:35:37,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:35:37,050 INFO L225 Difference]: With dead ends: 34 [2018-12-09 19:35:37,050 INFO L226 Difference]: Without dead ends: 34 [2018-12-09 19:35:37,050 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 19:35:37,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-09 19:35:37,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-09 19:35:37,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-09 19:35:37,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-12-09 19:35:37,052 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 12 [2018-12-09 19:35:37,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:35:37,052 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2018-12-09 19:35:37,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:35:37,052 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-12-09 19:35:37,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 19:35:37,053 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:35:37,053 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:35:37,053 INFO L423 AbstractCegarLoop]: === Iteration 9 === [test_funErr8REQUIRES_VIOLATION, test_funErr29REQUIRES_VIOLATION, test_funErr7REQUIRES_VIOLATION, test_funErr9REQUIRES_VIOLATION, test_funErr10REQUIRES_VIOLATION, test_funErr12REQUIRES_VIOLATION, test_funErr11REQUIRES_VIOLATION, test_funErr24REQUIRES_VIOLATION, test_funErr2REQUIRES_VIOLATION, test_funErr23REQUIRES_VIOLATION, test_funErr4REQUIRES_VIOLATION, test_funErr25REQUIRES_VIOLATION, test_funErr3REQUIRES_VIOLATION, test_funErr5REQUIRES_VIOLATION, test_funErr26REQUIRES_VIOLATION, test_funErr28REQUIRES_VIOLATION, test_funErr6REQUIRES_VIOLATION, test_funErr27REQUIRES_VIOLATION, test_funErr18REQUIRES_VIOLATION, test_funErr20REQUIRES_VIOLATION, test_funErr19REQUIRES_VIOLATION, test_funErr21REQUIRES_VIOLATION, test_funErr0REQUIRES_VIOLATION, test_funErr1REQUIRES_VIOLATION, test_funErr22REQUIRES_VIOLATION, test_funErr13REQUIRES_VIOLATION, test_funErr14REQUIRES_VIOLATION, test_funErr16REQUIRES_VIOLATION, test_funErr15REQUIRES_VIOLATION, test_funErr17REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 19:35:37,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:35:37,053 INFO L82 PathProgramCache]: Analyzing trace with hash -449505380, now seen corresponding path program 1 times [2018-12-09 19:35:37,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:35:37,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:37,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:35:37,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:37,054 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:35:37,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:35:37,257 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 19:35:37,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:35:37,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:35:37,258 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:35:37,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:35:37,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:35:37,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:35:37,259 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 5 states. [2018-12-09 19:35:37,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:35:37,311 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2018-12-09 19:35:37,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:35:37,312 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-12-09 19:35:37,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:35:37,312 INFO L225 Difference]: With dead ends: 33 [2018-12-09 19:35:37,312 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 19:35:37,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:35:37,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 19:35:37,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 19:35:37,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 19:35:37,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 19:35:37,313 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2018-12-09 19:35:37,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:35:37,313 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 19:35:37,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:35:37,313 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 19:35:37,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 19:35:37,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 07:35:37 BoogieIcfgContainer [2018-12-09 19:35:37,317 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 19:35:37,317 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 19:35:37,317 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 19:35:37,317 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 19:35:37,318 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:35:36" (3/4) ... [2018-12-09 19:35:37,320 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 19:35:37,324 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 19:35:37,324 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure test_fun [2018-12-09 19:35:37,325 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 19:35:37,328 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2018-12-09 19:35:37,328 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-12-09 19:35:37,328 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-09 19:35:37,357 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_6c917911-7d35-43f0-81a4-f092c61821bd/bin-2019/utaipan/witness.graphml [2018-12-09 19:35:37,357 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 19:35:37,358 INFO L168 Benchmark]: Toolchain (without parser) took 1473.71 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 79.2 MB). Free memory was 945.9 MB in the beginning and 866.6 MB in the end (delta: 79.3 MB). Peak memory consumption was 158.5 MB. Max. memory is 11.5 GB. [2018-12-09 19:35:37,358 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 19:35:37,359 INFO L168 Benchmark]: CACSL2BoogieTranslator took 243.93 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 79.2 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -116.6 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-12-09 19:35:37,359 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.29 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 19:35:37,359 INFO L168 Benchmark]: Boogie Preprocessor took 15.85 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 19:35:37,360 INFO L168 Benchmark]: RCFGBuilder took 227.22 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 29.6 MB). Peak memory consumption was 29.6 MB. Max. memory is 11.5 GB. [2018-12-09 19:35:37,360 INFO L168 Benchmark]: TraceAbstraction took 925.80 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 873.7 MB in the end (delta: 159.1 MB). Peak memory consumption was 159.1 MB. Max. memory is 11.5 GB. [2018-12-09 19:35:37,360 INFO L168 Benchmark]: Witness Printer took 39.83 ms. Allocated memory is still 1.1 GB. Free memory was 873.7 MB in the beginning and 866.6 MB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2018-12-09 19:35:37,361 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 243.93 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 79.2 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -116.6 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.29 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.85 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 227.22 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 29.6 MB). Peak memory consumption was 29.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 925.80 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 873.7 MB in the end (delta: 159.1 MB). Peak memory consumption was 159.1 MB. Max. memory is 11.5 GB. * Witness Printer took 39.83 ms. Allocated memory is still 1.1 GB. Free memory was 873.7 MB in the beginning and 866.6 MB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 558]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 551]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 556]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 554]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 556]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 556]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 558]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 556]: 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: 554]: 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: 554]: 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: 554]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 551]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 551]: 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: 551]: 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: 560]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 31 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 67 locations, 31 error locations. SAFE Result, 0.8s OverallTime, 9 OverallIterations, 1 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 218 SDtfs, 297 SDslu, 93 SDs, 0 SdLazy, 248 SolverSat, 24 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 105 NumberOfCodeBlocks, 105 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 96 ConstructedInterpolants, 0 QuantifiedInterpolants, 21752 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...