./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test7-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0bef2489-198f-4a3e-8ac5-ef1868209934/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0bef2489-198f-4a3e-8ac5-ef1868209934/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0bef2489-198f-4a3e-8ac5-ef1868209934/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0bef2489-198f-4a3e-8ac5-ef1868209934/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test7-2.i -s /tmp/vcloud-vcloud-master/worker/working_dir_0bef2489-198f-4a3e-8ac5-ef1868209934/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0bef2489-198f-4a3e-8ac5-ef1868209934/bin/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 e7145593e932ded499c4cd66a2795ff7414b2aa6 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 11:25:00,721 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:25:00,722 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:25:00,733 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:25:00,734 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:25:00,735 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:25:00,736 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:25:00,738 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:25:00,739 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:25:00,740 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:25:00,741 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:25:00,742 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:25:00,742 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:25:00,743 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:25:00,744 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:25:00,745 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:25:00,746 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:25:00,747 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:25:00,749 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:25:00,751 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:25:00,752 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:25:00,753 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:25:00,754 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:25:00,755 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:25:00,757 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:25:00,757 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:25:00,757 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:25:00,758 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:25:00,759 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:25:00,759 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:25:00,760 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:25:00,760 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:25:00,761 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:25:00,762 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:25:00,763 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:25:00,763 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:25:00,763 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:25:00,764 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:25:00,764 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:25:00,765 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:25:00,765 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:25:00,766 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0bef2489-198f-4a3e-8ac5-ef1868209934/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2019-10-22 11:25:00,779 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:25:00,779 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:25:00,780 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:25:00,780 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:25:00,780 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:25:00,780 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:25:00,781 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:25:00,781 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:25:00,781 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:25:00,781 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:25:00,781 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:25:00,781 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:25:00,782 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 11:25:00,783 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 11:25:00,783 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:25:00,783 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:25:00,783 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 11:25:00,783 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:25:00,784 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:25:00,784 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:25:00,784 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-10-22 11:25:00,784 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-10-22 11:25:00,784 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-10-22 11:25:00,785 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:25:00,785 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:25:00,785 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:25:00,785 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:25:00,785 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:25:00,785 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:25:00,786 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:25:00,786 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:25:00,786 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:25:00,786 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:25:00,787 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:25:00,787 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:25:00,787 INFO L138 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_0bef2489-198f-4a3e-8ac5-ef1868209934/bin/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 -> e7145593e932ded499c4cd66a2795ff7414b2aa6 [2019-10-22 11:25:00,820 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:25:00,831 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:25:00,835 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:25:00,836 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:25:00,836 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:25:00,837 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0bef2489-198f-4a3e-8ac5-ef1868209934/bin/utaipan/../../sv-benchmarks/c/ldv-memsafety/memleaks_test7-2.i [2019-10-22 11:25:00,894 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0bef2489-198f-4a3e-8ac5-ef1868209934/bin/utaipan/data/c27ed29ff/ca25fc3425884779ba78d243c3f42464/FLAGa056c9f4c [2019-10-22 11:25:01,366 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:25:01,367 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0bef2489-198f-4a3e-8ac5-ef1868209934/sv-benchmarks/c/ldv-memsafety/memleaks_test7-2.i [2019-10-22 11:25:01,380 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0bef2489-198f-4a3e-8ac5-ef1868209934/bin/utaipan/data/c27ed29ff/ca25fc3425884779ba78d243c3f42464/FLAGa056c9f4c [2019-10-22 11:25:01,395 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0bef2489-198f-4a3e-8ac5-ef1868209934/bin/utaipan/data/c27ed29ff/ca25fc3425884779ba78d243c3f42464 [2019-10-22 11:25:01,399 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:25:01,400 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:25:01,401 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:25:01,401 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:25:01,405 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:25:01,406 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:25:01" (1/1) ... [2019-10-22 11:25:01,408 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b5b4910 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:01, skipping insertion in model container [2019-10-22 11:25:01,409 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:25:01" (1/1) ... [2019-10-22 11:25:01,416 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:25:01,468 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:25:01,980 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:25:01,997 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:25:02,068 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:25:02,145 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:25:02,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:02 WrapperNode [2019-10-22 11:25:02,146 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:25:02,147 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:25:02,147 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:25:02,147 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:25:02,156 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:02" (1/1) ... [2019-10-22 11:25:02,179 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:02" (1/1) ... [2019-10-22 11:25:02,201 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:25:02,202 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:25:02,202 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:25:02,202 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:25:02,211 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:02" (1/1) ... [2019-10-22 11:25:02,211 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:02" (1/1) ... [2019-10-22 11:25:02,214 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:02" (1/1) ... [2019-10-22 11:25:02,214 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:02" (1/1) ... [2019-10-22 11:25:02,221 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:02" (1/1) ... [2019-10-22 11:25:02,223 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:02" (1/1) ... [2019-10-22 11:25:02,225 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:02" (1/1) ... [2019-10-22 11:25:02,227 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:25:02,228 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:25:02,228 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:25:02,228 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:25:02,229 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0bef2489-198f-4a3e-8ac5-ef1868209934/bin/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 [2019-10-22 11:25:02,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 11:25:02,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 11:25:02,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:25:02,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 11:25:02,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 11:25:02,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-22 11:25:02,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:25:02,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:25:02,605 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:25:02,606 INFO L284 CfgBuilder]: Removed 16 assume(true) statements. [2019-10-22 11:25:02,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:25:02 BoogieIcfgContainer [2019-10-22 11:25:02,607 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:25:02,608 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:25:02,608 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:25:02,612 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:25:02,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:25:01" (1/3) ... [2019-10-22 11:25:02,613 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@450ca8ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:25:02, skipping insertion in model container [2019-10-22 11:25:02,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:02" (2/3) ... [2019-10-22 11:25:02,613 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@450ca8ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:25:02, skipping insertion in model container [2019-10-22 11:25:02,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:25:02" (3/3) ... [2019-10-22 11:25:02,615 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test7-2.i [2019-10-22 11:25:02,625 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:25:02,633 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2019-10-22 11:25:02,645 INFO L249 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2019-10-22 11:25:02,667 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:25:02,667 INFO L374 AbstractCegarLoop]: Hoare is false [2019-10-22 11:25:02,667 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:25:02,668 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:25:02,668 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:25:02,668 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:25:02,668 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:25:02,668 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:25:02,686 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2019-10-22 11:25:02,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-10-22 11:25:02,702 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:02,703 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:02,705 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:25:02,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:02,713 INFO L82 PathProgramCache]: Analyzing trace with hash 119408646, now seen corresponding path program 1 times [2019-10-22 11:25:02,727 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:02,727 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796783789] [2019-10-22 11:25:02,728 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:02,728 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:02,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:02,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:02,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:02,941 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796783789] [2019-10-22 11:25:02,942 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:02,943 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:25:02,943 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166363440] [2019-10-22 11:25:02,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:25:02,956 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:02,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:25:02,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:25:02,977 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 4 states. [2019-10-22 11:25:03,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:03,089 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2019-10-22 11:25:03,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:25:03,093 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-10-22 11:25:03,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:03,102 INFO L225 Difference]: With dead ends: 67 [2019-10-22 11:25:03,104 INFO L226 Difference]: Without dead ends: 63 [2019-10-22 11:25:03,106 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:25:03,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-22 11:25:03,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 35. [2019-10-22 11:25:03,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-22 11:25:03,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-10-22 11:25:03,139 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 8 [2019-10-22 11:25:03,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:03,139 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-10-22 11:25:03,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:25:03,139 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-10-22 11:25:03,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-10-22 11:25:03,140 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:03,140 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:03,140 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:25:03,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:03,140 INFO L82 PathProgramCache]: Analyzing trace with hash 119443416, now seen corresponding path program 1 times [2019-10-22 11:25:03,141 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:03,141 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991692993] [2019-10-22 11:25:03,141 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:03,141 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:03,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:03,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:03,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:03,191 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991692993] [2019-10-22 11:25:03,191 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:03,191 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:25:03,191 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094665342] [2019-10-22 11:25:03,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:25:03,193 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:03,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:25:03,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:25:03,194 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 4 states. [2019-10-22 11:25:03,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:03,236 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2019-10-22 11:25:03,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:25:03,236 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-10-22 11:25:03,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:03,237 INFO L225 Difference]: With dead ends: 34 [2019-10-22 11:25:03,237 INFO L226 Difference]: Without dead ends: 34 [2019-10-22 11:25:03,238 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:25:03,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-22 11:25:03,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-10-22 11:25:03,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-22 11:25:03,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-10-22 11:25:03,241 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 8 [2019-10-22 11:25:03,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:03,241 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-10-22 11:25:03,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:25:03,241 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-10-22 11:25:03,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-10-22 11:25:03,241 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:03,241 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:03,242 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:25:03,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:03,242 INFO L82 PathProgramCache]: Analyzing trace with hash 176666948, now seen corresponding path program 1 times [2019-10-22 11:25:03,242 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:03,242 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763918141] [2019-10-22 11:25:03,243 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:03,243 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:03,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:03,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:03,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:03,295 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763918141] [2019-10-22 11:25:03,296 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:03,296 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:25:03,296 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076001828] [2019-10-22 11:25:03,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:25:03,297 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:03,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:25:03,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:25:03,297 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 4 states. [2019-10-22 11:25:03,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:03,361 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2019-10-22 11:25:03,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:25:03,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-10-22 11:25:03,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:03,362 INFO L225 Difference]: With dead ends: 45 [2019-10-22 11:25:03,363 INFO L226 Difference]: Without dead ends: 45 [2019-10-22 11:25:03,363 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:25:03,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-22 11:25:03,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2019-10-22 11:25:03,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-22 11:25:03,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2019-10-22 11:25:03,367 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 8 [2019-10-22 11:25:03,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:03,367 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2019-10-22 11:25:03,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:25:03,368 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2019-10-22 11:25:03,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-10-22 11:25:03,368 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:03,368 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:03,369 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:25:03,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:03,369 INFO L82 PathProgramCache]: Analyzing trace with hash 176666949, now seen corresponding path program 1 times [2019-10-22 11:25:03,369 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:03,369 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669952279] [2019-10-22 11:25:03,369 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:03,370 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:03,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:03,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:03,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:03,416 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669952279] [2019-10-22 11:25:03,416 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:03,417 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:25:03,417 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545747060] [2019-10-22 11:25:03,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:25:03,417 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:03,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:25:03,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:25:03,418 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand 5 states. [2019-10-22 11:25:03,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:03,511 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2019-10-22 11:25:03,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:25:03,513 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-10-22 11:25:03,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:03,513 INFO L225 Difference]: With dead ends: 42 [2019-10-22 11:25:03,514 INFO L226 Difference]: Without dead ends: 42 [2019-10-22 11:25:03,514 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:25:03,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-22 11:25:03,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2019-10-22 11:25:03,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-22 11:25:03,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2019-10-22 11:25:03,517 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 8 [2019-10-22 11:25:03,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:03,518 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2019-10-22 11:25:03,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:25:03,518 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2019-10-22 11:25:03,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-10-22 11:25:03,520 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:03,520 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:03,521 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:25:03,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:03,522 INFO L82 PathProgramCache]: Analyzing trace with hash -592221333, now seen corresponding path program 1 times [2019-10-22 11:25:03,523 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:03,523 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826625813] [2019-10-22 11:25:03,524 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:03,524 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:03,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:03,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:03,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:03,618 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826625813] [2019-10-22 11:25:03,618 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:03,618 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:25:03,618 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246145795] [2019-10-22 11:25:03,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:25:03,619 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:03,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:25:03,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:25:03,619 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand 4 states. [2019-10-22 11:25:03,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:03,687 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2019-10-22 11:25:03,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:25:03,687 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-10-22 11:25:03,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:03,688 INFO L225 Difference]: With dead ends: 78 [2019-10-22 11:25:03,688 INFO L226 Difference]: Without dead ends: 78 [2019-10-22 11:25:03,688 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:25:03,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-22 11:25:03,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 45. [2019-10-22 11:25:03,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-22 11:25:03,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2019-10-22 11:25:03,693 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 9 [2019-10-22 11:25:03,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:03,693 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2019-10-22 11:25:03,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:25:03,694 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2019-10-22 11:25:03,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-10-22 11:25:03,694 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:03,694 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:03,695 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:25:03,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:03,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1181720057, now seen corresponding path program 1 times [2019-10-22 11:25:03,695 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:03,695 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497635881] [2019-10-22 11:25:03,696 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:03,696 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:03,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:03,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:03,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:03,782 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497635881] [2019-10-22 11:25:03,782 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:03,782 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:25:03,782 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764601404] [2019-10-22 11:25:03,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:25:03,783 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:03,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:25:03,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:25:03,783 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand 4 states. [2019-10-22 11:25:03,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:03,844 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2019-10-22 11:25:03,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:25:03,844 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-10-22 11:25:03,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:03,846 INFO L225 Difference]: With dead ends: 63 [2019-10-22 11:25:03,847 INFO L226 Difference]: Without dead ends: 59 [2019-10-22 11:25:03,847 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:25:03,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-10-22 11:25:03,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 47. [2019-10-22 11:25:03,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-22 11:25:03,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2019-10-22 11:25:03,855 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 9 [2019-10-22 11:25:03,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:03,855 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2019-10-22 11:25:03,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:25:03,856 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2019-10-22 11:25:03,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-10-22 11:25:03,856 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:03,856 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:03,856 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:25:03,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:03,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1182786029, now seen corresponding path program 1 times [2019-10-22 11:25:03,857 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:03,857 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315824105] [2019-10-22 11:25:03,857 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:03,857 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:03,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:03,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:03,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:03,896 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315824105] [2019-10-22 11:25:03,896 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:03,896 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:25:03,896 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154957600] [2019-10-22 11:25:03,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:25:03,897 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:03,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:25:03,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:25:03,898 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand 4 states. [2019-10-22 11:25:03,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:03,927 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2019-10-22 11:25:03,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:25:03,928 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-10-22 11:25:03,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:03,928 INFO L225 Difference]: With dead ends: 36 [2019-10-22 11:25:03,928 INFO L226 Difference]: Without dead ends: 34 [2019-10-22 11:25:03,929 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:25:03,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-22 11:25:03,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-10-22 11:25:03,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-22 11:25:03,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-10-22 11:25:03,931 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 9 [2019-10-22 11:25:03,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:03,932 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-10-22 11:25:03,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:25:03,932 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-10-22 11:25:03,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-22 11:25:03,932 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:03,932 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:03,933 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:25:03,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:03,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1178992070, now seen corresponding path program 1 times [2019-10-22 11:25:03,933 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:03,933 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387442295] [2019-10-22 11:25:03,933 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:03,934 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:03,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:03,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:03,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:03,965 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387442295] [2019-10-22 11:25:03,965 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:03,965 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:25:03,965 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909020144] [2019-10-22 11:25:03,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:25:03,966 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:03,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:25:03,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:25:03,967 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 4 states. [2019-10-22 11:25:04,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:04,022 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2019-10-22 11:25:04,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:25:04,023 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-10-22 11:25:04,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:04,023 INFO L225 Difference]: With dead ends: 41 [2019-10-22 11:25:04,023 INFO L226 Difference]: Without dead ends: 41 [2019-10-22 11:25:04,024 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:25:04,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-22 11:25:04,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2019-10-22 11:25:04,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-22 11:25:04,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-10-22 11:25:04,027 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 10 [2019-10-22 11:25:04,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:04,027 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-10-22 11:25:04,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:25:04,027 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-10-22 11:25:04,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-22 11:25:04,028 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:04,028 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:04,028 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:25:04,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:04,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1178944307, now seen corresponding path program 1 times [2019-10-22 11:25:04,029 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:04,029 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729663329] [2019-10-22 11:25:04,029 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:04,029 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:04,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:04,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:04,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:04,061 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729663329] [2019-10-22 11:25:04,062 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:04,062 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:25:04,062 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068506241] [2019-10-22 11:25:04,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:04,063 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:04,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:04,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:04,064 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 3 states. [2019-10-22 11:25:04,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:04,097 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2019-10-22 11:25:04,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:04,097 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-10-22 11:25:04,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:04,098 INFO L225 Difference]: With dead ends: 40 [2019-10-22 11:25:04,098 INFO L226 Difference]: Without dead ends: 40 [2019-10-22 11:25:04,098 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:04,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-22 11:25:04,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 32. [2019-10-22 11:25:04,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-22 11:25:04,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-10-22 11:25:04,102 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 10 [2019-10-22 11:25:04,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:04,102 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-10-22 11:25:04,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:04,102 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-10-22 11:25:04,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-22 11:25:04,103 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:04,103 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:04,104 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:25:04,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:04,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1178944306, now seen corresponding path program 1 times [2019-10-22 11:25:04,104 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:04,105 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440169262] [2019-10-22 11:25:04,105 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:04,105 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:04,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:04,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:04,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:04,173 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440169262] [2019-10-22 11:25:04,173 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:04,173 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:25:04,174 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496780167] [2019-10-22 11:25:04,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:25:04,174 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:04,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:25:04,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:25:04,175 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 4 states. [2019-10-22 11:25:04,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:04,217 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2019-10-22 11:25:04,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:25:04,218 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-10-22 11:25:04,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:04,219 INFO L225 Difference]: With dead ends: 39 [2019-10-22 11:25:04,219 INFO L226 Difference]: Without dead ends: 39 [2019-10-22 11:25:04,219 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:25:04,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-22 11:25:04,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 31. [2019-10-22 11:25:04,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-22 11:25:04,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-10-22 11:25:04,222 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 10 [2019-10-22 11:25:04,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:04,223 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-10-22 11:25:04,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:25:04,223 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-10-22 11:25:04,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-22 11:25:04,224 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:04,224 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:04,224 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:25:04,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:04,225 INFO L82 PathProgramCache]: Analyzing trace with hash 889859920, now seen corresponding path program 1 times [2019-10-22 11:25:04,225 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:04,225 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524953975] [2019-10-22 11:25:04,225 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:04,226 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:04,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:04,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:04,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:04,302 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524953975] [2019-10-22 11:25:04,302 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:04,302 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:25:04,302 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852556045] [2019-10-22 11:25:04,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:25:04,303 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:04,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:25:04,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:25:04,304 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 5 states. [2019-10-22 11:25:04,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:04,360 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2019-10-22 11:25:04,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:25:04,363 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-10-22 11:25:04,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:04,363 INFO L225 Difference]: With dead ends: 32 [2019-10-22 11:25:04,363 INFO L226 Difference]: Without dead ends: 32 [2019-10-22 11:25:04,364 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:25:04,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-10-22 11:25:04,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2019-10-22 11:25:04,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-22 11:25:04,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2019-10-22 11:25:04,369 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 13 [2019-10-22 11:25:04,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:04,370 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2019-10-22 11:25:04,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:25:04,370 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2019-10-22 11:25:04,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-22 11:25:04,370 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:04,371 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:04,371 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:25:04,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:04,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1815865709, now seen corresponding path program 1 times [2019-10-22 11:25:04,372 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:04,372 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31351319] [2019-10-22 11:25:04,372 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:04,372 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:04,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:04,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:04,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:04,572 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31351319] [2019-10-22 11:25:04,572 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:04,572 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:25:04,573 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769931357] [2019-10-22 11:25:04,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 11:25:04,573 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:04,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 11:25:04,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:25:04,574 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 7 states. [2019-10-22 11:25:04,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:04,715 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2019-10-22 11:25:04,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:25:04,715 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-10-22 11:25:04,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:04,716 INFO L225 Difference]: With dead ends: 32 [2019-10-22 11:25:04,716 INFO L226 Difference]: Without dead ends: 25 [2019-10-22 11:25:04,717 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:25:04,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-10-22 11:25:04,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-10-22 11:25:04,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-22 11:25:04,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-10-22 11:25:04,722 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 14 [2019-10-22 11:25:04,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:04,722 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-10-22 11:25:04,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 11:25:04,723 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-10-22 11:25:04,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-22 11:25:04,723 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:04,723 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:04,724 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:25:04,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:04,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1320771048, now seen corresponding path program 1 times [2019-10-22 11:25:04,724 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:04,725 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588921466] [2019-10-22 11:25:04,725 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:04,725 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:04,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:04,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:04,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:04,818 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588921466] [2019-10-22 11:25:04,818 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:04,818 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:25:04,818 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951817610] [2019-10-22 11:25:04,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:25:04,819 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:04,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:25:04,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:25:04,819 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 5 states. [2019-10-22 11:25:04,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:04,872 INFO L93 Difference]: Finished difference Result 26 states and 25 transitions. [2019-10-22 11:25:04,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:25:04,873 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-10-22 11:25:04,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:04,874 INFO L225 Difference]: With dead ends: 26 [2019-10-22 11:25:04,874 INFO L226 Difference]: Without dead ends: 26 [2019-10-22 11:25:04,874 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:25:04,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-22 11:25:04,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2019-10-22 11:25:04,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-22 11:25:04,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-10-22 11:25:04,876 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 14 [2019-10-22 11:25:04,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:04,877 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-10-22 11:25:04,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:25:04,877 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-10-22 11:25:04,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-22 11:25:04,877 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:04,877 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:04,878 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:25:04,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:04,878 INFO L82 PathProgramCache]: Analyzing trace with hash 2005782406, now seen corresponding path program 1 times [2019-10-22 11:25:04,879 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:04,879 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330341655] [2019-10-22 11:25:04,879 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:04,879 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:04,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:04,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:04,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:04,906 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330341655] [2019-10-22 11:25:04,906 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:04,906 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:25:04,906 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438426613] [2019-10-22 11:25:04,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:25:04,907 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:04,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:25:04,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:25:04,907 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 4 states. [2019-10-22 11:25:04,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:04,920 INFO L93 Difference]: Finished difference Result 23 states and 22 transitions. [2019-10-22 11:25:04,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:25:04,921 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-10-22 11:25:04,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:04,921 INFO L225 Difference]: With dead ends: 23 [2019-10-22 11:25:04,921 INFO L226 Difference]: Without dead ends: 23 [2019-10-22 11:25:04,922 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:25:04,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-10-22 11:25:04,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-10-22 11:25:04,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-22 11:25:04,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 22 transitions. [2019-10-22 11:25:04,924 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 22 transitions. Word has length 15 [2019-10-22 11:25:04,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:04,924 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 22 transitions. [2019-10-22 11:25:04,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:25:04,924 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 22 transitions. [2019-10-22 11:25:04,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-22 11:25:04,925 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:04,925 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:04,925 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:25:04,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:04,926 INFO L82 PathProgramCache]: Analyzing trace with hash 2005770458, now seen corresponding path program 1 times [2019-10-22 11:25:04,926 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:04,926 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249411492] [2019-10-22 11:25:04,927 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:04,927 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:04,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:04,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:05,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:05,023 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249411492] [2019-10-22 11:25:05,023 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:05,023 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 11:25:05,023 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110169743] [2019-10-22 11:25:05,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 11:25:05,024 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:05,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 11:25:05,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:25:05,024 INFO L87 Difference]: Start difference. First operand 23 states and 22 transitions. Second operand 8 states. [2019-10-22 11:25:05,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:05,126 INFO L93 Difference]: Finished difference Result 22 states and 21 transitions. [2019-10-22 11:25:05,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 11:25:05,127 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-10-22 11:25:05,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:05,127 INFO L225 Difference]: With dead ends: 22 [2019-10-22 11:25:05,128 INFO L226 Difference]: Without dead ends: 22 [2019-10-22 11:25:05,128 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-10-22 11:25:05,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-22 11:25:05,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-10-22 11:25:05,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-22 11:25:05,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 21 transitions. [2019-10-22 11:25:05,129 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 21 transitions. Word has length 15 [2019-10-22 11:25:05,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:05,130 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 21 transitions. [2019-10-22 11:25:05,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 11:25:05,130 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 21 transitions. [2019-10-22 11:25:05,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-22 11:25:05,134 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:05,134 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:05,134 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:25:05,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:05,135 INFO L82 PathProgramCache]: Analyzing trace with hash 2049342135, now seen corresponding path program 1 times [2019-10-22 11:25:05,135 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:05,135 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686252571] [2019-10-22 11:25:05,135 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:05,135 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:05,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:05,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:05,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:05,234 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686252571] [2019-10-22 11:25:05,234 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:05,234 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 11:25:05,234 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511336603] [2019-10-22 11:25:05,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 11:25:05,235 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:05,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 11:25:05,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:25:05,235 INFO L87 Difference]: Start difference. First operand 22 states and 21 transitions. Second operand 8 states. [2019-10-22 11:25:05,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:05,353 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2019-10-22 11:25:05,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 11:25:05,353 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-10-22 11:25:05,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:05,354 INFO L225 Difference]: With dead ends: 21 [2019-10-22 11:25:05,354 INFO L226 Difference]: Without dead ends: 21 [2019-10-22 11:25:05,355 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-10-22 11:25:05,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-22 11:25:05,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-22 11:25:05,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-22 11:25:05,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 20 transitions. [2019-10-22 11:25:05,356 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 20 transitions. Word has length 16 [2019-10-22 11:25:05,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:05,356 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 20 transitions. [2019-10-22 11:25:05,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 11:25:05,357 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 20 transitions. [2019-10-22 11:25:05,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-22 11:25:05,357 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:05,357 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:05,358 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:25:05,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:05,358 INFO L82 PathProgramCache]: Analyzing trace with hash -894903172, now seen corresponding path program 1 times [2019-10-22 11:25:05,358 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:05,359 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691807808] [2019-10-22 11:25:05,359 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:05,359 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:05,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:05,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:05,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:05,430 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691807808] [2019-10-22 11:25:05,431 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:05,431 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 11:25:05,431 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61387999] [2019-10-22 11:25:05,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 11:25:05,431 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:05,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 11:25:05,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:25:05,432 INFO L87 Difference]: Start difference. First operand 21 states and 20 transitions. Second operand 8 states. [2019-10-22 11:25:05,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:05,573 INFO L93 Difference]: Finished difference Result 20 states and 19 transitions. [2019-10-22 11:25:05,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:25:05,573 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-10-22 11:25:05,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:05,573 INFO L225 Difference]: With dead ends: 20 [2019-10-22 11:25:05,573 INFO L226 Difference]: Without dead ends: 20 [2019-10-22 11:25:05,574 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-10-22 11:25:05,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-22 11:25:05,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-22 11:25:05,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-22 11:25:05,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 19 transitions. [2019-10-22 11:25:05,575 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 19 transitions. Word has length 17 [2019-10-22 11:25:05,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:05,576 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 19 transitions. [2019-10-22 11:25:05,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 11:25:05,576 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 19 transitions. [2019-10-22 11:25:05,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-22 11:25:05,576 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:05,576 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:05,576 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:25:05,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:05,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1008486272, now seen corresponding path program 1 times [2019-10-22 11:25:05,577 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:05,577 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513283123] [2019-10-22 11:25:05,577 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:05,577 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:05,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:05,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:05,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:05,841 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513283123] [2019-10-22 11:25:05,841 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:05,841 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-22 11:25:05,841 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287789847] [2019-10-22 11:25:05,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 11:25:05,841 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:05,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 11:25:05,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:25:05,842 INFO L87 Difference]: Start difference. First operand 20 states and 19 transitions. Second operand 10 states. [2019-10-22 11:25:06,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:06,097 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions. [2019-10-22 11:25:06,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 11:25:06,098 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-10-22 11:25:06,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:06,098 INFO L225 Difference]: With dead ends: 19 [2019-10-22 11:25:06,098 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 11:25:06,098 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2019-10-22 11:25:06,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 11:25:06,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 11:25:06,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 11:25:06,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 11:25:06,099 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2019-10-22 11:25:06,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:06,099 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 11:25:06,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 11:25:06,099 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 11:25:06,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 11:25:06,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:25:06 BoogieIcfgContainer [2019-10-22 11:25:06,103 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:25:06,103 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:25:06,104 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:25:06,104 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:25:06,104 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:25:02" (3/4) ... [2019-10-22 11:25:06,108 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 11:25:06,117 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-10-22 11:25:06,118 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-10-22 11:25:06,118 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-10-22 11:25:06,162 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_0bef2489-198f-4a3e-8ac5-ef1868209934/bin/utaipan/witness.graphml [2019-10-22 11:25:06,162 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:25:06,164 INFO L168 Benchmark]: Toolchain (without parser) took 4763.65 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 234.9 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -206.3 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:06,164 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:25:06,165 INFO L168 Benchmark]: CACSL2BoogieTranslator took 745.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.4 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -199.4 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:06,165 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.85 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:06,165 INFO L168 Benchmark]: Boogie Preprocessor took 25.50 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. [2019-10-22 11:25:06,165 INFO L168 Benchmark]: RCFGBuilder took 379.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.8 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:06,166 INFO L168 Benchmark]: TraceAbstraction took 3495.32 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 64.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -53.0 MB). Peak memory consumption was 11.5 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:06,166 INFO L168 Benchmark]: Witness Printer took 58.63 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:06,168 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 745.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.4 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -199.4 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 54.85 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.50 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 379.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.8 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3495.32 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 64.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -53.0 MB). Peak memory consumption was 11.5 MB. Max. memory is 11.5 GB. * Witness Printer took 58.63 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 778]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 782]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 778]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 782]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 775]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 778]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 782]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 791]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 775]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 782]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 782]: 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 1 procedures, 35 locations, 11 error locations. Result: SAFE, OverallTime: 3.4s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 483 SDtfs, 649 SDslu, 628 SDs, 0 SdLazy, 503 SolverSat, 27 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 115 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 212 NumberOfCodeBlocks, 212 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 194 ConstructedInterpolants, 0 QuantifiedInterpolants, 18096 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...