./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext3/derefAfterFree2_false-valid-deref.c --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_800b9371-a859-40f7-a9dc-3673b8f433e3/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_800b9371-a859-40f7-a9dc-3673b8f433e3/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_800b9371-a859-40f7-a9dc-3673b8f433e3/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_800b9371-a859-40f7-a9dc-3673b8f433e3/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext3/derefAfterFree2_false-valid-deref.c -s /tmp/vcloud-vcloud-master/worker/working_dir_800b9371-a859-40f7-a9dc-3673b8f433e3/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_800b9371-a859-40f7-a9dc-3673b8f433e3/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 44834c55142a76240cb3980fc2bb6f5aeaa27c83 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-03 02:30:50,188 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 02:30:50,189 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 02:30:50,195 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 02:30:50,195 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 02:30:50,196 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 02:30:50,196 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 02:30:50,197 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 02:30:50,198 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 02:30:50,198 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 02:30:50,199 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 02:30:50,199 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 02:30:50,200 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 02:30:50,200 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 02:30:50,201 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 02:30:50,201 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 02:30:50,202 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 02:30:50,203 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 02:30:50,204 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 02:30:50,205 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 02:30:50,205 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 02:30:50,206 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 02:30:50,207 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 02:30:50,207 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 02:30:50,207 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 02:30:50,208 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 02:30:50,208 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 02:30:50,209 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 02:30:50,209 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 02:30:50,210 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 02:30:50,210 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 02:30:50,210 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 02:30:50,210 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 02:30:50,210 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 02:30:50,211 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 02:30:50,211 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 02:30:50,212 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_800b9371-a859-40f7-a9dc-3673b8f433e3/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-03 02:30:50,219 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 02:30:50,219 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 02:30:50,219 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 02:30:50,220 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 02:30:50,220 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 02:30:50,220 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 02:30:50,220 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 02:30:50,220 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 02:30:50,220 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 02:30:50,220 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 02:30:50,220 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 02:30:50,221 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 02:30:50,221 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 02:30:50,221 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 02:30:50,221 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 02:30:50,221 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 02:30:50,222 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 02:30:50,222 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-03 02:30:50,222 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 02:30:50,222 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 02:30:50,222 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 02:30:50,222 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-03 02:30:50,222 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-03 02:30:50,222 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-03 02:30:50,223 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 02:30:50,223 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 02:30:50,223 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 02:30:50,223 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 02:30:50,223 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 02:30:50,223 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 02:30:50,223 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 02:30:50,223 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 02:30:50,224 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 02:30:50,224 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 02:30:50,224 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 02:30:50,224 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 02:30:50,224 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_800b9371-a859-40f7-a9dc-3673b8f433e3/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 -> 44834c55142a76240cb3980fc2bb6f5aeaa27c83 [2018-12-03 02:30:50,242 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 02:30:50,251 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 02:30:50,253 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 02:30:50,254 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 02:30:50,254 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 02:30:50,255 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_800b9371-a859-40f7-a9dc-3673b8f433e3/bin-2019/utaipan/../../sv-benchmarks/c/memsafety-ext3/derefAfterFree2_false-valid-deref.c [2018-12-03 02:30:50,291 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_800b9371-a859-40f7-a9dc-3673b8f433e3/bin-2019/utaipan/data/d615568e3/82306171260d4976a178055277ef3706/FLAG417cde4c5 [2018-12-03 02:30:50,700 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 02:30:50,700 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_800b9371-a859-40f7-a9dc-3673b8f433e3/sv-benchmarks/c/memsafety-ext3/derefAfterFree2_false-valid-deref.c [2018-12-03 02:30:50,703 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_800b9371-a859-40f7-a9dc-3673b8f433e3/bin-2019/utaipan/data/d615568e3/82306171260d4976a178055277ef3706/FLAG417cde4c5 [2018-12-03 02:30:50,712 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_800b9371-a859-40f7-a9dc-3673b8f433e3/bin-2019/utaipan/data/d615568e3/82306171260d4976a178055277ef3706 [2018-12-03 02:30:50,713 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 02:30:50,714 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 02:30:50,715 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 02:30:50,715 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 02:30:50,717 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 02:30:50,717 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 02:30:50" (1/1) ... [2018-12-03 02:30:50,719 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@211fd2b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:30:50, skipping insertion in model container [2018-12-03 02:30:50,719 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 02:30:50" (1/1) ... [2018-12-03 02:30:50,723 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 02:30:50,731 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 02:30:50,811 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 02:30:50,816 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 02:30:50,825 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 02:30:50,833 INFO L195 MainTranslator]: Completed translation [2018-12-03 02:30:50,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:30:50 WrapperNode [2018-12-03 02:30:50,834 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 02:30:50,834 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 02:30:50,834 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 02:30:50,834 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 02:30:50,839 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:30:50" (1/1) ... [2018-12-03 02:30:50,843 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:30:50" (1/1) ... [2018-12-03 02:30:50,847 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 02:30:50,848 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 02:30:50,848 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 02:30:50,848 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 02:30:50,853 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:30:50" (1/1) ... [2018-12-03 02:30:50,853 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:30:50" (1/1) ... [2018-12-03 02:30:50,854 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:30:50" (1/1) ... [2018-12-03 02:30:50,854 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:30:50" (1/1) ... [2018-12-03 02:30:50,857 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:30:50" (1/1) ... [2018-12-03 02:30:50,860 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:30:50" (1/1) ... [2018-12-03 02:30:50,860 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:30:50" (1/1) ... [2018-12-03 02:30:50,861 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 02:30:50,862 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 02:30:50,862 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 02:30:50,862 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 02:30:50,862 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:30:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_800b9371-a859-40f7-a9dc-3673b8f433e3/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-03 02:30:50,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-03 02:30:50,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-03 02:30:50,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-03 02:30:50,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-03 02:30:50,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 02:30:50,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 02:30:50,922 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 02:30:50,922 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 02:30:50,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-03 02:30:51,013 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 02:30:51,013 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 02:30:51,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 02:30:51 BoogieIcfgContainer [2018-12-03 02:30:51,013 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 02:30:51,014 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 02:30:51,014 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 02:30:51,016 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 02:30:51,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 02:30:50" (1/3) ... [2018-12-03 02:30:51,017 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11a800b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 02:30:51, skipping insertion in model container [2018-12-03 02:30:51,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:30:50" (2/3) ... [2018-12-03 02:30:51,017 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11a800b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 02:30:51, skipping insertion in model container [2018-12-03 02:30:51,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 02:30:51" (3/3) ... [2018-12-03 02:30:51,018 INFO L112 eAbstractionObserver]: Analyzing ICFG derefAfterFree2_false-valid-deref.c [2018-12-03 02:30:51,025 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 02:30:51,030 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-12-03 02:30:51,040 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2018-12-03 02:30:51,056 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 02:30:51,056 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-03 02:30:51,056 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 02:30:51,057 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 02:30:51,057 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 02:30:51,057 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 02:30:51,057 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 02:30:51,057 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 02:30:51,065 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-12-03 02:30:51,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 02:30:51,070 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:30:51,071 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:30:51,072 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-03 02:30:51,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:30:51,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1675552165, now seen corresponding path program 1 times [2018-12-03 02:30:51,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:30:51,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:30:51,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:30:51,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:30:51,108 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:30:51,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:30:51,190 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-03 02:30:51,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:30:51,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 02:30:51,191 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:30:51,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 02:30:51,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 02:30:51,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 02:30:51,203 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 3 states. [2018-12-03 02:30:51,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:30:51,241 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-12-03 02:30:51,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 02:30:51,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-12-03 02:30:51,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:30:51,247 INFO L225 Difference]: With dead ends: 27 [2018-12-03 02:30:51,247 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 02:30:51,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 02:30:51,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 02:30:51,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2018-12-03 02:30:51,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-03 02:30:51,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-12-03 02:30:51,269 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 8 [2018-12-03 02:30:51,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:30:51,269 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-12-03 02:30:51,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 02:30:51,269 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-12-03 02:30:51,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 02:30:51,270 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:30:51,270 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:30:51,270 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-03 02:30:51,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:30:51,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1675552164, now seen corresponding path program 1 times [2018-12-03 02:30:51,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:30:51,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:30:51,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:30:51,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:30:51,271 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:30:51,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:30:51,288 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-03 02:30:51,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:30:51,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 02:30:51,289 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:30:51,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 02:30:51,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 02:30:51,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 02:30:51,290 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 3 states. [2018-12-03 02:30:51,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:30:51,303 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-12-03 02:30:51,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 02:30:51,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-12-03 02:30:51,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:30:51,303 INFO L225 Difference]: With dead ends: 28 [2018-12-03 02:30:51,304 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 02:30:51,304 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-03 02:30:51,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 02:30:51,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2018-12-03 02:30:51,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 02:30:51,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2018-12-03 02:30:51,306 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 8 [2018-12-03 02:30:51,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:30:51,307 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-12-03 02:30:51,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 02:30:51,307 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-12-03 02:30:51,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 02:30:51,307 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:30:51,307 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:30:51,307 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-03 02:30:51,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:30:51,308 INFO L82 PathProgramCache]: Analyzing trace with hash -387375000, now seen corresponding path program 1 times [2018-12-03 02:30:51,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:30:51,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:30:51,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:30:51,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:30:51,309 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:30:51,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:30:51,406 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-03 02:30:51,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:30:51,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 02:30:51,406 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:30:51,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 02:30:51,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 02:30:51,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 02:30:51,407 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 6 states. [2018-12-03 02:30:51,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:30:51,428 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2018-12-03 02:30:51,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 02:30:51,428 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-12-03 02:30:51,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:30:51,429 INFO L225 Difference]: With dead ends: 23 [2018-12-03 02:30:51,429 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 02:30:51,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 02:30:51,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 02:30:51,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-12-03 02:30:51,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-03 02:30:51,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-12-03 02:30:51,431 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 12 [2018-12-03 02:30:51,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:30:51,431 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-12-03 02:30:51,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 02:30:51,432 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-12-03 02:30:51,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 02:30:51,432 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:30:51,432 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:30:51,432 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-03 02:30:51,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:30:51,433 INFO L82 PathProgramCache]: Analyzing trace with hash 876275464, now seen corresponding path program 1 times [2018-12-03 02:30:51,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:30:51,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:30:51,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:30:51,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:30:51,434 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:30:51,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:30:51,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:30:51,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 02:30:51,451 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 02:30:51,452 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2018-12-03 02:30:51,453 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [11], [13], [14], [25], [27], [31], [33], [34], [35], [36] [2018-12-03 02:30:51,475 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 02:30:51,475 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 02:30:51,589 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 02:30:51,590 INFO L272 AbstractInterpreter]: Visited 13 different actions 35 times. Merged at 7 different actions 19 times. Widened at 1 different actions 1 times. Performed 178 root evaluator evaluations with a maximum evaluation depth of 4. Performed 178 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 2 fixpoints after 2 different actions. Largest state had 17 variables. [2018-12-03 02:30:51,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:30:51,597 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 02:30:51,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 02:30:51,597 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_800b9371-a859-40f7-a9dc-3673b8f433e3/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-03 02:30:51,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:30:51,603 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 02:30:51,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:30:51,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:30:51,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:30:51,631 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 02:30:51,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:30:51,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 02:30:51,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-03 02:30:51,665 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 02:30:51,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 02:30:51,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 02:30:51,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-03 02:30:51,666 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 5 states. [2018-12-03 02:30:51,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:30:51,683 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-12-03 02:30:51,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:30:51,683 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-12-03 02:30:51,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:30:51,684 INFO L225 Difference]: With dead ends: 27 [2018-12-03 02:30:51,684 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 02:30:51,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-03 02:30:51,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 02:30:51,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-12-03 02:30:51,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-03 02:30:51,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-12-03 02:30:51,686 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 13 [2018-12-03 02:30:51,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:30:51,686 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-12-03 02:30:51,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 02:30:51,686 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-12-03 02:30:51,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 02:30:51,686 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:30:51,687 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:30:51,687 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-03 02:30:51,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:30:51,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1958351323, now seen corresponding path program 2 times [2018-12-03 02:30:51,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:30:51,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:30:51,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:30:51,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:30:51,688 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:30:51,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:30:51,717 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:30:51,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 02:30:51,717 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 02:30:51,718 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 02:30:51,718 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 02:30:51,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 02:30:51,718 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_800b9371-a859-40f7-a9dc-3673b8f433e3/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-03 02:30:51,725 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 02:30:51,725 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 02:30:51,734 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-03 02:30:51,734 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 02:30:51,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:30:51,740 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:30:51,740 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 02:30:51,762 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:30:51,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 02:30:51,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-03 02:30:51,776 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 02:30:51,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 02:30:51,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 02:30:51,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-12-03 02:30:51,776 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 6 states. [2018-12-03 02:30:51,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:30:51,794 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2018-12-03 02:30:51,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 02:30:51,795 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-12-03 02:30:51,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:30:51,795 INFO L225 Difference]: With dead ends: 31 [2018-12-03 02:30:51,795 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 02:30:51,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-12-03 02:30:51,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 02:30:51,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-12-03 02:30:51,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-03 02:30:51,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-12-03 02:30:51,798 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 17 [2018-12-03 02:30:51,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:30:51,798 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-12-03 02:30:51,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 02:30:51,798 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-12-03 02:30:51,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 02:30:51,798 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:30:51,798 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:30:51,799 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-03 02:30:51,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:30:51,799 INFO L82 PathProgramCache]: Analyzing trace with hash -921821502, now seen corresponding path program 3 times [2018-12-03 02:30:51,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:30:51,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:30:51,799 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 02:30:51,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:30:51,800 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:30:51,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:30:51,828 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:30:51,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 02:30:51,828 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 02:30:51,828 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 02:30:51,828 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 02:30:51,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 02:30:51,829 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_800b9371-a859-40f7-a9dc-3673b8f433e3/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 02:30:51,836 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 02:30:51,837 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 02:30:51,847 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 02:30:51,847 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 02:30:51,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:30:51,855 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:30:51,855 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 02:30:51,882 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:30:51,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 02:30:51,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 02:30:51,897 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 02:30:51,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 02:30:51,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 02:30:51,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-03 02:30:51,898 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 7 states. [2018-12-03 02:30:51,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:30:51,923 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-12-03 02:30:51,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 02:30:51,924 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-12-03 02:30:51,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:30:51,924 INFO L225 Difference]: With dead ends: 35 [2018-12-03 02:30:51,925 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 02:30:51,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-03 02:30:51,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 02:30:51,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-12-03 02:30:51,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-03 02:30:51,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-12-03 02:30:51,928 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 21 [2018-12-03 02:30:51,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:30:51,928 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-12-03 02:30:51,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 02:30:51,928 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-12-03 02:30:51,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 02:30:51,929 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:30:51,929 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:30:51,929 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-03 02:30:51,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:30:51,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1880966945, now seen corresponding path program 4 times [2018-12-03 02:30:51,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:30:51,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:30:51,931 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 02:30:51,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:30:51,931 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:30:51,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:30:51,979 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:30:51,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 02:30:51,979 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 02:30:51,980 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 02:30:51,980 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 02:30:51,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 02:30:51,980 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_800b9371-a859-40f7-a9dc-3673b8f433e3/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 02:30:51,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:30:51,987 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 02:30:51,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:30:51,998 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:30:52,005 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:30:52,005 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 02:30:52,044 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:30:52,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 02:30:52,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 02:30:52,058 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 02:30:52,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 02:30:52,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 02:30:52,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-03 02:30:52,059 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 8 states. [2018-12-03 02:30:52,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:30:52,084 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-12-03 02:30:52,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 02:30:52,084 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-12-03 02:30:52,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:30:52,085 INFO L225 Difference]: With dead ends: 39 [2018-12-03 02:30:52,085 INFO L226 Difference]: Without dead ends: 39 [2018-12-03 02:30:52,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-03 02:30:52,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-03 02:30:52,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-12-03 02:30:52,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-03 02:30:52,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-12-03 02:30:52,088 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 25 [2018-12-03 02:30:52,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:30:52,088 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-12-03 02:30:52,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 02:30:52,089 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-12-03 02:30:52,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-03 02:30:52,089 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:30:52,089 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:30:52,090 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-03 02:30:52,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:30:52,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1215495292, now seen corresponding path program 5 times [2018-12-03 02:30:52,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:30:52,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:30:52,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:30:52,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:30:52,091 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:30:52,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:30:52,167 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 13 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:30:52,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 02:30:52,168 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 02:30:52,168 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 02:30:52,168 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 02:30:52,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 02:30:52,168 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_800b9371-a859-40f7-a9dc-3673b8f433e3/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 02:30:52,176 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 02:30:52,176 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 02:30:52,189 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 02:30:52,190 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 02:30:52,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:30:52,238 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:30:52,238 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 02:30:52,281 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:30:52,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 02:30:52,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2018-12-03 02:30:52,295 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 02:30:52,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 02:30:52,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 02:30:52,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=161, Unknown=0, NotChecked=0, Total=272 [2018-12-03 02:30:52,296 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 15 states. [2018-12-03 02:30:52,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:30:52,471 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2018-12-03 02:30:52,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 02:30:52,471 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2018-12-03 02:30:52,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:30:52,473 INFO L225 Difference]: With dead ends: 53 [2018-12-03 02:30:52,473 INFO L226 Difference]: Without dead ends: 53 [2018-12-03 02:30:52,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 50 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=232, Invalid=418, Unknown=0, NotChecked=0, Total=650 [2018-12-03 02:30:52,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-03 02:30:52,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-03 02:30:52,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-03 02:30:52,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2018-12-03 02:30:52,476 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 29 [2018-12-03 02:30:52,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:30:52,476 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2018-12-03 02:30:52,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 02:30:52,477 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2018-12-03 02:30:52,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 02:30:52,477 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:30:52,477 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:30:52,477 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-03 02:30:52,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:30:52,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1030409178, now seen corresponding path program 1 times [2018-12-03 02:30:52,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:30:52,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:30:52,478 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 02:30:52,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:30:52,478 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:30:52,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 02:30:52,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 02:30:52,517 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-03 02:30:52,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 02:30:52 BoogieIcfgContainer [2018-12-03 02:30:52,535 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 02:30:52,535 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 02:30:52,536 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 02:30:52,536 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 02:30:52,536 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 02:30:51" (3/4) ... [2018-12-03 02:30:52,537 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-03 02:30:52,566 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_800b9371-a859-40f7-a9dc-3673b8f433e3/bin-2019/utaipan/witness.graphml [2018-12-03 02:30:52,567 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 02:30:52,567 INFO L168 Benchmark]: Toolchain (without parser) took 1853.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 958.8 MB in the beginning and 827.6 MB in the end (delta: 131.3 MB). Peak memory consumption was 268.1 MB. Max. memory is 11.5 GB. [2018-12-03 02:30:52,568 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 02:30:52,568 INFO L168 Benchmark]: CACSL2BoogieTranslator took 119.09 ms. Allocated memory is still 1.0 GB. Free memory was 958.8 MB in the beginning and 947.0 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-12-03 02:30:52,568 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.49 ms. Allocated memory is still 1.0 GB. Free memory is still 947.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 02:30:52,568 INFO L168 Benchmark]: Boogie Preprocessor took 13.63 ms. Allocated memory is still 1.0 GB. Free memory was 947.0 MB in the beginning and 941.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-03 02:30:52,569 INFO L168 Benchmark]: RCFGBuilder took 151.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 941.7 MB in the beginning and 1.1 GB in the end (delta: -175.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2018-12-03 02:30:52,569 INFO L168 Benchmark]: TraceAbstraction took 1521.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 827.6 MB in the end (delta: 289.4 MB). Peak memory consumption was 289.4 MB. Max. memory is 11.5 GB. [2018-12-03 02:30:52,569 INFO L168 Benchmark]: Witness Printer took 31.20 ms. Allocated memory is still 1.2 GB. Free memory is still 827.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 02:30:52,571 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 119.09 ms. Allocated memory is still 1.0 GB. Free memory was 958.8 MB in the beginning and 947.0 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 13.49 ms. Allocated memory is still 1.0 GB. Free memory is still 947.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.63 ms. Allocated memory is still 1.0 GB. Free memory was 947.0 MB in the beginning and 941.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 151.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 941.7 MB in the beginning and 1.1 GB in the end (delta: -175.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1521.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 827.6 MB in the end (delta: 289.4 MB). Peak memory consumption was 289.4 MB. Max. memory is 11.5 GB. * Witness Printer took 31.20 ms. Allocated memory is still 1.2 GB. Free memory is still 827.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 9]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L6] int* p = malloc(10 * sizeof(int)); [L8] int i = 0; VAL [i=0, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L8] COND TRUE i < 10 VAL [i=0, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L9] p[i] = 1 VAL [i=0, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND FALSE !(i == 5) VAL [i=0, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L8] i++ VAL [i=1, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L8] COND TRUE i < 10 VAL [i=1, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L9] p[i] = 1 VAL [i=1, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND FALSE !(i == 5) VAL [i=1, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L8] i++ VAL [i=2, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L8] COND TRUE i < 10 VAL [i=2, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L9] p[i] = 1 VAL [i=2, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND FALSE !(i == 5) VAL [i=2, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L8] i++ VAL [i=3, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L8] COND TRUE i < 10 VAL [i=3, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L9] p[i] = 1 VAL [i=3, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND FALSE !(i == 5) VAL [i=3, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L8] i++ VAL [i=4, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L8] COND TRUE i < 10 VAL [i=4, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L9] p[i] = 1 VAL [i=4, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND FALSE !(i == 5) VAL [i=4, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L8] i++ VAL [i=5, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L8] COND TRUE i < 10 VAL [i=5, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L9] p[i] = 1 VAL [i=5, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i == 5 VAL [i=5, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L11] free(p) VAL [i=5, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L11] free(p) [L8] i++ VAL [i=6, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L8] COND TRUE i < 10 VAL [i=6, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L9] p[i] = 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 22 locations, 5 error locations. UNSAFE Result, 1.4s OverallTime, 9 OverallIterations, 7 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 104 SDtfs, 224 SDslu, 205 SDs, 0 SdLazy, 209 SolverSat, 44 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 260 GetRequests, 191 SyntacticMatches, 7 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=8, 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, 11 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 272 NumberOfCodeBlocks, 272 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 325 ConstructedInterpolants, 0 QuantifiedInterpolants, 17854 SizeOfPredicates, 5 NumberOfNonLiveVariables, 355 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 18 InterpolantComputations, 3 PerfectInterpolantSequences, 15/287 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...