./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/heap-manipulation/merge_sort_false-unreach-call_false-valid-memcleanup.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_7f33a708-42dc-4713-802d-5caf797519fd/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7f33a708-42dc-4713-802d-5caf797519fd/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7f33a708-42dc-4713-802d-5caf797519fd/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7f33a708-42dc-4713-802d-5caf797519fd/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/heap-manipulation/merge_sort_false-unreach-call_false-valid-memcleanup.i -s /tmp/vcloud-vcloud-master/worker/working_dir_7f33a708-42dc-4713-802d-5caf797519fd/bin-2019/utaipan/config/svcomp-MemCleanup-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7f33a708-42dc-4713-802d-5caf797519fd/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 534681b11e8e68e6058985d885b01f2cbfa43e5b ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 09:45:59,734 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 09:45:59,735 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 09:45:59,743 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 09:45:59,743 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 09:45:59,744 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 09:45:59,744 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 09:45:59,746 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 09:45:59,747 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 09:45:59,747 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 09:45:59,748 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 09:45:59,748 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 09:45:59,749 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 09:45:59,749 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 09:45:59,750 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 09:45:59,750 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 09:45:59,750 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 09:45:59,751 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 09:45:59,752 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 09:45:59,753 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 09:45:59,753 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 09:45:59,754 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 09:45:59,755 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 09:45:59,756 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 09:45:59,756 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 09:45:59,756 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 09:45:59,757 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 09:45:59,757 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 09:45:59,758 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 09:45:59,758 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 09:45:59,758 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 09:45:59,759 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 09:45:59,759 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 09:45:59,759 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 09:45:59,760 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 09:45:59,760 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 09:45:59,761 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7f33a708-42dc-4713-802d-5caf797519fd/bin-2019/utaipan/config/svcomp-MemCleanup-32bit-Taipan_Default.epf [2018-12-09 09:45:59,768 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 09:45:59,768 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 09:45:59,768 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 09:45:59,768 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 09:45:59,769 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 09:45:59,769 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 09:45:59,769 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 09:45:59,769 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 09:45:59,769 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 09:45:59,769 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 09:45:59,769 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 09:45:59,769 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 09:45:59,769 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 09:45:59,770 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 09:45:59,770 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 09:45:59,770 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 09:45:59,770 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 09:45:59,770 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 09:45:59,770 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 09:45:59,770 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 09:45:59,770 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 09:45:59,770 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 09:45:59,770 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 09:45:59,771 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 09:45:59,771 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 09:45:59,771 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 09:45:59,771 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 09:45:59,771 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 09:45:59,771 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 09:45:59,771 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 09:45:59,771 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 09:45:59,771 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 09:45:59,771 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 09:45:59,772 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 09:45:59,772 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 09:45:59,772 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_7f33a708-42dc-4713-802d-5caf797519fd/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) 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 -> 534681b11e8e68e6058985d885b01f2cbfa43e5b [2018-12-09 09:45:59,788 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 09:45:59,795 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 09:45:59,797 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 09:45:59,798 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 09:45:59,798 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 09:45:59,798 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7f33a708-42dc-4713-802d-5caf797519fd/bin-2019/utaipan/../../sv-benchmarks/c/heap-manipulation/merge_sort_false-unreach-call_false-valid-memcleanup.i [2018-12-09 09:45:59,831 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7f33a708-42dc-4713-802d-5caf797519fd/bin-2019/utaipan/data/939bdaf06/0a96141dcbf04cbe82365af5aacfadac/FLAGfa55dda7a [2018-12-09 09:46:00,255 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 09:46:00,255 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7f33a708-42dc-4713-802d-5caf797519fd/sv-benchmarks/c/heap-manipulation/merge_sort_false-unreach-call_false-valid-memcleanup.i [2018-12-09 09:46:00,264 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7f33a708-42dc-4713-802d-5caf797519fd/bin-2019/utaipan/data/939bdaf06/0a96141dcbf04cbe82365af5aacfadac/FLAGfa55dda7a [2018-12-09 09:46:00,276 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7f33a708-42dc-4713-802d-5caf797519fd/bin-2019/utaipan/data/939bdaf06/0a96141dcbf04cbe82365af5aacfadac [2018-12-09 09:46:00,278 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 09:46:00,279 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 09:46:00,280 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 09:46:00,280 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 09:46:00,283 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 09:46:00,284 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 09:46:00" (1/1) ... [2018-12-09 09:46:00,286 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75090e67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:46:00, skipping insertion in model container [2018-12-09 09:46:00,286 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 09:46:00" (1/1) ... [2018-12-09 09:46:00,292 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 09:46:00,317 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 09:46:00,527 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 09:46:00,533 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 09:46:00,562 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 09:46:00,584 INFO L195 MainTranslator]: Completed translation [2018-12-09 09:46:00,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:46:00 WrapperNode [2018-12-09 09:46:00,584 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 09:46:00,584 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 09:46:00,584 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 09:46:00,585 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 09:46:00,589 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:46:00" (1/1) ... [2018-12-09 09:46:00,598 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:46:00" (1/1) ... [2018-12-09 09:46:00,603 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 09:46:00,603 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 09:46:00,603 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 09:46:00,603 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 09:46:00,609 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:46:00" (1/1) ... [2018-12-09 09:46:00,609 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:46:00" (1/1) ... [2018-12-09 09:46:00,612 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:46:00" (1/1) ... [2018-12-09 09:46:00,612 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:46:00" (1/1) ... [2018-12-09 09:46:00,622 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:46:00" (1/1) ... [2018-12-09 09:46:00,628 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:46:00" (1/1) ... [2018-12-09 09:46:00,629 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:46:00" (1/1) ... [2018-12-09 09:46:00,631 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 09:46:00,631 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 09:46:00,631 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 09:46:00,631 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 09:46:00,632 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:46:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7f33a708-42dc-4713-802d-5caf797519fd/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 09:46:00,661 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_before [2018-12-09 09:46:00,661 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_before [2018-12-09 09:46:00,662 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_after [2018-12-09 09:46:00,662 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_after [2018-12-09 09:46:00,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 09:46:00,662 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 09:46:00,662 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2018-12-09 09:46:00,662 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2018-12-09 09:46:00,662 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2018-12-09 09:46:00,662 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2018-12-09 09:46:00,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 09:46:00,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 09:46:00,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 09:46:00,662 INFO L130 BoogieDeclarations]: Found specification of procedure merge_pair [2018-12-09 09:46:00,662 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_pair [2018-12-09 09:46:00,662 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 09:46:00,663 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 09:46:00,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 09:46:00,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 09:46:00,663 INFO L130 BoogieDeclarations]: Found specification of procedure seq_sort_core [2018-12-09 09:46:00,663 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_sort_core [2018-12-09 09:46:00,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 09:46:00,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 09:46:00,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 09:46:01,067 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 09:46:01,068 INFO L280 CfgBuilder]: Removed 33 assue(true) statements. [2018-12-09 09:46:01,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:46:01 BoogieIcfgContainer [2018-12-09 09:46:01,068 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 09:46:01,068 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 09:46:01,068 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 09:46:01,070 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 09:46:01,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 09:46:00" (1/3) ... [2018-12-09 09:46:01,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7817ea0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 09:46:01, skipping insertion in model container [2018-12-09 09:46:01,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:46:00" (2/3) ... [2018-12-09 09:46:01,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7817ea0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 09:46:01, skipping insertion in model container [2018-12-09 09:46:01,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:46:01" (3/3) ... [2018-12-09 09:46:01,072 INFO L112 eAbstractionObserver]: Analyzing ICFG merge_sort_false-unreach-call_false-valid-memcleanup.i [2018-12-09 09:46:01,078 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 09:46:01,083 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 101 error locations. [2018-12-09 09:46:01,092 INFO L257 AbstractCegarLoop]: Starting to check reachability of 101 error locations. [2018-12-09 09:46:01,107 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 09:46:01,107 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 09:46:01,107 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 09:46:01,107 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 09:46:01,108 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 09:46:01,108 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 09:46:01,108 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 09:46:01,108 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 09:46:01,120 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states. [2018-12-09 09:46:01,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-09 09:46:01,126 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:46:01,126 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:46:01,128 INFO L423 AbstractCegarLoop]: === Iteration 1 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-09 09:46:01,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:46:01,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1197190748, now seen corresponding path program 1 times [2018-12-09 09:46:01,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:46:01,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:46:01,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:46:01,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:46:01,165 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:46:01,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:46:01,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:46:01,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:46:01,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 09:46:01,203 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:46:01,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-09 09:46:01,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-09 09:46:01,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-09 09:46:01,217 INFO L87 Difference]: Start difference. First operand 272 states. Second operand 2 states. [2018-12-09 09:46:01,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:46:01,237 INFO L93 Difference]: Finished difference Result 270 states and 295 transitions. [2018-12-09 09:46:01,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-09 09:46:01,238 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-12-09 09:46:01,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:46:01,245 INFO L225 Difference]: With dead ends: 270 [2018-12-09 09:46:01,245 INFO L226 Difference]: Without dead ends: 253 [2018-12-09 09:46:01,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-09 09:46:01,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-12-09 09:46:01,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2018-12-09 09:46:01,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-12-09 09:46:01,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 266 transitions. [2018-12-09 09:46:01,276 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 266 transitions. Word has length 9 [2018-12-09 09:46:01,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:46:01,276 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 266 transitions. [2018-12-09 09:46:01,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-09 09:46:01,277 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 266 transitions. [2018-12-09 09:46:01,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 09:46:01,277 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:46:01,277 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:46:01,277 INFO L423 AbstractCegarLoop]: === Iteration 2 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-09 09:46:01,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:46:01,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1540745701, now seen corresponding path program 1 times [2018-12-09 09:46:01,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:46:01,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:46:01,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:46:01,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:46:01,279 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:46:01,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:46:01,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:46:01,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:46:01,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 09:46:01,311 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:46:01,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 09:46:01,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 09:46:01,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:46:01,312 INFO L87 Difference]: Start difference. First operand 253 states and 266 transitions. Second operand 3 states. [2018-12-09 09:46:01,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:46:01,460 INFO L93 Difference]: Finished difference Result 271 states and 289 transitions. [2018-12-09 09:46:01,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 09:46:01,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-09 09:46:01,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:46:01,461 INFO L225 Difference]: With dead ends: 271 [2018-12-09 09:46:01,461 INFO L226 Difference]: Without dead ends: 271 [2018-12-09 09:46:01,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:46:01,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-12-09 09:46:01,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 251. [2018-12-09 09:46:01,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-12-09 09:46:01,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 264 transitions. [2018-12-09 09:46:01,472 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 264 transitions. Word has length 10 [2018-12-09 09:46:01,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:46:01,472 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 264 transitions. [2018-12-09 09:46:01,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 09:46:01,472 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 264 transitions. [2018-12-09 09:46:01,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 09:46:01,472 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:46:01,472 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:46:01,473 INFO L423 AbstractCegarLoop]: === Iteration 3 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-09 09:46:01,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:46:01,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1540745702, now seen corresponding path program 1 times [2018-12-09 09:46:01,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:46:01,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:46:01,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:46:01,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:46:01,474 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:46:01,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:46:01,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:46:01,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:46:01,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 09:46:01,504 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:46:01,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 09:46:01,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 09:46:01,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:46:01,505 INFO L87 Difference]: Start difference. First operand 251 states and 264 transitions. Second operand 3 states. [2018-12-09 09:46:01,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:46:01,599 INFO L93 Difference]: Finished difference Result 279 states and 298 transitions. [2018-12-09 09:46:01,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 09:46:01,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-09 09:46:01,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:46:01,601 INFO L225 Difference]: With dead ends: 279 [2018-12-09 09:46:01,601 INFO L226 Difference]: Without dead ends: 279 [2018-12-09 09:46:01,601 INFO L631 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 [2018-12-09 09:46:01,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-12-09 09:46:01,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 249. [2018-12-09 09:46:01,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-12-09 09:46:01,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 262 transitions. [2018-12-09 09:46:01,608 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 262 transitions. Word has length 10 [2018-12-09 09:46:01,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:46:01,608 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 262 transitions. [2018-12-09 09:46:01,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 09:46:01,608 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 262 transitions. [2018-12-09 09:46:01,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 09:46:01,608 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:46:01,608 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:46:01,609 INFO L423 AbstractCegarLoop]: === Iteration 4 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-09 09:46:01,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:46:01,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1540744723, now seen corresponding path program 1 times [2018-12-09 09:46:01,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:46:01,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:46:01,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:46:01,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:46:01,610 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:46:01,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:46:01,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:46:01,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:46:01,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 09:46:01,621 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:46:01,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 09:46:01,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 09:46:01,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:46:01,622 INFO L87 Difference]: Start difference. First operand 249 states and 262 transitions. Second operand 3 states. [2018-12-09 09:46:01,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:46:01,745 INFO L93 Difference]: Finished difference Result 289 states and 311 transitions. [2018-12-09 09:46:01,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 09:46:01,746 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-09 09:46:01,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:46:01,747 INFO L225 Difference]: With dead ends: 289 [2018-12-09 09:46:01,747 INFO L226 Difference]: Without dead ends: 288 [2018-12-09 09:46:01,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:46:01,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-12-09 09:46:01,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 252. [2018-12-09 09:46:01,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-12-09 09:46:01,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 266 transitions. [2018-12-09 09:46:01,755 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 266 transitions. Word has length 10 [2018-12-09 09:46:01,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:46:01,755 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 266 transitions. [2018-12-09 09:46:01,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 09:46:01,755 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 266 transitions. [2018-12-09 09:46:01,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-09 09:46:01,755 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:46:01,755 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:46:01,756 INFO L423 AbstractCegarLoop]: === Iteration 5 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-09 09:46:01,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:46:01,756 INFO L82 PathProgramCache]: Analyzing trace with hash 551922422, now seen corresponding path program 1 times [2018-12-09 09:46:01,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:46:01,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:46:01,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:46:01,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:46:01,757 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:46:01,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:46:01,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:46:01,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:46:01,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 09:46:01,770 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:46:01,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 09:46:01,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 09:46:01,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:46:01,771 INFO L87 Difference]: Start difference. First operand 252 states and 266 transitions. Second operand 3 states. [2018-12-09 09:46:01,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:46:01,787 INFO L93 Difference]: Finished difference Result 267 states and 279 transitions. [2018-12-09 09:46:01,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 09:46:01,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-09 09:46:01,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:46:01,789 INFO L225 Difference]: With dead ends: 267 [2018-12-09 09:46:01,789 INFO L226 Difference]: Without dead ends: 266 [2018-12-09 09:46:01,789 INFO L631 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 [2018-12-09 09:46:01,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-12-09 09:46:01,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 251. [2018-12-09 09:46:01,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-12-09 09:46:01,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 264 transitions. [2018-12-09 09:46:01,795 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 264 transitions. Word has length 14 [2018-12-09 09:46:01,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:46:01,796 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 264 transitions. [2018-12-09 09:46:01,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 09:46:01,796 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 264 transitions. [2018-12-09 09:46:01,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 09:46:01,796 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:46:01,797 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:46:01,797 INFO L423 AbstractCegarLoop]: === Iteration 6 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-09 09:46:01,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:46:01,797 INFO L82 PathProgramCache]: Analyzing trace with hash -274852995, now seen corresponding path program 1 times [2018-12-09 09:46:01,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:46:01,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:46:01,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:46:01,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:46:01,799 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:46:01,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:46:01,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:46:01,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:46:01,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 09:46:01,823 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:46:01,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 09:46:01,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 09:46:01,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:46:01,823 INFO L87 Difference]: Start difference. First operand 251 states and 264 transitions. Second operand 3 states. [2018-12-09 09:46:01,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:46:01,924 INFO L93 Difference]: Finished difference Result 270 states and 285 transitions. [2018-12-09 09:46:01,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 09:46:01,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-09 09:46:01,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:46:01,926 INFO L225 Difference]: With dead ends: 270 [2018-12-09 09:46:01,926 INFO L226 Difference]: Without dead ends: 270 [2018-12-09 09:46:01,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:46:01,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-12-09 09:46:01,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 249. [2018-12-09 09:46:01,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-12-09 09:46:01,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 262 transitions. [2018-12-09 09:46:01,935 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 262 transitions. Word has length 15 [2018-12-09 09:46:01,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:46:01,935 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 262 transitions. [2018-12-09 09:46:01,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 09:46:01,935 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 262 transitions. [2018-12-09 09:46:01,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 09:46:01,935 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:46:01,935 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:46:01,936 INFO L423 AbstractCegarLoop]: === Iteration 7 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-09 09:46:01,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:46:01,936 INFO L82 PathProgramCache]: Analyzing trace with hash -274852994, now seen corresponding path program 1 times [2018-12-09 09:46:01,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:46:01,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:46:01,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:46:01,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:46:01,937 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:46:01,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:46:01,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:46:01,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:46:01,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 09:46:01,964 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:46:01,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 09:46:01,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 09:46:01,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:46:01,964 INFO L87 Difference]: Start difference. First operand 249 states and 262 transitions. Second operand 3 states. [2018-12-09 09:46:02,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:46:02,043 INFO L93 Difference]: Finished difference Result 278 states and 294 transitions. [2018-12-09 09:46:02,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 09:46:02,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-09 09:46:02,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:46:02,044 INFO L225 Difference]: With dead ends: 278 [2018-12-09 09:46:02,045 INFO L226 Difference]: Without dead ends: 278 [2018-12-09 09:46:02,045 INFO L631 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 [2018-12-09 09:46:02,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-12-09 09:46:02,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 247. [2018-12-09 09:46:02,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-12-09 09:46:02,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 260 transitions. [2018-12-09 09:46:02,049 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 260 transitions. Word has length 15 [2018-12-09 09:46:02,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:46:02,049 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 260 transitions. [2018-12-09 09:46:02,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 09:46:02,049 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 260 transitions. [2018-12-09 09:46:02,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 09:46:02,049 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:46:02,049 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:46:02,050 INFO L423 AbstractCegarLoop]: === Iteration 8 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-09 09:46:02,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:46:02,050 INFO L82 PathProgramCache]: Analyzing trace with hash 47797589, now seen corresponding path program 1 times [2018-12-09 09:46:02,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:46:02,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:46:02,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:46:02,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:46:02,051 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:46:02,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:46:02,078 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:46:02,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:46:02,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 09:46:02,078 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:46:02,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 09:46:02,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 09:46:02,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:46:02,079 INFO L87 Difference]: Start difference. First operand 247 states and 260 transitions. Second operand 4 states. [2018-12-09 09:46:02,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:46:02,108 INFO L93 Difference]: Finished difference Result 282 states and 298 transitions. [2018-12-09 09:46:02,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 09:46:02,109 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-12-09 09:46:02,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:46:02,109 INFO L225 Difference]: With dead ends: 282 [2018-12-09 09:46:02,109 INFO L226 Difference]: Without dead ends: 282 [2018-12-09 09:46:02,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:46:02,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-12-09 09:46:02,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 247. [2018-12-09 09:46:02,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-12-09 09:46:02,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 259 transitions. [2018-12-09 09:46:02,113 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 259 transitions. Word has length 21 [2018-12-09 09:46:02,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:46:02,113 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 259 transitions. [2018-12-09 09:46:02,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 09:46:02,113 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 259 transitions. [2018-12-09 09:46:02,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 09:46:02,113 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:46:02,113 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:46:02,114 INFO L423 AbstractCegarLoop]: === Iteration 9 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-09 09:46:02,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:46:02,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1371821768, now seen corresponding path program 1 times [2018-12-09 09:46:02,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:46:02,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:46:02,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:46:02,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:46:02,115 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:46:02,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:46:02,173 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:46:02,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:46:02,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 09:46:02,174 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:46:02,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:46:02,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:46:02,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:46:02,174 INFO L87 Difference]: Start difference. First operand 247 states and 259 transitions. Second operand 6 states. [2018-12-09 09:46:02,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:46:02,447 INFO L93 Difference]: Finished difference Result 321 states and 337 transitions. [2018-12-09 09:46:02,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 09:46:02,447 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-12-09 09:46:02,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:46:02,448 INFO L225 Difference]: With dead ends: 321 [2018-12-09 09:46:02,448 INFO L226 Difference]: Without dead ends: 321 [2018-12-09 09:46:02,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-09 09:46:02,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-12-09 09:46:02,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 277. [2018-12-09 09:46:02,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-12-09 09:46:02,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 304 transitions. [2018-12-09 09:46:02,453 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 304 transitions. Word has length 25 [2018-12-09 09:46:02,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:46:02,454 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 304 transitions. [2018-12-09 09:46:02,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:46:02,454 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 304 transitions. [2018-12-09 09:46:02,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 09:46:02,454 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:46:02,454 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:46:02,455 INFO L423 AbstractCegarLoop]: === Iteration 10 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-09 09:46:02,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:46:02,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1371821769, now seen corresponding path program 1 times [2018-12-09 09:46:02,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:46:02,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:46:02,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:46:02,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:46:02,456 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:46:02,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:46:02,490 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:46:02,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:46:02,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 09:46:02,491 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:46:02,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:46:02,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:46:02,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:46:02,491 INFO L87 Difference]: Start difference. First operand 277 states and 304 transitions. Second operand 6 states. [2018-12-09 09:46:02,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:46:02,723 INFO L93 Difference]: Finished difference Result 279 states and 297 transitions. [2018-12-09 09:46:02,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 09:46:02,723 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-12-09 09:46:02,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:46:02,724 INFO L225 Difference]: With dead ends: 279 [2018-12-09 09:46:02,724 INFO L226 Difference]: Without dead ends: 279 [2018-12-09 09:46:02,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-09 09:46:02,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-12-09 09:46:02,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 268. [2018-12-09 09:46:02,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-12-09 09:46:02,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 285 transitions. [2018-12-09 09:46:02,728 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 285 transitions. Word has length 25 [2018-12-09 09:46:02,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:46:02,728 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 285 transitions. [2018-12-09 09:46:02,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:46:02,728 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 285 transitions. [2018-12-09 09:46:02,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 09:46:02,729 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:46:02,729 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:46:02,729 INFO L423 AbstractCegarLoop]: === Iteration 11 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-09 09:46:02,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:46:02,729 INFO L82 PathProgramCache]: Analyzing trace with hash -2140859640, now seen corresponding path program 1 times [2018-12-09 09:46:02,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:46:02,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:46:02,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:46:02,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:46:02,730 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:46:02,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:46:02,829 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:46:02,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:46:02,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 09:46:02,830 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:46:02,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 09:46:02,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 09:46:02,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-09 09:46:02,831 INFO L87 Difference]: Start difference. First operand 268 states and 285 transitions. Second operand 11 states. [2018-12-09 09:46:03,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:46:03,272 INFO L93 Difference]: Finished difference Result 295 states and 311 transitions. [2018-12-09 09:46:03,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 09:46:03,272 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2018-12-09 09:46:03,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:46:03,273 INFO L225 Difference]: With dead ends: 295 [2018-12-09 09:46:03,273 INFO L226 Difference]: Without dead ends: 295 [2018-12-09 09:46:03,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2018-12-09 09:46:03,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-12-09 09:46:03,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 269. [2018-12-09 09:46:03,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-12-09 09:46:03,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 287 transitions. [2018-12-09 09:46:03,278 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 287 transitions. Word has length 36 [2018-12-09 09:46:03,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:46:03,278 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 287 transitions. [2018-12-09 09:46:03,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 09:46:03,279 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 287 transitions. [2018-12-09 09:46:03,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 09:46:03,279 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:46:03,279 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:46:03,280 INFO L423 AbstractCegarLoop]: === Iteration 12 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-09 09:46:03,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:46:03,280 INFO L82 PathProgramCache]: Analyzing trace with hash -2140859639, now seen corresponding path program 1 times [2018-12-09 09:46:03,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:46:03,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:46:03,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:46:03,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:46:03,281 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:46:03,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:46:03,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:46:03,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:46:03,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 09:46:03,352 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:46:03,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 09:46:03,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 09:46:03,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-09 09:46:03,353 INFO L87 Difference]: Start difference. First operand 269 states and 287 transitions. Second operand 8 states. [2018-12-09 09:46:03,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:46:03,739 INFO L93 Difference]: Finished difference Result 294 states and 310 transitions. [2018-12-09 09:46:03,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 09:46:03,739 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2018-12-09 09:46:03,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:46:03,740 INFO L225 Difference]: With dead ends: 294 [2018-12-09 09:46:03,740 INFO L226 Difference]: Without dead ends: 294 [2018-12-09 09:46:03,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-12-09 09:46:03,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-12-09 09:46:03,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 269. [2018-12-09 09:46:03,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-12-09 09:46:03,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 286 transitions. [2018-12-09 09:46:03,743 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 286 transitions. Word has length 36 [2018-12-09 09:46:03,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:46:03,744 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 286 transitions. [2018-12-09 09:46:03,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 09:46:03,744 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 286 transitions. [2018-12-09 09:46:03,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 09:46:03,744 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:46:03,744 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:46:03,744 INFO L423 AbstractCegarLoop]: === Iteration 13 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-09 09:46:03,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:46:03,745 INFO L82 PathProgramCache]: Analyzing trace with hash -47369046, now seen corresponding path program 1 times [2018-12-09 09:46:03,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:46:03,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:46:03,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:46:03,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:46:03,746 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:46:03,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:46:03,846 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:46:03,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:46:03,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 09:46:03,846 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:46:03,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 09:46:03,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 09:46:03,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-09 09:46:03,847 INFO L87 Difference]: Start difference. First operand 269 states and 286 transitions. Second operand 11 states. [2018-12-09 09:46:04,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:46:04,296 INFO L93 Difference]: Finished difference Result 293 states and 309 transitions. [2018-12-09 09:46:04,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 09:46:04,296 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2018-12-09 09:46:04,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:46:04,297 INFO L225 Difference]: With dead ends: 293 [2018-12-09 09:46:04,297 INFO L226 Difference]: Without dead ends: 293 [2018-12-09 09:46:04,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2018-12-09 09:46:04,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-12-09 09:46:04,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 269. [2018-12-09 09:46:04,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-12-09 09:46:04,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 285 transitions. [2018-12-09 09:46:04,303 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 285 transitions. Word has length 36 [2018-12-09 09:46:04,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:46:04,303 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 285 transitions. [2018-12-09 09:46:04,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 09:46:04,303 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 285 transitions. [2018-12-09 09:46:04,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 09:46:04,304 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:46:04,304 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:46:04,304 INFO L423 AbstractCegarLoop]: === Iteration 14 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-09 09:46:04,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:46:04,304 INFO L82 PathProgramCache]: Analyzing trace with hash -47369045, now seen corresponding path program 1 times [2018-12-09 09:46:04,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:46:04,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:46:04,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:46:04,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:46:04,306 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:46:04,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:46:04,407 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:46:04,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:46:04,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 09:46:04,407 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:46:04,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 09:46:04,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 09:46:04,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-09 09:46:04,408 INFO L87 Difference]: Start difference. First operand 269 states and 285 transitions. Second operand 8 states. [2018-12-09 09:46:04,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:46:04,750 INFO L93 Difference]: Finished difference Result 292 states and 308 transitions. [2018-12-09 09:46:04,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 09:46:04,751 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2018-12-09 09:46:04,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:46:04,751 INFO L225 Difference]: With dead ends: 292 [2018-12-09 09:46:04,751 INFO L226 Difference]: Without dead ends: 292 [2018-12-09 09:46:04,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-12-09 09:46:04,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-12-09 09:46:04,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 269. [2018-12-09 09:46:04,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-12-09 09:46:04,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 284 transitions. [2018-12-09 09:46:04,754 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 284 transitions. Word has length 36 [2018-12-09 09:46:04,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:46:04,754 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 284 transitions. [2018-12-09 09:46:04,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 09:46:04,755 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 284 transitions. [2018-12-09 09:46:04,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-09 09:46:04,755 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:46:04,755 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:46:04,755 INFO L423 AbstractCegarLoop]: === Iteration 15 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-09 09:46:04,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:46:04,755 INFO L82 PathProgramCache]: Analyzing trace with hash 486782864, now seen corresponding path program 1 times [2018-12-09 09:46:04,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:46:04,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:46:04,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:46:04,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:46:04,756 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:46:04,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:46:04,857 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:46:04,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:46:04,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 09:46:04,858 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:46:04,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 09:46:04,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 09:46:04,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-09 09:46:04,858 INFO L87 Difference]: Start difference. First operand 269 states and 284 transitions. Second operand 12 states. [2018-12-09 09:46:05,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:46:05,641 INFO L93 Difference]: Finished difference Result 246 states and 260 transitions. [2018-12-09 09:46:05,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 09:46:05,642 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-12-09 09:46:05,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:46:05,644 INFO L225 Difference]: With dead ends: 246 [2018-12-09 09:46:05,644 INFO L226 Difference]: Without dead ends: 235 [2018-12-09 09:46:05,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2018-12-09 09:46:05,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-12-09 09:46:05,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 217. [2018-12-09 09:46:05,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-12-09 09:46:05,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 230 transitions. [2018-12-09 09:46:05,649 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 230 transitions. Word has length 41 [2018-12-09 09:46:05,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:46:05,650 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 230 transitions. [2018-12-09 09:46:05,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 09:46:05,650 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 230 transitions. [2018-12-09 09:46:05,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 09:46:05,651 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:46:05,651 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:46:05,651 INFO L423 AbstractCegarLoop]: === Iteration 16 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-09 09:46:05,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:46:05,652 INFO L82 PathProgramCache]: Analyzing trace with hash 787947303, now seen corresponding path program 1 times [2018-12-09 09:46:05,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:46:05,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:46:05,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:46:05,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:46:05,653 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:46:05,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:46:05,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:46:05,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:46:05,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 09:46:05,699 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:46:05,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:46:05,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:46:05,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:46:05,700 INFO L87 Difference]: Start difference. First operand 217 states and 230 transitions. Second operand 6 states. [2018-12-09 09:46:05,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:46:05,933 INFO L93 Difference]: Finished difference Result 247 states and 266 transitions. [2018-12-09 09:46:05,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 09:46:05,933 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-12-09 09:46:05,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:46:05,934 INFO L225 Difference]: With dead ends: 247 [2018-12-09 09:46:05,934 INFO L226 Difference]: Without dead ends: 247 [2018-12-09 09:46:05,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-09 09:46:05,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-12-09 09:46:05,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 217. [2018-12-09 09:46:05,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-12-09 09:46:05,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 232 transitions. [2018-12-09 09:46:05,937 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 232 transitions. Word has length 46 [2018-12-09 09:46:05,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:46:05,937 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 232 transitions. [2018-12-09 09:46:05,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:46:05,937 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 232 transitions. [2018-12-09 09:46:05,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 09:46:05,937 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:46:05,937 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:46:05,937 INFO L423 AbstractCegarLoop]: === Iteration 17 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-09 09:46:05,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:46:05,938 INFO L82 PathProgramCache]: Analyzing trace with hash 787947304, now seen corresponding path program 1 times [2018-12-09 09:46:05,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:46:05,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:46:05,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:46:05,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:46:05,938 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:46:05,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:46:05,997 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:46:05,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:46:05,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 09:46:05,997 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:46:05,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:46:05,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:46:05,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:46:05,998 INFO L87 Difference]: Start difference. First operand 217 states and 232 transitions. Second operand 6 states. [2018-12-09 09:46:06,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:46:06,189 INFO L93 Difference]: Finished difference Result 256 states and 275 transitions. [2018-12-09 09:46:06,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 09:46:06,189 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-12-09 09:46:06,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:46:06,190 INFO L225 Difference]: With dead ends: 256 [2018-12-09 09:46:06,190 INFO L226 Difference]: Without dead ends: 256 [2018-12-09 09:46:06,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-09 09:46:06,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-12-09 09:46:06,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 229. [2018-12-09 09:46:06,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-12-09 09:46:06,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 247 transitions. [2018-12-09 09:46:06,194 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 247 transitions. Word has length 46 [2018-12-09 09:46:06,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:46:06,194 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 247 transitions. [2018-12-09 09:46:06,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:46:06,194 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 247 transitions. [2018-12-09 09:46:06,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-09 09:46:06,195 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:46:06,195 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:46:06,195 INFO L423 AbstractCegarLoop]: === Iteration 18 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-09 09:46:06,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:46:06,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1388628246, now seen corresponding path program 1 times [2018-12-09 09:46:06,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:46:06,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:46:06,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:46:06,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:46:06,197 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:46:06,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:46:06,219 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 09:46:06,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:46:06,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 09:46:06,219 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:46:06,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 09:46:06,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 09:46:06,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:46:06,220 INFO L87 Difference]: Start difference. First operand 229 states and 247 transitions. Second operand 5 states. [2018-12-09 09:46:06,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:46:06,348 INFO L93 Difference]: Finished difference Result 226 states and 244 transitions. [2018-12-09 09:46:06,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 09:46:06,349 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-12-09 09:46:06,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:46:06,349 INFO L225 Difference]: With dead ends: 226 [2018-12-09 09:46:06,349 INFO L226 Difference]: Without dead ends: 226 [2018-12-09 09:46:06,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:46:06,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-12-09 09:46:06,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2018-12-09 09:46:06,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-12-09 09:46:06,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 244 transitions. [2018-12-09 09:46:06,353 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 244 transitions. Word has length 47 [2018-12-09 09:46:06,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:46:06,353 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 244 transitions. [2018-12-09 09:46:06,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 09:46:06,353 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 244 transitions. [2018-12-09 09:46:06,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-09 09:46:06,354 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:46:06,354 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:46:06,354 INFO L423 AbstractCegarLoop]: === Iteration 19 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-09 09:46:06,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:46:06,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1388628245, now seen corresponding path program 1 times [2018-12-09 09:46:06,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:46:06,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:46:06,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:46:06,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:46:06,356 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:46:06,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:46:06,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:46:06,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:46:06,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 09:46:06,399 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:46:06,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:46:06,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:46:06,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:46:06,399 INFO L87 Difference]: Start difference. First operand 226 states and 244 transitions. Second operand 6 states. [2018-12-09 09:46:06,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:46:06,588 INFO L93 Difference]: Finished difference Result 275 states and 293 transitions. [2018-12-09 09:46:06,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 09:46:06,588 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-12-09 09:46:06,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:46:06,588 INFO L225 Difference]: With dead ends: 275 [2018-12-09 09:46:06,589 INFO L226 Difference]: Without dead ends: 275 [2018-12-09 09:46:06,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-09 09:46:06,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-12-09 09:46:06,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 247. [2018-12-09 09:46:06,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-12-09 09:46:06,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 271 transitions. [2018-12-09 09:46:06,591 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 271 transitions. Word has length 47 [2018-12-09 09:46:06,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:46:06,591 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 271 transitions. [2018-12-09 09:46:06,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:46:06,592 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 271 transitions. [2018-12-09 09:46:06,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 09:46:06,592 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:46:06,592 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:46:06,592 INFO L423 AbstractCegarLoop]: === Iteration 20 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-09 09:46:06,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:46:06,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1860015083, now seen corresponding path program 1 times [2018-12-09 09:46:06,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:46:06,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:46:06,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:46:06,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:46:06,593 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:46:06,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:46:06,624 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:46:06,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:46:06,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 09:46:06,625 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:46:06,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:46:06,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:46:06,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:46:06,626 INFO L87 Difference]: Start difference. First operand 247 states and 271 transitions. Second operand 6 states. [2018-12-09 09:46:06,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:46:06,690 INFO L93 Difference]: Finished difference Result 300 states and 324 transitions. [2018-12-09 09:46:06,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 09:46:06,691 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2018-12-09 09:46:06,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:46:06,691 INFO L225 Difference]: With dead ends: 300 [2018-12-09 09:46:06,691 INFO L226 Difference]: Without dead ends: 297 [2018-12-09 09:46:06,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-09 09:46:06,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-12-09 09:46:06,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 254. [2018-12-09 09:46:06,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-12-09 09:46:06,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 279 transitions. [2018-12-09 09:46:06,695 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 279 transitions. Word has length 50 [2018-12-09 09:46:06,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:46:06,695 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 279 transitions. [2018-12-09 09:46:06,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:46:06,695 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 279 transitions. [2018-12-09 09:46:06,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 09:46:06,696 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:46:06,696 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:46:06,696 INFO L423 AbstractCegarLoop]: === Iteration 21 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-09 09:46:06,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:46:06,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1837526797, now seen corresponding path program 1 times [2018-12-09 09:46:06,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:46:06,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:46:06,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:46:06,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:46:06,697 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:46:06,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:46:06,870 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:46:06,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:46:06,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-09 09:46:06,870 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:46:06,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 09:46:06,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 09:46:06,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-12-09 09:46:06,871 INFO L87 Difference]: Start difference. First operand 254 states and 279 transitions. Second operand 14 states. [2018-12-09 09:46:07,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:46:07,155 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-12-09 09:46:07,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 09:46:07,155 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 50 [2018-12-09 09:46:07,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:46:07,155 INFO L225 Difference]: With dead ends: 44 [2018-12-09 09:46:07,155 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 09:46:07,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2018-12-09 09:46:07,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 09:46:07,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 09:46:07,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 09:46:07,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 09:46:07,156 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2018-12-09 09:46:07,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:46:07,156 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 09:46:07,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 09:46:07,156 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 09:46:07,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 09:46:07,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 09:46:07 BoogieIcfgContainer [2018-12-09 09:46:07,160 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 09:46:07,160 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 09:46:07,160 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 09:46:07,160 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 09:46:07,161 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:46:01" (3/4) ... [2018-12-09 09:46:07,163 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 09:46:07,169 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fail [2018-12-09 09:46:07,169 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 09:46:07,169 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure merge_pair [2018-12-09 09:46:07,169 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure merge_single_node [2018-12-09 09:46:07,169 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure seq_sort_core [2018-12-09 09:46:07,169 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure inspect_before [2018-12-09 09:46:07,169 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 09:46:07,169 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure inspect_after [2018-12-09 09:46:07,174 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2018-12-09 09:46:07,174 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2018-12-09 09:46:07,175 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-09 09:46:07,214 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_7f33a708-42dc-4713-802d-5caf797519fd/bin-2019/utaipan/witness.graphml [2018-12-09 09:46:07,214 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 09:46:07,215 INFO L168 Benchmark]: Toolchain (without parser) took 6936.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 183.5 MB). Free memory was 947.0 MB in the beginning and 829.5 MB in the end (delta: 117.5 MB). Peak memory consumption was 301.0 MB. Max. memory is 11.5 GB. [2018-12-09 09:46:07,216 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 09:46:07,216 INFO L168 Benchmark]: CACSL2BoogieTranslator took 304.01 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.8 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -142.6 MB). Peak memory consumption was 30.0 MB. Max. memory is 11.5 GB. [2018-12-09 09:46:07,216 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 09:46:07,216 INFO L168 Benchmark]: Boogie Preprocessor took 27.91 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 09:46:07,216 INFO L168 Benchmark]: RCFGBuilder took 436.71 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 70.3 MB). Peak memory consumption was 70.3 MB. Max. memory is 11.5 GB. [2018-12-09 09:46:07,217 INFO L168 Benchmark]: TraceAbstraction took 6091.53 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 80.7 MB). Free memory was 1.0 GB in the beginning and 836.3 MB in the end (delta: 177.6 MB). Peak memory consumption was 258.4 MB. Max. memory is 11.5 GB. [2018-12-09 09:46:07,217 INFO L168 Benchmark]: Witness Printer took 54.39 ms. Allocated memory is still 1.2 GB. Free memory was 836.3 MB in the beginning and 829.5 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-09 09:46:07,218 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 304.01 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.8 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -142.6 MB). Peak memory consumption was 30.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.91 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 436.71 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 70.3 MB). Peak memory consumption was 70.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6091.53 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 80.7 MB). Free memory was 1.0 GB in the beginning and 836.3 MB in the end (delta: 177.6 MB). Peak memory consumption was 258.4 MB. Max. memory is 11.5 GB. * Witness Printer took 54.39 ms. Allocated memory is still 1.2 GB. Free memory was 836.3 MB in the beginning and 829.5 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 577]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 577]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 577]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 577]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 573]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 573]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 573]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 573]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 573]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 573]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 571]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 571]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 570]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 570]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 570]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 570]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 595]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 595]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 597]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 598]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 597]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 598]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 590]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 590]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 605]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 605]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 605]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 605]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 609]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 609]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 614]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 609]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 614]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 614]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 614]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 609]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 613]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 613]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 612]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 612]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 633]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 650]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 633]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 632]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 647]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 651]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 632]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 651]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 647]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 644]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 644]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 638]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 648]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 638]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 625]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 637]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 650]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 637]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 648]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 622]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 620]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 622]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 622]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 620]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 623]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 622]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 622]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 619]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 623]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 619]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 622]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 101 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 272 locations, 101 error locations. SAFE Result, 6.0s OverallTime, 21 OverallIterations, 2 TraceHistogramMax, 4.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4586 SDtfs, 2042 SDslu, 10287 SDs, 0 SdLazy, 6992 SolverSat, 242 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 196 GetRequests, 50 SyntacticMatches, 7 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=277occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 487 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 625 NumberOfCodeBlocks, 625 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 604 ConstructedInterpolants, 0 QuantifiedInterpolants, 137061 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 30/30 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...