./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test19-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_4307bcb5-72ee-4351-9a7d-9762fd398c73/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4307bcb5-72ee-4351-9a7d-9762fd398c73/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4307bcb5-72ee-4351-9a7d-9762fd398c73/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4307bcb5-72ee-4351-9a7d-9762fd398c73/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test19-2.i -s /tmp/vcloud-vcloud-master/worker/working_dir_4307bcb5-72ee-4351-9a7d-9762fd398c73/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4307bcb5-72ee-4351-9a7d-9762fd398c73/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 36d1a8e991d0ba1b082944dbede48ef8c84f35de ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-free) --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 11:26:07,857 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:26:07,858 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:26:07,868 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:26:07,868 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:26:07,869 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:26:07,870 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:26:07,871 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:26:07,873 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:26:07,873 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:26:07,874 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:26:07,875 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:26:07,875 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:26:07,876 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:26:07,877 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:26:07,878 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:26:07,879 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:26:07,880 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:26:07,881 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:26:07,883 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:26:07,884 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:26:07,885 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:26:07,886 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:26:07,887 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:26:07,890 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:26:07,890 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:26:07,890 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:26:07,891 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:26:07,892 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:26:07,893 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:26:07,893 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:26:07,894 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:26:07,901 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:26:07,903 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:26:07,904 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:26:07,904 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:26:07,905 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:26:07,905 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:26:07,905 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:26:07,909 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:26:07,910 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:26:07,911 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4307bcb5-72ee-4351-9a7d-9762fd398c73/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2019-10-22 11:26:07,932 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:26:07,933 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:26:07,934 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:26:07,934 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:26:07,934 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:26:07,934 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:26:07,934 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:26:07,935 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:26:07,935 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:26:07,935 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:26:07,935 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:26:07,935 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:26:07,936 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 11:26:07,936 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 11:26:07,936 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:26:07,936 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:26:07,937 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 11:26:07,937 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:26:07,937 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:26:07,937 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:26:07,937 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-10-22 11:26:07,937 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-10-22 11:26:07,937 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-10-22 11:26:07,938 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:26:07,938 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:26:07,938 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:26:07,938 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:26:07,938 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:26:07,938 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:26:07,939 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:26:07,939 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:26:07,939 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:26:07,939 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:26:07,939 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:26:07,939 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:26:07,940 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_4307bcb5-72ee-4351-9a7d-9762fd398c73/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 -> 36d1a8e991d0ba1b082944dbede48ef8c84f35de [2019-10-22 11:26:07,978 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:26:07,989 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:26:07,992 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:26:07,994 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:26:07,994 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:26:07,995 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4307bcb5-72ee-4351-9a7d-9762fd398c73/bin/utaipan/../../sv-benchmarks/c/ldv-memsafety/memleaks_test19-2.i [2019-10-22 11:26:08,046 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4307bcb5-72ee-4351-9a7d-9762fd398c73/bin/utaipan/data/56408be15/bfd7eb9b90d2468a80a929de9da67fa7/FLAGae3439492 [2019-10-22 11:26:08,501 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:26:08,502 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4307bcb5-72ee-4351-9a7d-9762fd398c73/sv-benchmarks/c/ldv-memsafety/memleaks_test19-2.i [2019-10-22 11:26:08,519 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4307bcb5-72ee-4351-9a7d-9762fd398c73/bin/utaipan/data/56408be15/bfd7eb9b90d2468a80a929de9da67fa7/FLAGae3439492 [2019-10-22 11:26:08,816 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4307bcb5-72ee-4351-9a7d-9762fd398c73/bin/utaipan/data/56408be15/bfd7eb9b90d2468a80a929de9da67fa7 [2019-10-22 11:26:08,819 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:26:08,820 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:26:08,821 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:26:08,821 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:26:08,826 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:26:08,826 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:26:08" (1/1) ... [2019-10-22 11:26:08,830 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@634fcc66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:08, skipping insertion in model container [2019-10-22 11:26:08,830 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:26:08" (1/1) ... [2019-10-22 11:26:08,838 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:26:08,908 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:26:09,408 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:26:09,425 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:26:09,540 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:26:09,621 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:26:09,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:09 WrapperNode [2019-10-22 11:26:09,621 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:26:09,622 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:26:09,623 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:26:09,623 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:26:09,631 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:26:09" (1/1) ... [2019-10-22 11:26:09,665 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:26:09" (1/1) ... [2019-10-22 11:26:09,702 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:26:09,703 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:26:09,703 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:26:09,703 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:26:09,715 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:09" (1/1) ... [2019-10-22 11:26:09,715 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:09" (1/1) ... [2019-10-22 11:26:09,720 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:09" (1/1) ... [2019-10-22 11:26:09,724 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:09" (1/1) ... [2019-10-22 11:26:09,746 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:09" (1/1) ... [2019-10-22 11:26:09,749 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:09" (1/1) ... [2019-10-22 11:26:09,751 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:09" (1/1) ... [2019-10-22 11:26:09,762 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:26:09,762 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:26:09,762 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:26:09,763 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:26:09,764 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4307bcb5-72ee-4351-9a7d-9762fd398c73/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:26:09,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 11:26:09,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 11:26:09,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:26:09,837 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 11:26:09,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 11:26:09,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-22 11:26:09,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:26:09,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:26:10,404 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:26:10,405 INFO L284 CfgBuilder]: Removed 22 assume(true) statements. [2019-10-22 11:26:10,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:26:10 BoogieIcfgContainer [2019-10-22 11:26:10,406 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:26:10,407 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:26:10,408 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:26:10,411 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:26:10,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:26:08" (1/3) ... [2019-10-22 11:26:10,412 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f6bfea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:26:10, skipping insertion in model container [2019-10-22 11:26:10,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:09" (2/3) ... [2019-10-22 11:26:10,413 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f6bfea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:26:10, skipping insertion in model container [2019-10-22 11:26:10,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:26:10" (3/3) ... [2019-10-22 11:26:10,415 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test19-2.i [2019-10-22 11:26:10,426 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:26:10,434 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 29 error locations. [2019-10-22 11:26:10,443 INFO L249 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2019-10-22 11:26:10,466 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:26:10,466 INFO L374 AbstractCegarLoop]: Hoare is false [2019-10-22 11:26:10,467 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:26:10,467 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:26:10,467 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:26:10,467 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:26:10,467 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:26:10,467 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:26:10,485 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states. [2019-10-22 11:26:10,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-10-22 11:26:10,496 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:10,497 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-10-22 11:26:10,499 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:26:10,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:10,508 INFO L82 PathProgramCache]: Analyzing trace with hash 28693828, now seen corresponding path program 1 times [2019-10-22 11:26:10,516 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:10,516 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761613829] [2019-10-22 11:26:10,516 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:10,516 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:10,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:10,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:10,687 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:26:10,688 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761613829] [2019-10-22 11:26:10,689 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:10,689 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:26:10,690 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397003827] [2019-10-22 11:26:10,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:10,696 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:10,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:10,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:10,711 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 3 states. [2019-10-22 11:26:10,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:10,960 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2019-10-22 11:26:10,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:10,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-10-22 11:26:10,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:10,973 INFO L225 Difference]: With dead ends: 84 [2019-10-22 11:26:10,973 INFO L226 Difference]: Without dead ends: 82 [2019-10-22 11:26:10,975 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:26:10,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-10-22 11:26:11,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 68. [2019-10-22 11:26:11,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-22 11:26:11,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2019-10-22 11:26:11,016 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 5 [2019-10-22 11:26:11,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:11,016 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2019-10-22 11:26:11,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:11,017 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2019-10-22 11:26:11,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-10-22 11:26:11,017 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:11,017 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-10-22 11:26:11,018 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:26:11,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:11,019 INFO L82 PathProgramCache]: Analyzing trace with hash 28693829, now seen corresponding path program 1 times [2019-10-22 11:26:11,019 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:11,019 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785343856] [2019-10-22 11:26:11,019 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:11,019 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:11,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:11,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:11,090 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:26:11,091 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785343856] [2019-10-22 11:26:11,091 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:11,091 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:26:11,091 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157237510] [2019-10-22 11:26:11,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:26:11,093 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:11,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:26:11,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:26:11,094 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand 4 states. [2019-10-22 11:26:11,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:11,210 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2019-10-22 11:26:11,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:26:11,211 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-10-22 11:26:11,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:11,212 INFO L225 Difference]: With dead ends: 78 [2019-10-22 11:26:11,212 INFO L226 Difference]: Without dead ends: 78 [2019-10-22 11:26:11,213 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:26:11,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-22 11:26:11,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 65. [2019-10-22 11:26:11,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-10-22 11:26:11,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2019-10-22 11:26:11,225 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 5 [2019-10-22 11:26:11,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:11,225 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2019-10-22 11:26:11,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:26:11,226 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2019-10-22 11:26:11,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-22 11:26:11,226 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:11,226 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:11,227 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:26:11,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:11,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1534998135, now seen corresponding path program 1 times [2019-10-22 11:26:11,228 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:11,228 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889783414] [2019-10-22 11:26:11,228 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:11,228 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:11,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:11,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:11,329 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:26:11,330 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889783414] [2019-10-22 11:26:11,330 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:11,330 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:26:11,330 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494023650] [2019-10-22 11:26:11,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:26:11,331 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:11,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:26:11,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:26:11,331 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand 4 states. [2019-10-22 11:26:11,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:11,447 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2019-10-22 11:26:11,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:26:11,448 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-22 11:26:11,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:11,449 INFO L225 Difference]: With dead ends: 94 [2019-10-22 11:26:11,450 INFO L226 Difference]: Without dead ends: 94 [2019-10-22 11:26:11,450 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:26:11,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-10-22 11:26:11,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 63. [2019-10-22 11:26:11,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-10-22 11:26:11,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2019-10-22 11:26:11,456 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 11 [2019-10-22 11:26:11,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:11,456 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2019-10-22 11:26:11,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:26:11,457 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2019-10-22 11:26:11,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-22 11:26:11,457 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:11,457 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:11,458 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:26:11,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:11,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1534998134, now seen corresponding path program 1 times [2019-10-22 11:26:11,459 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:11,459 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635958813] [2019-10-22 11:26:11,459 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:11,460 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:11,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:11,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:11,605 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:26:11,605 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635958813] [2019-10-22 11:26:11,605 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:11,606 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:26:11,606 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668640945] [2019-10-22 11:26:11,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 11:26:11,606 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:11,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 11:26:11,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:26:11,607 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand 7 states. [2019-10-22 11:26:11,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:11,924 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2019-10-22 11:26:11,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:26:11,924 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-10-22 11:26:11,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:11,926 INFO L225 Difference]: With dead ends: 104 [2019-10-22 11:26:11,926 INFO L226 Difference]: Without dead ends: 104 [2019-10-22 11:26:11,927 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-10-22 11:26:11,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-10-22 11:26:11,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 61. [2019-10-22 11:26:11,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-22 11:26:11,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2019-10-22 11:26:11,934 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 11 [2019-10-22 11:26:11,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:11,934 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2019-10-22 11:26:11,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 11:26:11,935 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2019-10-22 11:26:11,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-22 11:26:11,935 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:11,936 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:11,936 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:26:11,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:11,937 INFO L82 PathProgramCache]: Analyzing trace with hash -340488557, now seen corresponding path program 1 times [2019-10-22 11:26:11,937 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:11,937 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000718755] [2019-10-22 11:26:11,938 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:11,938 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:11,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:11,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:12,008 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:26:12,009 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000718755] [2019-10-22 11:26:12,009 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:12,009 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:26:12,009 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105396382] [2019-10-22 11:26:12,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:26:12,010 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:12,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:26:12,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:26:12,011 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand 6 states. [2019-10-22 11:26:12,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:12,142 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2019-10-22 11:26:12,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:26:12,143 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-10-22 11:26:12,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:12,144 INFO L225 Difference]: With dead ends: 73 [2019-10-22 11:26:12,144 INFO L226 Difference]: Without dead ends: 73 [2019-10-22 11:26:12,144 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:26:12,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-10-22 11:26:12,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 65. [2019-10-22 11:26:12,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-10-22 11:26:12,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2019-10-22 11:26:12,149 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 12 [2019-10-22 11:26:12,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:12,156 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2019-10-22 11:26:12,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:26:12,156 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2019-10-22 11:26:12,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-22 11:26:12,156 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:12,156 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:12,157 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:26:12,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:12,157 INFO L82 PathProgramCache]: Analyzing trace with hash -340488556, now seen corresponding path program 1 times [2019-10-22 11:26:12,158 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:12,158 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103379092] [2019-10-22 11:26:12,158 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:12,158 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:12,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:12,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:12,245 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:26:12,245 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103379092] [2019-10-22 11:26:12,245 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:12,245 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:26:12,246 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782350236] [2019-10-22 11:26:12,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:26:12,246 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:12,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:26:12,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:26:12,247 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand 5 states. [2019-10-22 11:26:12,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:12,287 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2019-10-22 11:26:12,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:26:12,288 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-10-22 11:26:12,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:12,289 INFO L225 Difference]: With dead ends: 70 [2019-10-22 11:26:12,289 INFO L226 Difference]: Without dead ends: 70 [2019-10-22 11:26:12,289 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:26:12,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-10-22 11:26:12,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2019-10-22 11:26:12,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-22 11:26:12,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2019-10-22 11:26:12,293 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 75 transitions. Word has length 12 [2019-10-22 11:26:12,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:12,293 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 75 transitions. [2019-10-22 11:26:12,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:26:12,301 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2019-10-22 11:26:12,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-22 11:26:12,302 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:12,302 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:12,302 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:26:12,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:12,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1965188741, now seen corresponding path program 1 times [2019-10-22 11:26:12,303 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:12,303 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374245460] [2019-10-22 11:26:12,303 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:12,303 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:12,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:12,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:12,370 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:26:12,370 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374245460] [2019-10-22 11:26:12,370 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:12,371 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:26:12,371 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977044143] [2019-10-22 11:26:12,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:26:12,371 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:12,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:26:12,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:26:12,372 INFO L87 Difference]: Start difference. First operand 67 states and 75 transitions. Second operand 6 states. [2019-10-22 11:26:12,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:12,477 INFO L93 Difference]: Finished difference Result 132 states and 146 transitions. [2019-10-22 11:26:12,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:26:12,477 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-10-22 11:26:12,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:12,479 INFO L225 Difference]: With dead ends: 132 [2019-10-22 11:26:12,480 INFO L226 Difference]: Without dead ends: 132 [2019-10-22 11:26:12,480 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:26:12,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-10-22 11:26:12,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 72. [2019-10-22 11:26:12,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-22 11:26:12,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2019-10-22 11:26:12,495 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 13 [2019-10-22 11:26:12,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:12,497 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2019-10-22 11:26:12,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:26:12,497 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2019-10-22 11:26:12,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-22 11:26:12,498 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:12,498 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:12,498 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:26:12,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:12,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1264124163, now seen corresponding path program 1 times [2019-10-22 11:26:12,499 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:12,499 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068906853] [2019-10-22 11:26:12,499 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:12,499 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:12,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:12,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:12,559 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:26:12,559 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068906853] [2019-10-22 11:26:12,559 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:12,560 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:26:12,560 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362185782] [2019-10-22 11:26:12,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:26:12,560 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:12,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:26:12,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:26:12,561 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand 4 states. [2019-10-22 11:26:12,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:12,671 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2019-10-22 11:26:12,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:26:12,671 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-10-22 11:26:12,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:12,672 INFO L225 Difference]: With dead ends: 111 [2019-10-22 11:26:12,672 INFO L226 Difference]: Without dead ends: 106 [2019-10-22 11:26:12,672 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:26:12,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-10-22 11:26:12,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 81. [2019-10-22 11:26:12,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-10-22 11:26:12,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 92 transitions. [2019-10-22 11:26:12,676 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 92 transitions. Word has length 13 [2019-10-22 11:26:12,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:12,676 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 92 transitions. [2019-10-22 11:26:12,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:26:12,676 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 92 transitions. [2019-10-22 11:26:12,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-22 11:26:12,677 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:12,677 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:12,677 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:26:12,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:12,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1266452547, now seen corresponding path program 1 times [2019-10-22 11:26:12,678 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:12,678 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002429756] [2019-10-22 11:26:12,679 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:12,679 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:12,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:12,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:12,706 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:26:12,706 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002429756] [2019-10-22 11:26:12,706 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:12,706 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:26:12,707 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679309777] [2019-10-22 11:26:12,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:26:12,707 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:12,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:26:12,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:26:12,707 INFO L87 Difference]: Start difference. First operand 81 states and 92 transitions. Second operand 4 states. [2019-10-22 11:26:12,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:12,727 INFO L93 Difference]: Finished difference Result 166 states and 181 transitions. [2019-10-22 11:26:12,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:26:12,727 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-10-22 11:26:12,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:12,728 INFO L225 Difference]: With dead ends: 166 [2019-10-22 11:26:12,728 INFO L226 Difference]: Without dead ends: 166 [2019-10-22 11:26:12,728 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:26:12,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-10-22 11:26:12,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 85. [2019-10-22 11:26:12,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-10-22 11:26:12,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 96 transitions. [2019-10-22 11:26:12,733 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 96 transitions. Word has length 18 [2019-10-22 11:26:12,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:12,733 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 96 transitions. [2019-10-22 11:26:12,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:26:12,734 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 96 transitions. [2019-10-22 11:26:12,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-22 11:26:12,734 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:12,734 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:12,735 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:26:12,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:12,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1268299589, now seen corresponding path program 1 times [2019-10-22 11:26:12,735 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:12,735 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961743346] [2019-10-22 11:26:12,735 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:12,736 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:12,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:12,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:12,784 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:26:12,784 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961743346] [2019-10-22 11:26:12,784 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:12,784 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:26:12,784 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920032871] [2019-10-22 11:26:12,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:26:12,785 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:12,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:26:12,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:26:12,785 INFO L87 Difference]: Start difference. First operand 85 states and 96 transitions. Second operand 6 states. [2019-10-22 11:26:12,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:12,878 INFO L93 Difference]: Finished difference Result 139 states and 153 transitions. [2019-10-22 11:26:12,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:26:12,879 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-10-22 11:26:12,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:12,880 INFO L225 Difference]: With dead ends: 139 [2019-10-22 11:26:12,880 INFO L226 Difference]: Without dead ends: 139 [2019-10-22 11:26:12,880 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:26:12,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-10-22 11:26:12,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 90. [2019-10-22 11:26:12,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-10-22 11:26:12,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 101 transitions. [2019-10-22 11:26:12,889 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 101 transitions. Word has length 18 [2019-10-22 11:26:12,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:12,889 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 101 transitions. [2019-10-22 11:26:12,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:26:12,889 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 101 transitions. [2019-10-22 11:26:12,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-22 11:26:12,890 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:12,890 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:12,890 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:26:12,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:12,891 INFO L82 PathProgramCache]: Analyzing trace with hash 875272579, now seen corresponding path program 1 times [2019-10-22 11:26:12,891 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:12,891 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004115806] [2019-10-22 11:26:12,891 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:12,891 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:12,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:12,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:13,112 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:26:13,113 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004115806] [2019-10-22 11:26:13,113 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:13,113 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-22 11:26:13,113 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421055906] [2019-10-22 11:26:13,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 11:26:13,114 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:13,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 11:26:13,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:26:13,114 INFO L87 Difference]: Start difference. First operand 90 states and 101 transitions. Second operand 10 states. [2019-10-22 11:26:13,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:13,296 INFO L93 Difference]: Finished difference Result 89 states and 100 transitions. [2019-10-22 11:26:13,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 11:26:13,296 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-10-22 11:26:13,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:13,297 INFO L225 Difference]: With dead ends: 89 [2019-10-22 11:26:13,297 INFO L226 Difference]: Without dead ends: 89 [2019-10-22 11:26:13,297 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2019-10-22 11:26:13,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-10-22 11:26:13,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-10-22 11:26:13,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-10-22 11:26:13,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 100 transitions. [2019-10-22 11:26:13,300 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 100 transitions. Word has length 18 [2019-10-22 11:26:13,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:13,301 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 100 transitions. [2019-10-22 11:26:13,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 11:26:13,301 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 100 transitions. [2019-10-22 11:26:13,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-22 11:26:13,301 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:13,301 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:26:13,310 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:26:13,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:13,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1363646277, now seen corresponding path program 1 times [2019-10-22 11:26:13,310 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:13,311 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878900984] [2019-10-22 11:26:13,311 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:13,311 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:13,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:13,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:13,494 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:26:13,494 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878900984] [2019-10-22 11:26:13,494 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:13,495 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-22 11:26:13,495 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517381546] [2019-10-22 11:26:13,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 11:26:13,495 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:13,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 11:26:13,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:26:13,496 INFO L87 Difference]: Start difference. First operand 89 states and 100 transitions. Second operand 10 states. [2019-10-22 11:26:13,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:13,896 INFO L93 Difference]: Finished difference Result 231 states and 249 transitions. [2019-10-22 11:26:13,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-22 11:26:13,897 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-10-22 11:26:13,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:13,898 INFO L225 Difference]: With dead ends: 231 [2019-10-22 11:26:13,898 INFO L226 Difference]: Without dead ends: 231 [2019-10-22 11:26:13,899 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2019-10-22 11:26:13,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-10-22 11:26:13,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 107. [2019-10-22 11:26:13,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-10-22 11:26:13,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 125 transitions. [2019-10-22 11:26:13,905 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 125 transitions. Word has length 19 [2019-10-22 11:26:13,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:13,905 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 125 transitions. [2019-10-22 11:26:13,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 11:26:13,906 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 125 transitions. [2019-10-22 11:26:13,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-22 11:26:13,907 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:13,907 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:26:13,908 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:26:13,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:13,908 INFO L82 PathProgramCache]: Analyzing trace with hash -224701625, now seen corresponding path program 1 times [2019-10-22 11:26:13,908 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:13,908 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372030155] [2019-10-22 11:26:13,908 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:13,908 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:13,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:13,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:13,962 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:26:13,963 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372030155] [2019-10-22 11:26:13,963 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:13,963 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:26:13,963 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419915393] [2019-10-22 11:26:13,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:26:13,964 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:13,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:26:13,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:26:13,964 INFO L87 Difference]: Start difference. First operand 107 states and 125 transitions. Second operand 6 states. [2019-10-22 11:26:14,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:14,068 INFO L93 Difference]: Finished difference Result 121 states and 130 transitions. [2019-10-22 11:26:14,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:26:14,068 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-10-22 11:26:14,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:14,069 INFO L225 Difference]: With dead ends: 121 [2019-10-22 11:26:14,069 INFO L226 Difference]: Without dead ends: 116 [2019-10-22 11:26:14,070 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:26:14,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-10-22 11:26:14,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 69. [2019-10-22 11:26:14,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-22 11:26:14,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2019-10-22 11:26:14,072 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 19 [2019-10-22 11:26:14,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:14,072 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2019-10-22 11:26:14,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:26:14,072 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2019-10-22 11:26:14,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-22 11:26:14,073 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:14,073 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:14,073 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:26:14,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:14,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1586417447, now seen corresponding path program 1 times [2019-10-22 11:26:14,074 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:14,074 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187872324] [2019-10-22 11:26:14,075 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:14,075 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:14,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:14,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:14,117 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:26:14,117 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187872324] [2019-10-22 11:26:14,117 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:14,117 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:26:14,117 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255373886] [2019-10-22 11:26:14,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:26:14,118 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:14,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:26:14,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:26:14,118 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand 6 states. [2019-10-22 11:26:14,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:14,204 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2019-10-22 11:26:14,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:26:14,204 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-10-22 11:26:14,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:14,205 INFO L225 Difference]: With dead ends: 76 [2019-10-22 11:26:14,205 INFO L226 Difference]: Without dead ends: 76 [2019-10-22 11:26:14,205 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:26:14,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-10-22 11:26:14,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 68. [2019-10-22 11:26:14,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-22 11:26:14,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2019-10-22 11:26:14,207 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 20 [2019-10-22 11:26:14,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:14,207 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2019-10-22 11:26:14,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:26:14,207 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2019-10-22 11:26:14,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-22 11:26:14,208 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:14,208 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:14,208 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:26:14,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:14,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1586417448, now seen corresponding path program 1 times [2019-10-22 11:26:14,209 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:14,209 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449688834] [2019-10-22 11:26:14,209 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:14,209 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:14,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:14,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:14,282 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:26:14,283 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449688834] [2019-10-22 11:26:14,283 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:14,283 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:26:14,283 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912353297] [2019-10-22 11:26:14,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 11:26:14,283 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:14,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 11:26:14,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:26:14,284 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand 7 states. [2019-10-22 11:26:14,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:14,350 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2019-10-22 11:26:14,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:26:14,351 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-10-22 11:26:14,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:14,351 INFO L225 Difference]: With dead ends: 86 [2019-10-22 11:26:14,352 INFO L226 Difference]: Without dead ends: 86 [2019-10-22 11:26:14,352 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:26:14,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-10-22 11:26:14,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 67. [2019-10-22 11:26:14,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-22 11:26:14,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2019-10-22 11:26:14,354 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 20 [2019-10-22 11:26:14,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:14,354 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2019-10-22 11:26:14,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 11:26:14,354 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2019-10-22 11:26:14,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-22 11:26:14,355 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:14,355 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:14,355 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:26:14,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:14,355 INFO L82 PathProgramCache]: Analyzing trace with hash -676638267, now seen corresponding path program 1 times [2019-10-22 11:26:14,356 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:14,356 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757683908] [2019-10-22 11:26:14,356 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:14,356 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:14,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:14,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:14,516 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:26:14,516 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757683908] [2019-10-22 11:26:14,516 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:14,516 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 11:26:14,517 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839492354] [2019-10-22 11:26:14,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 11:26:14,517 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:14,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 11:26:14,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:26:14,518 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 9 states. [2019-10-22 11:26:14,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:14,757 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2019-10-22 11:26:14,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 11:26:14,758 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-10-22 11:26:14,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:14,758 INFO L225 Difference]: With dead ends: 101 [2019-10-22 11:26:14,758 INFO L226 Difference]: Without dead ends: 101 [2019-10-22 11:26:14,759 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-10-22 11:26:14,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-10-22 11:26:14,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 70. [2019-10-22 11:26:14,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-10-22 11:26:14,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2019-10-22 11:26:14,761 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 20 [2019-10-22 11:26:14,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:14,761 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2019-10-22 11:26:14,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 11:26:14,761 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2019-10-22 11:26:14,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-22 11:26:14,762 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:14,762 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:14,763 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:26:14,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:14,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1934300630, now seen corresponding path program 1 times [2019-10-22 11:26:14,763 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:14,763 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814736121] [2019-10-22 11:26:14,763 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:14,764 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:14,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:14,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:14,834 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:26:14,834 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814736121] [2019-10-22 11:26:14,834 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:14,834 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 11:26:14,834 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299691971] [2019-10-22 11:26:14,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 11:26:14,835 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:14,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 11:26:14,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:26:14,835 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 9 states. [2019-10-22 11:26:14,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:14,976 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2019-10-22 11:26:14,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 11:26:14,977 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-10-22 11:26:14,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:14,978 INFO L225 Difference]: With dead ends: 84 [2019-10-22 11:26:14,978 INFO L226 Difference]: Without dead ends: 84 [2019-10-22 11:26:14,978 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-10-22 11:26:14,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-10-22 11:26:14,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 69. [2019-10-22 11:26:14,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-22 11:26:14,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2019-10-22 11:26:14,980 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 21 [2019-10-22 11:26:14,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:14,980 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2019-10-22 11:26:14,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 11:26:14,981 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2019-10-22 11:26:14,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-22 11:26:14,981 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:14,981 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:14,982 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:26:14,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:14,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1934384108, now seen corresponding path program 1 times [2019-10-22 11:26:14,982 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:14,983 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248239651] [2019-10-22 11:26:14,983 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:14,983 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:14,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:14,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:15,071 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:26:15,071 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248239651] [2019-10-22 11:26:15,071 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:15,071 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 11:26:15,071 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868500467] [2019-10-22 11:26:15,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 11:26:15,072 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:15,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 11:26:15,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:26:15,072 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand 8 states. [2019-10-22 11:26:15,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:15,246 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2019-10-22 11:26:15,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:26:15,247 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-10-22 11:26:15,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:15,247 INFO L225 Difference]: With dead ends: 78 [2019-10-22 11:26:15,247 INFO L226 Difference]: Without dead ends: 78 [2019-10-22 11:26:15,248 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-10-22 11:26:15,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-22 11:26:15,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 68. [2019-10-22 11:26:15,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-22 11:26:15,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2019-10-22 11:26:15,250 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 21 [2019-10-22 11:26:15,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:15,250 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2019-10-22 11:26:15,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 11:26:15,250 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2019-10-22 11:26:15,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-22 11:26:15,250 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:15,251 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:15,251 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:26:15,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:15,251 INFO L82 PathProgramCache]: Analyzing trace with hash -166222521, now seen corresponding path program 1 times [2019-10-22 11:26:15,251 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:15,251 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829861366] [2019-10-22 11:26:15,252 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:15,252 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:15,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:15,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:15,327 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:26:15,328 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829861366] [2019-10-22 11:26:15,328 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:15,328 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 11:26:15,328 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426446793] [2019-10-22 11:26:15,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 11:26:15,328 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:15,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 11:26:15,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:26:15,329 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand 9 states. [2019-10-22 11:26:15,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:15,599 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2019-10-22 11:26:15,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 11:26:15,599 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-10-22 11:26:15,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:15,600 INFO L225 Difference]: With dead ends: 119 [2019-10-22 11:26:15,600 INFO L226 Difference]: Without dead ends: 119 [2019-10-22 11:26:15,601 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2019-10-22 11:26:15,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-10-22 11:26:15,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 76. [2019-10-22 11:26:15,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-10-22 11:26:15,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2019-10-22 11:26:15,603 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 22 [2019-10-22 11:26:15,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:15,604 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2019-10-22 11:26:15,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 11:26:15,604 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2019-10-22 11:26:15,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-22 11:26:15,604 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:15,604 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:15,605 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:26:15,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:15,605 INFO L82 PathProgramCache]: Analyzing trace with hash -163634771, now seen corresponding path program 1 times [2019-10-22 11:26:15,605 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:15,605 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848307085] [2019-10-22 11:26:15,607 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:15,607 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:15,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:15,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:15,863 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:26:15,864 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848307085] [2019-10-22 11:26:15,864 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:15,864 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-22 11:26:15,864 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24028938] [2019-10-22 11:26:15,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-22 11:26:15,864 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:15,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-22 11:26:15,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-10-22 11:26:15,865 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 12 states. [2019-10-22 11:26:16,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:16,113 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2019-10-22 11:26:16,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-22 11:26:16,113 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-10-22 11:26:16,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:16,114 INFO L225 Difference]: With dead ends: 78 [2019-10-22 11:26:16,114 INFO L226 Difference]: Without dead ends: 78 [2019-10-22 11:26:16,114 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2019-10-22 11:26:16,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-22 11:26:16,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2019-10-22 11:26:16,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-22 11:26:16,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2019-10-22 11:26:16,116 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 22 [2019-10-22 11:26:16,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:16,116 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2019-10-22 11:26:16,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-22 11:26:16,116 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2019-10-22 11:26:16,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-22 11:26:16,117 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:16,117 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:16,117 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:26:16,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:16,121 INFO L82 PathProgramCache]: Analyzing trace with hash -163612893, now seen corresponding path program 1 times [2019-10-22 11:26:16,121 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:16,121 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983928998] [2019-10-22 11:26:16,122 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:16,122 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:16,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:16,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:16,148 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:26:16,149 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983928998] [2019-10-22 11:26:16,149 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:16,149 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:26:16,149 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195767048] [2019-10-22 11:26:16,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:26:16,150 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:16,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:26:16,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:26:16,150 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand 4 states. [2019-10-22 11:26:16,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:16,167 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions. [2019-10-22 11:26:16,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:26:16,167 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-10-22 11:26:16,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:16,168 INFO L225 Difference]: With dead ends: 95 [2019-10-22 11:26:16,168 INFO L226 Difference]: Without dead ends: 95 [2019-10-22 11:26:16,168 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:26:16,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-10-22 11:26:16,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 75. [2019-10-22 11:26:16,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-22 11:26:16,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2019-10-22 11:26:16,171 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 22 [2019-10-22 11:26:16,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:16,171 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2019-10-22 11:26:16,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:26:16,171 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2019-10-22 11:26:16,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-22 11:26:16,172 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:16,172 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:16,172 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:26:16,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:16,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1177339771, now seen corresponding path program 1 times [2019-10-22 11:26:16,173 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:16,173 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367560532] [2019-10-22 11:26:16,173 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:16,173 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:16,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:16,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:16,232 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:26:16,232 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367560532] [2019-10-22 11:26:16,232 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:16,232 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:26:16,233 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806543507] [2019-10-22 11:26:16,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:26:16,233 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:16,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:26:16,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:26:16,234 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 6 states. [2019-10-22 11:26:16,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:16,360 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2019-10-22 11:26:16,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:26:16,362 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-10-22 11:26:16,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:16,362 INFO L225 Difference]: With dead ends: 106 [2019-10-22 11:26:16,362 INFO L226 Difference]: Without dead ends: 106 [2019-10-22 11:26:16,363 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:26:16,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-10-22 11:26:16,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 73. [2019-10-22 11:26:16,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-10-22 11:26:16,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2019-10-22 11:26:16,365 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 22 [2019-10-22 11:26:16,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:16,365 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2019-10-22 11:26:16,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:26:16,365 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2019-10-22 11:26:16,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-22 11:26:16,367 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:16,367 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:16,367 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:26:16,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:16,368 INFO L82 PathProgramCache]: Analyzing trace with hash -497281401, now seen corresponding path program 1 times [2019-10-22 11:26:16,368 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:16,368 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521618150] [2019-10-22 11:26:16,368 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:16,368 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:16,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:16,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:16,391 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:26:16,392 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521618150] [2019-10-22 11:26:16,392 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:16,392 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:26:16,392 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022781564] [2019-10-22 11:26:16,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:26:16,393 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:16,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:26:16,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:26:16,393 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 4 states. [2019-10-22 11:26:16,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:16,412 INFO L93 Difference]: Finished difference Result 88 states and 90 transitions. [2019-10-22 11:26:16,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:26:16,413 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-10-22 11:26:16,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:16,413 INFO L225 Difference]: With dead ends: 88 [2019-10-22 11:26:16,414 INFO L226 Difference]: Without dead ends: 88 [2019-10-22 11:26:16,414 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:26:16,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-10-22 11:26:16,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 66. [2019-10-22 11:26:16,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-22 11:26:16,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2019-10-22 11:26:16,416 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 22 [2019-10-22 11:26:16,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:16,416 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2019-10-22 11:26:16,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:26:16,416 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2019-10-22 11:26:16,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-22 11:26:16,417 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:16,417 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:16,417 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:26:16,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:16,419 INFO L82 PathProgramCache]: Analyzing trace with hash -857930760, now seen corresponding path program 1 times [2019-10-22 11:26:16,419 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:16,419 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583867918] [2019-10-22 11:26:16,419 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:16,419 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:16,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:16,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:16,498 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:26:16,498 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583867918] [2019-10-22 11:26:16,498 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:16,498 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 11:26:16,498 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334612652] [2019-10-22 11:26:16,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 11:26:16,499 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:16,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 11:26:16,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:26:16,499 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 9 states. [2019-10-22 11:26:16,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:16,721 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2019-10-22 11:26:16,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 11:26:16,721 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2019-10-22 11:26:16,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:16,722 INFO L225 Difference]: With dead ends: 70 [2019-10-22 11:26:16,722 INFO L226 Difference]: Without dead ends: 70 [2019-10-22 11:26:16,722 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-10-22 11:26:16,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-10-22 11:26:16,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2019-10-22 11:26:16,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-10-22 11:26:16,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2019-10-22 11:26:16,725 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 23 [2019-10-22 11:26:16,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:16,725 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2019-10-22 11:26:16,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 11:26:16,725 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2019-10-22 11:26:16,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-22 11:26:16,727 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:16,728 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:16,728 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:26:16,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:16,728 INFO L82 PathProgramCache]: Analyzing trace with hash -777710485, now seen corresponding path program 1 times [2019-10-22 11:26:16,729 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:16,729 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818700820] [2019-10-22 11:26:16,729 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:16,729 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:16,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:16,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:16,997 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:26:16,997 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818700820] [2019-10-22 11:26:16,997 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:16,997 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-22 11:26:16,997 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87286412] [2019-10-22 11:26:16,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-22 11:26:16,998 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:16,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-22 11:26:16,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-10-22 11:26:16,998 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand 12 states. [2019-10-22 11:26:17,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:17,319 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2019-10-22 11:26:17,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-22 11:26:17,321 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-10-22 11:26:17,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:17,322 INFO L225 Difference]: With dead ends: 87 [2019-10-22 11:26:17,322 INFO L226 Difference]: Without dead ends: 87 [2019-10-22 11:26:17,322 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2019-10-22 11:26:17,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-10-22 11:26:17,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 64. [2019-10-22 11:26:17,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-10-22 11:26:17,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2019-10-22 11:26:17,324 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 23 [2019-10-22 11:26:17,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:17,324 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2019-10-22 11:26:17,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-22 11:26:17,325 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2019-10-22 11:26:17,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-22 11:26:17,325 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:17,325 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:17,325 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:26:17,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:17,326 INFO L82 PathProgramCache]: Analyzing trace with hash -826049684, now seen corresponding path program 1 times [2019-10-22 11:26:17,326 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:17,326 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040597250] [2019-10-22 11:26:17,327 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:17,327 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:17,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:17,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:17,433 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:26:17,434 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040597250] [2019-10-22 11:26:17,434 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:17,434 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-22 11:26:17,434 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861149819] [2019-10-22 11:26:17,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 11:26:17,435 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:17,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 11:26:17,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:26:17,435 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 10 states. [2019-10-22 11:26:17,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:17,656 INFO L93 Difference]: Finished difference Result 88 states and 90 transitions. [2019-10-22 11:26:17,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 11:26:17,657 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-10-22 11:26:17,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:17,657 INFO L225 Difference]: With dead ends: 88 [2019-10-22 11:26:17,657 INFO L226 Difference]: Without dead ends: 88 [2019-10-22 11:26:17,658 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2019-10-22 11:26:17,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-10-22 11:26:17,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 63. [2019-10-22 11:26:17,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-10-22 11:26:17,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2019-10-22 11:26:17,659 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 24 [2019-10-22 11:26:17,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:17,659 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2019-10-22 11:26:17,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 11:26:17,660 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2019-10-22 11:26:17,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-22 11:26:17,660 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:17,660 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:17,660 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:26:17,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:17,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1660778863, now seen corresponding path program 1 times [2019-10-22 11:26:17,661 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:17,661 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483455920] [2019-10-22 11:26:17,661 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:17,661 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:17,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:17,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:17,908 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:26:17,908 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483455920] [2019-10-22 11:26:17,908 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:17,909 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-22 11:26:17,909 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085165071] [2019-10-22 11:26:17,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-22 11:26:17,909 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:17,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-22 11:26:17,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-10-22 11:26:17,910 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 12 states. [2019-10-22 11:26:18,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:18,230 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2019-10-22 11:26:18,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 11:26:18,231 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2019-10-22 11:26:18,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:18,231 INFO L225 Difference]: With dead ends: 66 [2019-10-22 11:26:18,231 INFO L226 Difference]: Without dead ends: 66 [2019-10-22 11:26:18,231 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2019-10-22 11:26:18,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-22 11:26:18,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-10-22 11:26:18,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-22 11:26:18,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2019-10-22 11:26:18,233 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 24 [2019-10-22 11:26:18,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:18,233 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2019-10-22 11:26:18,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-22 11:26:18,234 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2019-10-22 11:26:18,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-22 11:26:18,234 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:18,234 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:18,234 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:26:18,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:18,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1968854422, now seen corresponding path program 1 times [2019-10-22 11:26:18,235 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:18,235 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472859043] [2019-10-22 11:26:18,235 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:18,235 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:18,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:18,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:18,273 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:26:18,273 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472859043] [2019-10-22 11:26:18,273 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:18,273 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:26:18,273 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430942874] [2019-10-22 11:26:18,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:26:18,274 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:18,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:26:18,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:26:18,274 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 6 states. [2019-10-22 11:26:18,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:18,319 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2019-10-22 11:26:18,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:26:18,320 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-10-22 11:26:18,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:18,320 INFO L225 Difference]: With dead ends: 72 [2019-10-22 11:26:18,320 INFO L226 Difference]: Without dead ends: 72 [2019-10-22 11:26:18,320 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:26:18,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-22 11:26:18,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2019-10-22 11:26:18,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-22 11:26:18,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2019-10-22 11:26:18,322 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 24 [2019-10-22 11:26:18,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:18,322 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2019-10-22 11:26:18,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:26:18,323 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2019-10-22 11:26:18,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 11:26:18,323 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:18,323 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:18,323 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:26:18,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:18,324 INFO L82 PathProgramCache]: Analyzing trace with hash -55462674, now seen corresponding path program 1 times [2019-10-22 11:26:18,324 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:18,324 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023619297] [2019-10-22 11:26:18,324 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:18,324 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:18,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:18,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:18,412 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:26:18,412 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023619297] [2019-10-22 11:26:18,413 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:18,413 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-22 11:26:18,413 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482640718] [2019-10-22 11:26:18,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 11:26:18,413 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:18,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 11:26:18,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:26:18,414 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand 10 states. [2019-10-22 11:26:18,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:18,633 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2019-10-22 11:26:18,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 11:26:18,634 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2019-10-22 11:26:18,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:18,634 INFO L225 Difference]: With dead ends: 77 [2019-10-22 11:26:18,634 INFO L226 Difference]: Without dead ends: 77 [2019-10-22 11:26:18,635 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2019-10-22 11:26:18,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-10-22 11:26:18,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 70. [2019-10-22 11:26:18,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-10-22 11:26:18,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2019-10-22 11:26:18,637 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 25 [2019-10-22 11:26:18,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:18,637 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2019-10-22 11:26:18,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 11:26:18,637 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2019-10-22 11:26:18,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 11:26:18,637 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:18,638 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:18,638 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:26:18,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:18,639 INFO L82 PathProgramCache]: Analyzing trace with hash -55462673, now seen corresponding path program 1 times [2019-10-22 11:26:18,639 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:18,639 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336090233] [2019-10-22 11:26:18,639 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:18,639 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:18,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:18,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:18,684 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:26:18,685 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336090233] [2019-10-22 11:26:18,685 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:18,685 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:26:18,685 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568754065] [2019-10-22 11:26:18,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:26:18,685 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:18,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:26:18,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:26:18,686 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 6 states. [2019-10-22 11:26:18,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:18,750 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2019-10-22 11:26:18,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:26:18,751 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-10-22 11:26:18,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:18,751 INFO L225 Difference]: With dead ends: 72 [2019-10-22 11:26:18,751 INFO L226 Difference]: Without dead ends: 72 [2019-10-22 11:26:18,752 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:26:18,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-22 11:26:18,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2019-10-22 11:26:18,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-22 11:26:18,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2019-10-22 11:26:18,753 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 25 [2019-10-22 11:26:18,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:18,754 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2019-10-22 11:26:18,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:26:18,754 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2019-10-22 11:26:18,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 11:26:18,754 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:18,754 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:18,755 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:26:18,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:18,755 INFO L82 PathProgramCache]: Analyzing trace with hash -904923004, now seen corresponding path program 1 times [2019-10-22 11:26:18,755 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:18,755 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600445062] [2019-10-22 11:26:18,755 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:18,755 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:18,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:18,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:19,012 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:26:19,012 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600445062] [2019-10-22 11:26:19,012 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:19,012 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-22 11:26:19,013 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121763007] [2019-10-22 11:26:19,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-22 11:26:19,013 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:19,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-22 11:26:19,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-10-22 11:26:19,014 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand 11 states. [2019-10-22 11:26:19,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:19,369 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2019-10-22 11:26:19,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 11:26:19,369 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-10-22 11:26:19,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:19,369 INFO L225 Difference]: With dead ends: 71 [2019-10-22 11:26:19,369 INFO L226 Difference]: Without dead ends: 55 [2019-10-22 11:26:19,370 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2019-10-22 11:26:19,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-10-22 11:26:19,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-10-22 11:26:19,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-22 11:26:19,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-10-22 11:26:19,372 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 25 [2019-10-22 11:26:19,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:19,372 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-10-22 11:26:19,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-22 11:26:19,372 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-10-22 11:26:19,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-22 11:26:19,372 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:19,373 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:19,373 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:26:19,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:19,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1719342829, now seen corresponding path program 1 times [2019-10-22 11:26:19,374 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:19,374 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757869283] [2019-10-22 11:26:19,374 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:19,374 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:19,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:19,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:19,474 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:26:19,474 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757869283] [2019-10-22 11:26:19,474 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:19,475 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-22 11:26:19,475 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483148341] [2019-10-22 11:26:19,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-22 11:26:19,475 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:19,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-22 11:26:19,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-22 11:26:19,476 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 11 states. [2019-10-22 11:26:19,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:19,669 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-10-22 11:26:19,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-22 11:26:19,669 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2019-10-22 11:26:19,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:19,669 INFO L225 Difference]: With dead ends: 57 [2019-10-22 11:26:19,669 INFO L226 Difference]: Without dead ends: 57 [2019-10-22 11:26:19,670 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=328, Unknown=0, NotChecked=0, Total=462 [2019-10-22 11:26:19,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-22 11:26:19,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2019-10-22 11:26:19,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-22 11:26:19,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2019-10-22 11:26:19,671 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 26 [2019-10-22 11:26:19,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:19,672 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2019-10-22 11:26:19,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-22 11:26:19,672 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2019-10-22 11:26:19,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-22 11:26:19,672 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:19,672 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:19,673 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:26:19,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:19,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1316511806, now seen corresponding path program 1 times [2019-10-22 11:26:19,673 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:19,673 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084564503] [2019-10-22 11:26:19,673 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:19,674 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:19,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:19,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:19,938 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:26:19,939 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084564503] [2019-10-22 11:26:19,939 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:19,939 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-22 11:26:19,939 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350632694] [2019-10-22 11:26:19,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-22 11:26:19,939 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:19,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-22 11:26:19,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2019-10-22 11:26:19,940 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 15 states. [2019-10-22 11:26:20,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:20,379 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2019-10-22 11:26:20,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-22 11:26:20,379 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-10-22 11:26:20,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:20,380 INFO L225 Difference]: With dead ends: 53 [2019-10-22 11:26:20,380 INFO L226 Difference]: Without dead ends: 53 [2019-10-22 11:26:20,380 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=177, Invalid=525, Unknown=0, NotChecked=0, Total=702 [2019-10-22 11:26:20,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-10-22 11:26:20,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-10-22 11:26:20,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-22 11:26:20,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-10-22 11:26:20,381 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 27 [2019-10-22 11:26:20,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:20,382 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-10-22 11:26:20,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-22 11:26:20,382 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-10-22 11:26:20,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-22 11:26:20,382 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:20,382 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:20,382 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:26:20,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:20,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1760020018, now seen corresponding path program 1 times [2019-10-22 11:26:20,383 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:20,383 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695958383] [2019-10-22 11:26:20,383 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:20,383 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:20,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:20,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:20,498 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:26:20,498 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695958383] [2019-10-22 11:26:20,498 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:20,498 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-22 11:26:20,498 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902100426] [2019-10-22 11:26:20,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-22 11:26:20,499 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:20,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-22 11:26:20,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-22 11:26:20,499 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 11 states. [2019-10-22 11:26:20,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:20,736 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-10-22 11:26:20,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-22 11:26:20,737 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2019-10-22 11:26:20,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:20,737 INFO L225 Difference]: With dead ends: 55 [2019-10-22 11:26:20,737 INFO L226 Difference]: Without dead ends: 55 [2019-10-22 11:26:20,738 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=328, Unknown=0, NotChecked=0, Total=462 [2019-10-22 11:26:20,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-10-22 11:26:20,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2019-10-22 11:26:20,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-10-22 11:26:20,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2019-10-22 11:26:20,739 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 27 [2019-10-22 11:26:20,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:20,740 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2019-10-22 11:26:20,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-22 11:26:20,740 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2019-10-22 11:26:20,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-22 11:26:20,740 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:20,740 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:20,740 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:26:20,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:20,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1273954421, now seen corresponding path program 1 times [2019-10-22 11:26:20,741 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:20,741 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132754242] [2019-10-22 11:26:20,741 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:20,741 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:20,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:20,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:21,041 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:26:21,041 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132754242] [2019-10-22 11:26:21,041 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:21,041 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-22 11:26:21,042 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280891202] [2019-10-22 11:26:21,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-22 11:26:21,042 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:21,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-22 11:26:21,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-10-22 11:26:21,042 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 15 states. [2019-10-22 11:26:21,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:21,597 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2019-10-22 11:26:21,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-22 11:26:21,597 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2019-10-22 11:26:21,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:21,598 INFO L225 Difference]: With dead ends: 55 [2019-10-22 11:26:21,598 INFO L226 Difference]: Without dead ends: 55 [2019-10-22 11:26:21,598 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=173, Invalid=639, Unknown=0, NotChecked=0, Total=812 [2019-10-22 11:26:21,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-10-22 11:26:21,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-10-22 11:26:21,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-22 11:26:21,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-10-22 11:26:21,600 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 28 [2019-10-22 11:26:21,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:21,600 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-10-22 11:26:21,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-22 11:26:21,600 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-10-22 11:26:21,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-22 11:26:21,600 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:21,600 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:21,601 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:26:21,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:21,601 INFO L82 PathProgramCache]: Analyzing trace with hash 204523609, now seen corresponding path program 1 times [2019-10-22 11:26:21,601 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:21,601 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694804046] [2019-10-22 11:26:21,601 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:21,602 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:21,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:21,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:22,302 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:26:22,302 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694804046] [2019-10-22 11:26:22,302 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:22,302 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-10-22 11:26:22,302 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916557205] [2019-10-22 11:26:22,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-22 11:26:22,303 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:22,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-22 11:26:22,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2019-10-22 11:26:22,303 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 17 states. [2019-10-22 11:26:23,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:23,356 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-10-22 11:26:23,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-22 11:26:23,357 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2019-10-22 11:26:23,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:23,357 INFO L225 Difference]: With dead ends: 57 [2019-10-22 11:26:23,357 INFO L226 Difference]: Without dead ends: 45 [2019-10-22 11:26:23,357 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=116, Invalid=696, Unknown=0, NotChecked=0, Total=812 [2019-10-22 11:26:23,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-22 11:26:23,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-10-22 11:26:23,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-22 11:26:23,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-10-22 11:26:23,358 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 30 [2019-10-22 11:26:23,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:23,358 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-10-22 11:26:23,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-22 11:26:23,359 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-10-22 11:26:23,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-22 11:26:23,359 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:23,359 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:23,360 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:26:23,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:23,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1629170589, now seen corresponding path program 1 times [2019-10-22 11:26:23,360 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:23,360 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047461320] [2019-10-22 11:26:23,360 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:23,360 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:23,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:23,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:23,524 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:26:23,525 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047461320] [2019-10-22 11:26:23,525 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:23,525 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-22 11:26:23,525 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560052335] [2019-10-22 11:26:23,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-22 11:26:23,526 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:23,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-22 11:26:23,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-10-22 11:26:23,526 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 11 states. [2019-10-22 11:26:23,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:23,796 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-10-22 11:26:23,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-22 11:26:23,797 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 31 [2019-10-22 11:26:23,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:23,797 INFO L225 Difference]: With dead ends: 45 [2019-10-22 11:26:23,797 INFO L226 Difference]: Without dead ends: 45 [2019-10-22 11:26:23,797 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=301, Unknown=0, NotChecked=0, Total=420 [2019-10-22 11:26:23,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-22 11:26:23,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-10-22 11:26:23,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-22 11:26:23,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-10-22 11:26:23,799 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 31 [2019-10-22 11:26:23,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:23,799 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-10-22 11:26:23,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-22 11:26:23,799 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-10-22 11:26:23,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-22 11:26:23,799 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:23,799 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:23,800 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:26:23,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:23,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1035341227, now seen corresponding path program 1 times [2019-10-22 11:26:23,800 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:23,800 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661540076] [2019-10-22 11:26:23,800 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:23,801 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:23,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:23,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:23,849 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:26:23,849 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661540076] [2019-10-22 11:26:23,849 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:23,849 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:26:23,849 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796705591] [2019-10-22 11:26:23,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:26:23,850 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:23,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:26:23,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:26:23,850 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 6 states. [2019-10-22 11:26:23,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:23,883 INFO L93 Difference]: Finished difference Result 44 states and 43 transitions. [2019-10-22 11:26:23,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:26:23,883 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-10-22 11:26:23,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:23,884 INFO L225 Difference]: With dead ends: 44 [2019-10-22 11:26:23,884 INFO L226 Difference]: Without dead ends: 44 [2019-10-22 11:26:23,884 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:26:23,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-10-22 11:26:23,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-10-22 11:26:23,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-22 11:26:23,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 43 transitions. [2019-10-22 11:26:23,885 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 43 transitions. Word has length 32 [2019-10-22 11:26:23,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:23,886 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 43 transitions. [2019-10-22 11:26:23,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:26:23,886 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 43 transitions. [2019-10-22 11:26:23,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-22 11:26:23,886 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:23,886 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:23,887 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:26:23,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:23,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1490514441, now seen corresponding path program 1 times [2019-10-22 11:26:23,887 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:23,887 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058319414] [2019-10-22 11:26:23,887 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:23,887 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:23,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:23,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:26:23,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:26:23,963 INFO L168 tionRefinementEngine]: Strategy TAIPAN found a feasible trace [2019-10-22 11:26:23,963 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 11:26:24,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:26:24 BoogieIcfgContainer [2019-10-22 11:26:24,021 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:26:24,021 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:26:24,021 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:26:24,021 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:26:24,022 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:26:10" (3/4) ... [2019-10-22 11:26:24,024 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 11:26:24,082 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_4307bcb5-72ee-4351-9a7d-9762fd398c73/bin/utaipan/witness.graphml [2019-10-22 11:26:24,085 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:26:24,087 INFO L168 Benchmark]: Toolchain (without parser) took 15265.91 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 304.1 MB). Free memory was 939.1 MB in the beginning and 905.2 MB in the end (delta: 33.9 MB). Peak memory consumption was 338.0 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:24,087 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:26:24,087 INFO L168 Benchmark]: CACSL2BoogieTranslator took 800.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -149.7 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:24,087 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.05 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:26:24,088 INFO L168 Benchmark]: Boogie Preprocessor took 59.20 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:24,088 INFO L168 Benchmark]: RCFGBuilder took 644.06 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: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:24,088 INFO L168 Benchmark]: TraceAbstraction took 13613.51 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 176.2 MB). Free memory was 1.1 GB in the beginning and 917.3 MB in the end (delta: 133.0 MB). Peak memory consumption was 309.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:24,089 INFO L168 Benchmark]: Witness Printer took 63.91 ms. Allocated memory is still 1.3 GB. Free memory was 917.3 MB in the beginning and 905.2 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:24,091 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 800.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -149.7 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 80.05 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 59.20 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 644.06 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: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13613.51 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 176.2 MB). Free memory was 1.1 GB in the beginning and 917.3 MB in the end (delta: 133.0 MB). Peak memory consumption was 309.1 MB. Max. memory is 11.5 GB. * Witness Printer took 63.91 ms. Allocated memory is still 1.3 GB. Free memory was 917.3 MB in the beginning and 905.2 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 794]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: [L570] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; VAL [ldv_global_msg_list={-8:0}] [L798] struct A19 a19; [L775] int ret = - -3; [L527] COND TRUE __VERIFIER_nondet_int() [L528] return malloc(size); VAL [ldv_global_msg_list={-8:0}] [L776] a->q = (int *)ldv_malloc(sizeof(int)) VAL [ldv_global_msg_list={-8:0}] [L777] EXPR a->q VAL [ldv_global_msg_list={-8:0}] [L777] COND FALSE !(!a->q) [L527] COND TRUE __VERIFIER_nondet_int() [L528] return malloc(size); VAL [ldv_global_msg_list={-8:0}] [L763] a->p = (int *)ldv_malloc(sizeof(int)) VAL [ldv_global_msg_list={-8:0}] [L764] a->p VAL [ldv_global_msg_list={-8:0}] [L764] COND TRUE a->p [L765] return 0; VAL [ldv_global_msg_list={-8:0}] [L778] ret = f19(a) [L779] COND FALSE !(\read(ret)) [L772] return __VERIFIER_nondet_int(); [L782] COND TRUE !g19() [L769] EXPR a->p VAL [ldv_global_msg_list={-8:0}] [L769] free(a->p) VAL [ldv_global_msg_list={-8:0}] [L769] free(a->p) VAL [ldv_global_msg_list={-8:0}] [L769] free(a->p) [L789] EXPR a->q VAL [ldv_global_msg_list={-8:0}] [L789] free(a->q) VAL [ldv_global_msg_list={-8:0}] [L789] free(a->q) VAL [ldv_global_msg_list={-8:0}] [L789] free(a->q) [L791] return ret; VAL [ldv_global_msg_list={-8:0}] [L799] int ret = probe_unsafe_19(&a19); [L800] COND TRUE ret==0 [L794] EXPR a->q VAL [ldv_global_msg_list={-8:0}] [L794] free(a->q) VAL [ldv_global_msg_list={-8:0}] [L794] free(a->q) VAL [ldv_global_msg_list={-8:0}] [L794] free(a->q) VAL [ldv_global_msg_list={-8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 71 locations, 29 error locations. Result: UNSAFE, OverallTime: 13.5s, OverallIterations: 39, TraceHistogramMax: 1, AutomataDifference: 8.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1865 SDtfs, 5062 SDslu, 4850 SDs, 0 SdLazy, 4059 SolverSat, 371 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 494 GetRequests, 54 SyntacticMatches, 8 SemanticMatches, 432 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 762 ImplicationChecksByTransitivity, 7.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 38 MinimizatonAttempts, 775 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 814 NumberOfCodeBlocks, 814 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 742 ConstructedInterpolants, 0 QuantifiedInterpolants, 164039 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 38 InterpolantComputations, 38 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 incorrect! Received shutdown request...