./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test6_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4a3ad401-9d0a-4c96-9006-9d5486e8e544/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4a3ad401-9d0a-4c96-9006-9d5486e8e544/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4a3ad401-9d0a-4c96-9006-9d5486e8e544/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4a3ad401-9d0a-4c96-9006-9d5486e8e544/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test6_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_4a3ad401-9d0a-4c96-9006-9d5486e8e544/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4a3ad401-9d0a-4c96-9006-9d5486e8e544/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 e2d5d691ed29cb8b2a6f5a402a7f2a124682fa21 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 09:31:20,829 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 09:31:20,830 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 09:31:20,837 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 09:31:20,837 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 09:31:20,838 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 09:31:20,839 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 09:31:20,840 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 09:31:20,841 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 09:31:20,841 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 09:31:20,842 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 09:31:20,842 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 09:31:20,843 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 09:31:20,843 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 09:31:20,844 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 09:31:20,844 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 09:31:20,845 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 09:31:20,846 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 09:31:20,847 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 09:31:20,848 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 09:31:20,848 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 09:31:20,849 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 09:31:20,851 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 09:31:20,851 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 09:31:20,851 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 09:31:20,851 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 09:31:20,852 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 09:31:20,852 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 09:31:20,853 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 09:31:20,853 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 09:31:20,853 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 09:31:20,854 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 09:31:20,854 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 09:31:20,854 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 09:31:20,854 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 09:31:20,855 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 09:31:20,855 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4a3ad401-9d0a-4c96-9006-9d5486e8e544/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-09 09:31:20,865 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 09:31:20,865 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 09:31:20,865 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 09:31:20,866 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 09:31:20,866 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 09:31:20,866 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 09:31:20,866 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 09:31:20,866 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 09:31:20,866 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 09:31:20,867 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 09:31:20,867 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 09:31:20,867 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 09:31:20,867 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 09:31:20,868 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 09:31:20,868 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 09:31:20,868 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 09:31:20,868 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 09:31:20,868 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 09:31:20,868 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 09:31:20,869 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 09:31:20,869 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 09:31:20,869 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 09:31:20,869 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 09:31:20,869 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 09:31:20,869 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 09:31:20,869 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 09:31:20,870 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 09:31:20,870 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 09:31:20,870 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 09:31:20,870 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 09:31:20,870 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 09:31:20,870 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 09:31:20,871 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 09:31:20,871 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 09:31:20,871 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 09:31:20,871 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 09:31:20,871 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_4a3ad401-9d0a-4c96-9006-9d5486e8e544/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 -> e2d5d691ed29cb8b2a6f5a402a7f2a124682fa21 [2018-12-09 09:31:20,894 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 09:31:20,902 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 09:31:20,904 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 09:31:20,905 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 09:31:20,905 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 09:31:20,906 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4a3ad401-9d0a-4c96-9006-9d5486e8e544/bin-2019/utaipan/../../sv-benchmarks/c/ldv-memsafety/memleaks_test6_true-valid-memsafety_true-termination.i [2018-12-09 09:31:20,941 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4a3ad401-9d0a-4c96-9006-9d5486e8e544/bin-2019/utaipan/data/e6bf3952b/416cebb9bc8c43bd96a334ce9df6f3d2/FLAG23d2ee2c0 [2018-12-09 09:31:21,368 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 09:31:21,369 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4a3ad401-9d0a-4c96-9006-9d5486e8e544/sv-benchmarks/c/ldv-memsafety/memleaks_test6_true-valid-memsafety_true-termination.i [2018-12-09 09:31:21,376 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4a3ad401-9d0a-4c96-9006-9d5486e8e544/bin-2019/utaipan/data/e6bf3952b/416cebb9bc8c43bd96a334ce9df6f3d2/FLAG23d2ee2c0 [2018-12-09 09:31:21,384 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4a3ad401-9d0a-4c96-9006-9d5486e8e544/bin-2019/utaipan/data/e6bf3952b/416cebb9bc8c43bd96a334ce9df6f3d2 [2018-12-09 09:31:21,386 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 09:31:21,387 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 09:31:21,388 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 09:31:21,388 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 09:31:21,390 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 09:31:21,390 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 09:31:21" (1/1) ... [2018-12-09 09:31:21,392 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@461c4b29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:31:21, skipping insertion in model container [2018-12-09 09:31:21,392 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 09:31:21" (1/1) ... [2018-12-09 09:31:21,396 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 09:31:21,418 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 09:31:21,642 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 09:31:21,651 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 09:31:21,691 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 09:31:21,722 INFO L195 MainTranslator]: Completed translation [2018-12-09 09:31:21,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:31:21 WrapperNode [2018-12-09 09:31:21,722 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 09:31:21,722 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 09:31:21,723 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 09:31:21,723 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 09:31:21,727 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:31:21" (1/1) ... [2018-12-09 09:31:21,738 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:31:21" (1/1) ... [2018-12-09 09:31:21,743 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 09:31:21,743 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 09:31:21,743 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 09:31:21,743 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 09:31:21,749 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:31:21" (1/1) ... [2018-12-09 09:31:21,749 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:31:21" (1/1) ... [2018-12-09 09:31:21,750 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:31:21" (1/1) ... [2018-12-09 09:31:21,751 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:31:21" (1/1) ... [2018-12-09 09:31:21,755 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:31:21" (1/1) ... [2018-12-09 09:31:21,757 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:31:21" (1/1) ... [2018-12-09 09:31:21,757 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:31:21" (1/1) ... [2018-12-09 09:31:21,759 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 09:31:21,759 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 09:31:21,759 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 09:31:21,759 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 09:31:21,759 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:31:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a3ad401-9d0a-4c96-9006-9d5486e8e544/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 09:31:21,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 09:31:21,789 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-12-09 09:31:21,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-12-09 09:31:21,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 09:31:21,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 09:31:21,789 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 09:31:21,789 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 09:31:21,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 09:31:21,789 INFO L130 BoogieDeclarations]: Found specification of procedure f6 [2018-12-09 09:31:21,789 INFO L138 BoogieDeclarations]: Found implementation of procedure f6 [2018-12-09 09:31:21,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 09:31:21,790 INFO L130 BoogieDeclarations]: Found specification of procedure g6 [2018-12-09 09:31:21,790 INFO L138 BoogieDeclarations]: Found implementation of procedure g6 [2018-12-09 09:31:21,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 09:31:21,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-09 09:31:21,790 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2018-12-09 09:31:21,790 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2018-12-09 09:31:21,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 09:31:21,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 09:31:21,790 INFO L130 BoogieDeclarations]: Found specification of procedure disconnect_6 [2018-12-09 09:31:21,790 INFO L138 BoogieDeclarations]: Found implementation of procedure disconnect_6 [2018-12-09 09:31:21,790 INFO L130 BoogieDeclarations]: Found specification of procedure probe1_6 [2018-12-09 09:31:21,790 INFO L138 BoogieDeclarations]: Found implementation of procedure probe1_6 [2018-12-09 09:31:21,948 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 09:31:21,948 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-09 09:31:21,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:31:21 BoogieIcfgContainer [2018-12-09 09:31:21,948 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 09:31:21,949 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 09:31:21,949 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 09:31:21,951 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 09:31:21,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 09:31:21" (1/3) ... [2018-12-09 09:31:21,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@377019e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 09:31:21, skipping insertion in model container [2018-12-09 09:31:21,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:31:21" (2/3) ... [2018-12-09 09:31:21,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@377019e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 09:31:21, skipping insertion in model container [2018-12-09 09:31:21,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:31:21" (3/3) ... [2018-12-09 09:31:21,952 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test6_true-valid-memsafety_true-termination.i [2018-12-09 09:31:21,958 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 09:31:21,962 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-12-09 09:31:21,970 INFO L257 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2018-12-09 09:31:21,984 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 09:31:21,984 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 09:31:21,984 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 09:31:21,985 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 09:31:21,985 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 09:31:21,985 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 09:31:21,985 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 09:31:21,985 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 09:31:21,993 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-12-09 09:31:21,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 09:31:21,999 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:31:21,999 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] [2018-12-09 09:31:22,000 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 09:31:22,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:31:22,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1363142069, now seen corresponding path program 1 times [2018-12-09 09:31:22,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:31:22,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:22,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:31:22,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:22,036 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:31:22,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:31:22,123 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 09:31:22,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:31:22,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 09:31:22,124 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:31:22,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 09:31:22,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 09:31:22,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:31:22,137 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 5 states. [2018-12-09 09:31:22,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:31:22,172 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2018-12-09 09:31:22,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 09:31:22,173 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-12-09 09:31:22,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:31:22,180 INFO L225 Difference]: With dead ends: 79 [2018-12-09 09:31:22,180 INFO L226 Difference]: Without dead ends: 76 [2018-12-09 09:31:22,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:31:22,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-09 09:31:22,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 61. [2018-12-09 09:31:22,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-09 09:31:22,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2018-12-09 09:31:22,207 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 20 [2018-12-09 09:31:22,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:31:22,208 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-12-09 09:31:22,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 09:31:22,208 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-12-09 09:31:22,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 09:31:22,209 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:31:22,209 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] [2018-12-09 09:31:22,209 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 09:31:22,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:31:22,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1166628564, now seen corresponding path program 1 times [2018-12-09 09:31:22,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:31:22,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:22,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:31:22,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:22,211 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:31:22,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:31:22,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 09:31:22,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:31:22,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 09:31:22,258 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:31:22,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 09:31:22,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 09:31:22,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:31:22,259 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 4 states. [2018-12-09 09:31:22,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:31:22,342 INFO L93 Difference]: Finished difference Result 100 states and 111 transitions. [2018-12-09 09:31:22,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 09:31:22,343 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-12-09 09:31:22,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:31:22,344 INFO L225 Difference]: With dead ends: 100 [2018-12-09 09:31:22,344 INFO L226 Difference]: Without dead ends: 97 [2018-12-09 09:31:22,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:31:22,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-09 09:31:22,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 79. [2018-12-09 09:31:22,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-09 09:31:22,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 92 transitions. [2018-12-09 09:31:22,350 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 92 transitions. Word has length 20 [2018-12-09 09:31:22,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:31:22,350 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 92 transitions. [2018-12-09 09:31:22,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 09:31:22,350 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 92 transitions. [2018-12-09 09:31:22,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 09:31:22,351 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:31:22,351 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] [2018-12-09 09:31:22,352 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 09:31:22,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:31:22,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1166628565, now seen corresponding path program 1 times [2018-12-09 09:31:22,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:31:22,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:22,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:31:22,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:22,353 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:31:22,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:31:22,389 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 09:31:22,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:31:22,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 09:31:22,389 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:31:22,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 09:31:22,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 09:31:22,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:31:22,390 INFO L87 Difference]: Start difference. First operand 79 states and 92 transitions. Second operand 4 states. [2018-12-09 09:31:22,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:31:22,473 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2018-12-09 09:31:22,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 09:31:22,473 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-12-09 09:31:22,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:31:22,474 INFO L225 Difference]: With dead ends: 112 [2018-12-09 09:31:22,474 INFO L226 Difference]: Without dead ends: 111 [2018-12-09 09:31:22,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:31:22,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-09 09:31:22,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 98. [2018-12-09 09:31:22,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-09 09:31:22,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 116 transitions. [2018-12-09 09:31:22,481 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 116 transitions. Word has length 20 [2018-12-09 09:31:22,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:31:22,481 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 116 transitions. [2018-12-09 09:31:22,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 09:31:22,482 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 116 transitions. [2018-12-09 09:31:22,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 09:31:22,482 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:31:22,482 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, 1] [2018-12-09 09:31:22,483 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 09:31:22,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:31:22,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1670185029, now seen corresponding path program 1 times [2018-12-09 09:31:22,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:31:22,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:22,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:31:22,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:22,485 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:31:22,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:31:22,517 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 09:31:22,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:31:22,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 09:31:22,518 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:31:22,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 09:31:22,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 09:31:22,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:31:22,519 INFO L87 Difference]: Start difference. First operand 98 states and 116 transitions. Second operand 5 states. [2018-12-09 09:31:22,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:31:22,530 INFO L93 Difference]: Finished difference Result 97 states and 114 transitions. [2018-12-09 09:31:22,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 09:31:22,530 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-12-09 09:31:22,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:31:22,531 INFO L225 Difference]: With dead ends: 97 [2018-12-09 09:31:22,531 INFO L226 Difference]: Without dead ends: 97 [2018-12-09 09:31:22,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:31:22,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-09 09:31:22,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-12-09 09:31:22,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-09 09:31:22,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 114 transitions. [2018-12-09 09:31:22,536 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 114 transitions. Word has length 22 [2018-12-09 09:31:22,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:31:22,537 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 114 transitions. [2018-12-09 09:31:22,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 09:31:22,537 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 114 transitions. [2018-12-09 09:31:22,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 09:31:22,537 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:31:22,537 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, 1] [2018-12-09 09:31:22,538 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 09:31:22,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:31:22,538 INFO L82 PathProgramCache]: Analyzing trace with hash 143536354, now seen corresponding path program 1 times [2018-12-09 09:31:22,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:31:22,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:22,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:31:22,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:22,540 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:31:22,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:31:22,574 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 09:31:22,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:31:22,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 09:31:22,574 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:31:22,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:31:22,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:31:22,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:31:22,575 INFO L87 Difference]: Start difference. First operand 97 states and 114 transitions. Second operand 6 states. [2018-12-09 09:31:22,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:31:22,688 INFO L93 Difference]: Finished difference Result 114 states and 132 transitions. [2018-12-09 09:31:22,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 09:31:22,689 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-12-09 09:31:22,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:31:22,690 INFO L225 Difference]: With dead ends: 114 [2018-12-09 09:31:22,690 INFO L226 Difference]: Without dead ends: 114 [2018-12-09 09:31:22,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-12-09 09:31:22,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-09 09:31:22,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 103. [2018-12-09 09:31:22,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-09 09:31:22,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 124 transitions. [2018-12-09 09:31:22,695 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 124 transitions. Word has length 22 [2018-12-09 09:31:22,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:31:22,695 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 124 transitions. [2018-12-09 09:31:22,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:31:22,695 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 124 transitions. [2018-12-09 09:31:22,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 09:31:22,696 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:31:22,696 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, 1] [2018-12-09 09:31:22,696 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 09:31:22,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:31:22,696 INFO L82 PathProgramCache]: Analyzing trace with hash 143536355, now seen corresponding path program 1 times [2018-12-09 09:31:22,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:31:22,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:22,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:31:22,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:22,698 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:31:22,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:31:22,730 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 09:31:22,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:31:22,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 09:31:22,731 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:31:22,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:31:22,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:31:22,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:31:22,732 INFO L87 Difference]: Start difference. First operand 103 states and 124 transitions. Second operand 6 states. [2018-12-09 09:31:22,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:31:22,749 INFO L93 Difference]: Finished difference Result 107 states and 127 transitions. [2018-12-09 09:31:22,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 09:31:22,750 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-12-09 09:31:22,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:31:22,750 INFO L225 Difference]: With dead ends: 107 [2018-12-09 09:31:22,750 INFO L226 Difference]: Without dead ends: 103 [2018-12-09 09:31:22,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:31:22,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-09 09:31:22,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-12-09 09:31:22,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-09 09:31:22,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 123 transitions. [2018-12-09 09:31:22,756 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 123 transitions. Word has length 22 [2018-12-09 09:31:22,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:31:22,756 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 123 transitions. [2018-12-09 09:31:22,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:31:22,756 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 123 transitions. [2018-12-09 09:31:22,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 09:31:22,757 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:31:22,757 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, 1, 1] [2018-12-09 09:31:22,757 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 09:31:22,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:31:22,758 INFO L82 PathProgramCache]: Analyzing trace with hash -236128249, now seen corresponding path program 1 times [2018-12-09 09:31:22,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:31:22,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:22,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:31:22,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:22,759 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:31:22,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:31:22,785 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 09:31:22,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:31:22,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 09:31:22,785 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:31:22,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 09:31:22,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 09:31:22,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:31:22,786 INFO L87 Difference]: Start difference. First operand 103 states and 123 transitions. Second operand 5 states. [2018-12-09 09:31:22,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:31:22,836 INFO L93 Difference]: Finished difference Result 105 states and 122 transitions. [2018-12-09 09:31:22,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 09:31:22,837 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-12-09 09:31:22,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:31:22,837 INFO L225 Difference]: With dead ends: 105 [2018-12-09 09:31:22,838 INFO L226 Difference]: Without dead ends: 105 [2018-12-09 09:31:22,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:31:22,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-09 09:31:22,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2018-12-09 09:31:22,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-09 09:31:22,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 122 transitions. [2018-12-09 09:31:22,842 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 122 transitions. Word has length 23 [2018-12-09 09:31:22,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:31:22,843 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 122 transitions. [2018-12-09 09:31:22,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 09:31:22,843 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 122 transitions. [2018-12-09 09:31:22,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 09:31:22,843 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:31:22,843 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, 1, 1] [2018-12-09 09:31:22,843 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 09:31:22,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:31:22,844 INFO L82 PathProgramCache]: Analyzing trace with hash -529531256, now seen corresponding path program 1 times [2018-12-09 09:31:22,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:31:22,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:22,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:31:22,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:22,845 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:31:22,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:31:22,885 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 09:31:22,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:31:22,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 09:31:22,886 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:31:22,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 09:31:22,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 09:31:22,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:31:22,886 INFO L87 Difference]: Start difference. First operand 103 states and 122 transitions. Second operand 5 states. [2018-12-09 09:31:22,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:31:22,896 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2018-12-09 09:31:22,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 09:31:22,896 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-12-09 09:31:22,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:31:22,897 INFO L225 Difference]: With dead ends: 67 [2018-12-09 09:31:22,897 INFO L226 Difference]: Without dead ends: 63 [2018-12-09 09:31:22,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:31:22,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-09 09:31:22,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-09 09:31:22,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-09 09:31:22,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2018-12-09 09:31:22,901 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 23 [2018-12-09 09:31:22,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:31:22,901 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2018-12-09 09:31:22,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 09:31:22,901 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2018-12-09 09:31:22,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 09:31:22,902 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:31:22,902 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:31:22,903 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 09:31:22,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:31:22,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1166268303, now seen corresponding path program 1 times [2018-12-09 09:31:22,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:31:22,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:22,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:31:22,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:22,904 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:31:22,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:31:22,972 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 09:31:22,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:31:22,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 09:31:22,972 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:31:22,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 09:31:22,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 09:31:22,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:31:22,973 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand 7 states. [2018-12-09 09:31:23,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:31:23,117 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2018-12-09 09:31:23,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 09:31:23,117 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-12-09 09:31:23,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:31:23,118 INFO L225 Difference]: With dead ends: 72 [2018-12-09 09:31:23,118 INFO L226 Difference]: Without dead ends: 72 [2018-12-09 09:31:23,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-12-09 09:31:23,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-09 09:31:23,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 62. [2018-12-09 09:31:23,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-09 09:31:23,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2018-12-09 09:31:23,120 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 28 [2018-12-09 09:31:23,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:31:23,120 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2018-12-09 09:31:23,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 09:31:23,120 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-12-09 09:31:23,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 09:31:23,121 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:31:23,121 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:31:23,121 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 09:31:23,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:31:23,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1166268302, now seen corresponding path program 1 times [2018-12-09 09:31:23,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:31:23,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:23,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:31:23,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:23,122 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:31:23,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:31:23,175 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 09:31:23,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:31:23,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 09:31:23,176 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:31:23,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 09:31:23,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 09:31:23,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-09 09:31:23,176 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 8 states. [2018-12-09 09:31:23,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:31:23,308 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2018-12-09 09:31:23,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 09:31:23,309 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-12-09 09:31:23,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:31:23,309 INFO L225 Difference]: With dead ends: 60 [2018-12-09 09:31:23,309 INFO L226 Difference]: Without dead ends: 60 [2018-12-09 09:31:23,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-12-09 09:31:23,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-09 09:31:23,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-12-09 09:31:23,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-09 09:31:23,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2018-12-09 09:31:23,312 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 28 [2018-12-09 09:31:23,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:31:23,312 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2018-12-09 09:31:23,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 09:31:23,312 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-12-09 09:31:23,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 09:31:23,313 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:31:23,313 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:31:23,313 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 09:31:23,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:31:23,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1526427473, now seen corresponding path program 1 times [2018-12-09 09:31:23,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:31:23,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:23,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:31:23,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:23,314 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:31:23,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:31:23,393 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 09:31:23,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:31:23,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 09:31:23,393 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:31:23,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 09:31:23,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 09:31:23,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:31:23,394 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 7 states. [2018-12-09 09:31:23,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:31:23,519 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2018-12-09 09:31:23,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 09:31:23,520 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-12-09 09:31:23,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:31:23,520 INFO L225 Difference]: With dead ends: 64 [2018-12-09 09:31:23,520 INFO L226 Difference]: Without dead ends: 60 [2018-12-09 09:31:23,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-12-09 09:31:23,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-09 09:31:23,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-12-09 09:31:23,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-09 09:31:23,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-12-09 09:31:23,522 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 28 [2018-12-09 09:31:23,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:31:23,522 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-12-09 09:31:23,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 09:31:23,522 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-12-09 09:31:23,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 09:31:23,523 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:31:23,523 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:31:23,523 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 09:31:23,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:31:23,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1981964285, now seen corresponding path program 1 times [2018-12-09 09:31:23,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:31:23,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:23,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:31:23,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:23,524 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:31:23,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:31:23,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 09:31:23,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:31:23,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 09:31:23,568 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:31:23,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:31:23,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:31:23,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:31:23,569 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 6 states. [2018-12-09 09:31:23,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:31:23,584 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2018-12-09 09:31:23,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 09:31:23,584 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-12-09 09:31:23,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:31:23,584 INFO L225 Difference]: With dead ends: 58 [2018-12-09 09:31:23,585 INFO L226 Difference]: Without dead ends: 52 [2018-12-09 09:31:23,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:31:23,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-09 09:31:23,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2018-12-09 09:31:23,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-09 09:31:23,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-12-09 09:31:23,587 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 30 [2018-12-09 09:31:23,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:31:23,587 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-12-09 09:31:23,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:31:23,587 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-12-09 09:31:23,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 09:31:23,588 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:31:23,588 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:31:23,588 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 09:31:23,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:31:23,588 INFO L82 PathProgramCache]: Analyzing trace with hash -853745354, now seen corresponding path program 1 times [2018-12-09 09:31:23,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:31:23,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:23,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:31:23,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:23,589 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:31:23,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:31:23,646 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 09:31:23,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:31:23,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 09:31:23,647 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:31:23,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 09:31:23,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 09:31:23,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 09:31:23,647 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 8 states. [2018-12-09 09:31:23,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:31:23,744 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-12-09 09:31:23,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 09:31:23,744 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2018-12-09 09:31:23,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:31:23,744 INFO L225 Difference]: With dead ends: 49 [2018-12-09 09:31:23,744 INFO L226 Difference]: Without dead ends: 49 [2018-12-09 09:31:23,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-12-09 09:31:23,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-09 09:31:23,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-09 09:31:23,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-09 09:31:23,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-12-09 09:31:23,747 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 36 [2018-12-09 09:31:23,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:31:23,747 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-12-09 09:31:23,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 09:31:23,747 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-12-09 09:31:23,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-09 09:31:23,748 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:31:23,748 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:31:23,748 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 09:31:23,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:31:23,749 INFO L82 PathProgramCache]: Analyzing trace with hash -696302238, now seen corresponding path program 1 times [2018-12-09 09:31:23,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:31:23,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:23,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:31:23,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:23,750 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:31:23,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:31:23,832 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 09:31:23,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:31:23,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 09:31:23,833 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:31:23,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 09:31:23,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 09:31:23,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-12-09 09:31:23,833 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 11 states. [2018-12-09 09:31:23,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:31:23,951 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-12-09 09:31:23,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 09:31:23,951 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2018-12-09 09:31:23,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:31:23,951 INFO L225 Difference]: With dead ends: 48 [2018-12-09 09:31:23,951 INFO L226 Difference]: Without dead ends: 48 [2018-12-09 09:31:23,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2018-12-09 09:31:23,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-09 09:31:23,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-12-09 09:31:23,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-09 09:31:23,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-12-09 09:31:23,953 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 37 [2018-12-09 09:31:23,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:31:23,953 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-12-09 09:31:23,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 09:31:23,953 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-12-09 09:31:23,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-09 09:31:23,954 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:31:23,954 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:31:23,954 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 09:31:23,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:31:23,954 INFO L82 PathProgramCache]: Analyzing trace with hash -694761124, now seen corresponding path program 1 times [2018-12-09 09:31:23,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:31:23,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:23,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:31:23,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:23,956 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:31:23,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:31:23,975 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 09:31:23,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:31:23,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 09:31:23,975 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:31:23,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 09:31:23,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 09:31:23,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:31:23,976 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 5 states. [2018-12-09 09:31:23,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:31:23,979 INFO L93 Difference]: Finished difference Result 47 states and 46 transitions. [2018-12-09 09:31:23,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 09:31:23,979 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-12-09 09:31:23,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:31:23,979 INFO L225 Difference]: With dead ends: 47 [2018-12-09 09:31:23,979 INFO L226 Difference]: Without dead ends: 47 [2018-12-09 09:31:23,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:31:23,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-09 09:31:23,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-09 09:31:23,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-09 09:31:23,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 46 transitions. [2018-12-09 09:31:23,981 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 46 transitions. Word has length 37 [2018-12-09 09:31:23,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:31:23,981 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 46 transitions. [2018-12-09 09:31:23,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 09:31:23,981 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 46 transitions. [2018-12-09 09:31:23,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-09 09:31:23,981 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:31:23,981 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:31:23,982 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 09:31:23,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:31:23,982 INFO L82 PathProgramCache]: Analyzing trace with hash -110532843, now seen corresponding path program 1 times [2018-12-09 09:31:23,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:31:23,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:23,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:31:23,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:23,983 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:31:23,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:31:24,054 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 09:31:24,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:31:24,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 09:31:24,054 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:31:24,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 09:31:24,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 09:31:24,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-12-09 09:31:24,055 INFO L87 Difference]: Start difference. First operand 47 states and 46 transitions. Second operand 11 states. [2018-12-09 09:31:24,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:31:24,131 INFO L93 Difference]: Finished difference Result 46 states and 45 transitions. [2018-12-09 09:31:24,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 09:31:24,131 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2018-12-09 09:31:24,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:31:24,131 INFO L225 Difference]: With dead ends: 46 [2018-12-09 09:31:24,131 INFO L226 Difference]: Without dead ends: 46 [2018-12-09 09:31:24,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-12-09 09:31:24,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-09 09:31:24,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-12-09 09:31:24,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-09 09:31:24,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 45 transitions. [2018-12-09 09:31:24,133 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 45 transitions. Word has length 38 [2018-12-09 09:31:24,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:31:24,134 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 45 transitions. [2018-12-09 09:31:24,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 09:31:24,134 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 45 transitions. [2018-12-09 09:31:24,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-09 09:31:24,134 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:31:24,134 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:31:24,135 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 09:31:24,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:31:24,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1356047482, now seen corresponding path program 1 times [2018-12-09 09:31:24,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:31:24,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:24,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:31:24,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:24,136 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:31:24,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:31:24,220 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 09:31:24,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:31:24,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 09:31:24,220 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:31:24,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 09:31:24,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 09:31:24,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-12-09 09:31:24,221 INFO L87 Difference]: Start difference. First operand 46 states and 45 transitions. Second operand 13 states. [2018-12-09 09:31:24,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:31:24,474 INFO L93 Difference]: Finished difference Result 45 states and 44 transitions. [2018-12-09 09:31:24,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 09:31:24,474 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 41 [2018-12-09 09:31:24,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:31:24,474 INFO L225 Difference]: With dead ends: 45 [2018-12-09 09:31:24,474 INFO L226 Difference]: Without dead ends: 45 [2018-12-09 09:31:24,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2018-12-09 09:31:24,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-09 09:31:24,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-09 09:31:24,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-09 09:31:24,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 44 transitions. [2018-12-09 09:31:24,476 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 44 transitions. Word has length 41 [2018-12-09 09:31:24,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:31:24,476 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 44 transitions. [2018-12-09 09:31:24,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 09:31:24,476 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 44 transitions. [2018-12-09 09:31:24,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-09 09:31:24,477 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:31:24,477 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:31:24,477 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, probe1_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe1_6Err1REQUIRES_VIOLATION, probe1_6Err0REQUIRES_VIOLATION, probe1_6Err3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 09:31:24,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:31:24,478 INFO L82 PathProgramCache]: Analyzing trace with hash -451840023, now seen corresponding path program 1 times [2018-12-09 09:31:24,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:31:24,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:24,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:31:24,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:31:24,479 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:31:24,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:31:24,590 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 09:31:24,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:31:24,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 09:31:24,590 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:31:24,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 09:31:24,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 09:31:24,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-12-09 09:31:24,591 INFO L87 Difference]: Start difference. First operand 45 states and 44 transitions. Second operand 12 states. [2018-12-09 09:31:24,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:31:24,752 INFO L93 Difference]: Finished difference Result 44 states and 43 transitions. [2018-12-09 09:31:24,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 09:31:24,752 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 44 [2018-12-09 09:31:24,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:31:24,753 INFO L225 Difference]: With dead ends: 44 [2018-12-09 09:31:24,753 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 09:31:24,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-12-09 09:31:24,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 09:31:24,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 09:31:24,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 09:31:24,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 09:31:24,754 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2018-12-09 09:31:24,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:31:24,754 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 09:31:24,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 09:31:24,754 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 09:31:24,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 09:31:24,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 09:31:24 BoogieIcfgContainer [2018-12-09 09:31:24,758 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 09:31:24,758 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 09:31:24,758 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 09:31:24,758 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 09:31:24,759 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:31:21" (3/4) ... [2018-12-09 09:31:24,761 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 09:31:24,765 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f6 [2018-12-09 09:31:24,765 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2018-12-09 09:31:24,765 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 09:31:24,766 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 09:31:24,766 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure disconnect_6 [2018-12-09 09:31:24,766 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure entry_point [2018-12-09 09:31:24,766 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure g6 [2018-12-09 09:31:24,766 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure probe1_6 [2018-12-09 09:31:24,769 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2018-12-09 09:31:24,769 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-09 09:31:24,769 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-09 09:31:24,797 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_4a3ad401-9d0a-4c96-9006-9d5486e8e544/bin-2019/utaipan/witness.graphml [2018-12-09 09:31:24,797 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 09:31:24,798 INFO L168 Benchmark]: Toolchain (without parser) took 3411.37 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 228.6 MB). Free memory was 948.1 MB in the beginning and 829.7 MB in the end (delta: 118.4 MB). Peak memory consumption was 347.0 MB. Max. memory is 11.5 GB. [2018-12-09 09:31:24,799 INFO L168 Benchmark]: CDTParser took 0.14 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 09:31:24,799 INFO L168 Benchmark]: CACSL2BoogieTranslator took 334.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -186.2 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. [2018-12-09 09:31:24,799 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.45 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 09:31:24,799 INFO L168 Benchmark]: Boogie Preprocessor took 15.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2018-12-09 09:31:24,800 INFO L168 Benchmark]: RCFGBuilder took 189.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. [2018-12-09 09:31:24,800 INFO L168 Benchmark]: TraceAbstraction took 2809.03 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 66.1 MB). Free memory was 1.1 GB in the beginning and 837.3 MB in the end (delta: 266.8 MB). Peak memory consumption was 332.9 MB. Max. memory is 11.5 GB. [2018-12-09 09:31:24,800 INFO L168 Benchmark]: Witness Printer took 39.29 ms. Allocated memory is still 1.3 GB. Free memory was 837.3 MB in the beginning and 829.7 MB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 11.5 GB. [2018-12-09 09:31:24,802 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 334.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -186.2 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.45 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 189.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2809.03 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 66.1 MB). Free memory was 1.1 GB in the beginning and 837.3 MB in the end (delta: 266.8 MB). Peak memory consumption was 332.9 MB. Max. memory is 11.5 GB. * Witness Printer took 39.29 ms. Allocated memory is still 1.3 GB. Free memory was 837.3 MB in the beginning and 829.7 MB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1476]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1462]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1462]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1462]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1462]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1473]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1473]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1457]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1453]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1453]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1457]: free always succeeds For all program executions holds that free always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 11 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 60 locations, 11 error locations. SAFE Result, 2.7s OverallTime, 18 OverallIterations, 1 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 885 SDtfs, 743 SDslu, 2318 SDs, 0 SdLazy, 1555 SolverSat, 213 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 213 GetRequests, 59 SyntacticMatches, 7 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=5, 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, 18 MinimizatonAttempts, 71 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 519 NumberOfCodeBlocks, 519 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 501 ConstructedInterpolants, 0 QuantifiedInterpolants, 85200 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...