./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_32f7bb3d-8d78-4961-8129-430174e35962/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_32f7bb3d-8d78-4961-8129-430174e35962/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_32f7bb3d-8d78-4961-8129-430174e35962/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_32f7bb3d-8d78-4961-8129-430174e35962/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/heap-manipulation/merge_sort_false-unreach-call_false-valid-memcleanup.i -s /tmp/vcloud-vcloud-master/worker/working_dir_32f7bb3d-8d78-4961-8129-430174e35962/bin-2019/uautomizer/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_32f7bb3d-8d78-4961-8129-430174e35962/bin-2019/uautomizer --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 Automizer --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-02 05:26:58,467 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 05:26:58,468 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 05:26:58,476 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 05:26:58,476 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 05:26:58,477 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 05:26:58,478 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 05:26:58,479 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 05:26:58,480 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 05:26:58,480 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 05:26:58,481 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 05:26:58,481 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 05:26:58,482 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 05:26:58,482 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 05:26:58,483 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 05:26:58,484 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 05:26:58,484 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 05:26:58,485 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 05:26:58,486 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 05:26:58,487 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 05:26:58,488 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 05:26:58,489 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 05:26:58,490 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 05:26:58,491 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 05:26:58,491 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 05:26:58,491 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 05:26:58,492 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 05:26:58,493 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 05:26:58,493 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 05:26:58,494 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 05:26:58,494 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 05:26:58,495 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 05:26:58,495 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 05:26:58,495 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 05:26:58,495 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 05:26:58,496 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 05:26:58,496 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_32f7bb3d-8d78-4961-8129-430174e35962/bin-2019/uautomizer/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2018-12-02 05:26:58,506 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 05:26:58,506 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 05:26:58,507 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 05:26:58,507 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 05:26:58,507 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 05:26:58,507 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 05:26:58,507 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 05:26:58,508 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 05:26:58,508 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 05:26:58,508 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 05:26:58,508 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 05:26:58,508 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 05:26:58,508 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 05:26:58,508 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-02 05:26:58,508 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-02 05:26:58,508 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 05:26:58,509 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 05:26:58,509 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 05:26:58,509 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 05:26:58,509 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 05:26:58,509 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 05:26:58,509 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 05:26:58,509 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 05:26:58,509 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 05:26:58,510 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 05:26:58,510 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 05:26:58,510 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 05:26:58,510 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in 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_32f7bb3d-8d78-4961-8129-430174e35962/bin-2019/uautomizer 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 -> Automizer 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-02 05:26:58,531 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 05:26:58,537 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 05:26:58,539 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 05:26:58,540 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 05:26:58,540 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 05:26:58,540 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_32f7bb3d-8d78-4961-8129-430174e35962/bin-2019/uautomizer/../../sv-benchmarks/c/heap-manipulation/merge_sort_false-unreach-call_false-valid-memcleanup.i [2018-12-02 05:26:58,574 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_32f7bb3d-8d78-4961-8129-430174e35962/bin-2019/uautomizer/data/9e618900a/3d17a2d5421440b1a5410b21c2734bbb/FLAG7ef3ff45e [2018-12-02 05:26:59,016 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 05:26:59,016 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_32f7bb3d-8d78-4961-8129-430174e35962/sv-benchmarks/c/heap-manipulation/merge_sort_false-unreach-call_false-valid-memcleanup.i [2018-12-02 05:26:59,022 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_32f7bb3d-8d78-4961-8129-430174e35962/bin-2019/uautomizer/data/9e618900a/3d17a2d5421440b1a5410b21c2734bbb/FLAG7ef3ff45e [2018-12-02 05:26:59,030 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_32f7bb3d-8d78-4961-8129-430174e35962/bin-2019/uautomizer/data/9e618900a/3d17a2d5421440b1a5410b21c2734bbb [2018-12-02 05:26:59,032 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 05:26:59,033 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-02 05:26:59,033 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 05:26:59,033 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 05:26:59,035 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 05:26:59,036 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:26:59" (1/1) ... [2018-12-02 05:26:59,037 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7166975b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:26:59, skipping insertion in model container [2018-12-02 05:26:59,037 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:26:59" (1/1) ... [2018-12-02 05:26:59,041 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 05:26:59,060 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 05:26:59,214 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 05:26:59,259 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 05:26:59,294 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 05:26:59,315 INFO L195 MainTranslator]: Completed translation [2018-12-02 05:26:59,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:26:59 WrapperNode [2018-12-02 05:26:59,315 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 05:26:59,316 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 05:26:59,316 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 05:26:59,316 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 05:26:59,324 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:26:59" (1/1) ... [2018-12-02 05:26:59,324 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:26:59" (1/1) ... [2018-12-02 05:26:59,333 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:26:59" (1/1) ... [2018-12-02 05:26:59,333 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:26:59" (1/1) ... [2018-12-02 05:26:59,345 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:26:59" (1/1) ... [2018-12-02 05:26:59,350 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:26:59" (1/1) ... [2018-12-02 05:26:59,352 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:26:59" (1/1) ... [2018-12-02 05:26:59,355 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 05:26:59,355 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 05:26:59,355 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 05:26:59,355 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 05:26:59,356 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:26:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_32f7bb3d-8d78-4961-8129-430174e35962/bin-2019/uautomizer/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-02 05:26:59,386 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 05:26:59,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 05:26:59,387 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-12-02 05:26:59,387 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-12-02 05:26:59,387 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2018-12-02 05:26:59,387 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2018-12-02 05:26:59,387 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_pair [2018-12-02 05:26:59,387 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_sort_core [2018-12-02 05:26:59,387 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_before [2018-12-02 05:26:59,387 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_after [2018-12-02 05:26:59,387 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 05:26:59,387 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-12-02 05:26:59,387 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-12-02 05:26:59,387 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-12-02 05:26:59,387 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-02 05:26:59,388 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-02 05:26:59,388 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-02 05:26:59,388 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-02 05:26:59,388 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-02 05:26:59,388 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-02 05:26:59,388 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-02 05:26:59,388 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-02 05:26:59,388 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-02 05:26:59,388 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-02 05:26:59,388 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-02 05:26:59,389 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-02 05:26:59,389 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-02 05:26:59,389 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-02 05:26:59,389 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-02 05:26:59,389 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-02 05:26:59,389 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-02 05:26:59,389 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-02 05:26:59,389 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-02 05:26:59,389 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-02 05:26:59,389 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-02 05:26:59,389 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-02 05:26:59,389 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-02 05:26:59,389 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-02 05:26:59,389 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-02 05:26:59,389 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-02 05:26:59,389 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-02 05:26:59,390 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-02 05:26:59,390 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-02 05:26:59,390 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-02 05:26:59,390 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-02 05:26:59,390 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-02 05:26:59,390 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-02 05:26:59,390 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-02 05:26:59,390 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-02 05:26:59,390 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-02 05:26:59,390 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-02 05:26:59,390 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-02 05:26:59,390 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-02 05:26:59,390 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-02 05:26:59,390 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-02 05:26:59,390 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-02 05:26:59,391 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-02 05:26:59,391 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-02 05:26:59,391 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-02 05:26:59,391 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-02 05:26:59,391 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-02 05:26:59,391 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-02 05:26:59,391 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-02 05:26:59,391 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-02 05:26:59,391 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-02 05:26:59,391 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-02 05:26:59,391 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-02 05:26:59,391 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-02 05:26:59,391 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-02 05:26:59,391 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-02 05:26:59,391 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-02 05:26:59,391 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-02 05:26:59,392 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-02 05:26:59,392 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-02 05:26:59,392 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-02 05:26:59,392 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-02 05:26:59,392 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-02 05:26:59,392 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-02 05:26:59,392 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-02 05:26:59,392 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-02 05:26:59,392 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-02 05:26:59,392 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-02 05:26:59,392 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-02 05:26:59,392 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-02 05:26:59,392 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-02 05:26:59,392 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-02 05:26:59,392 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-02 05:26:59,392 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-02 05:26:59,393 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-02 05:26:59,393 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-02 05:26:59,393 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-02 05:26:59,393 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-02 05:26:59,393 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-02 05:26:59,393 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-02 05:26:59,393 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-02 05:26:59,393 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-02 05:26:59,393 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-02 05:26:59,393 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-02 05:26:59,393 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-02 05:26:59,393 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-02 05:26:59,393 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-02 05:26:59,394 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-02 05:26:59,394 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-02 05:26:59,394 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-02 05:26:59,394 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-02 05:26:59,394 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-02 05:26:59,394 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-02 05:26:59,394 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-02 05:26:59,394 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-02 05:26:59,394 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-02 05:26:59,394 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-02 05:26:59,394 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-02 05:26:59,394 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-02 05:26:59,394 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-02 05:26:59,394 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-12-02 05:26:59,394 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2018-12-02 05:26:59,395 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2018-12-02 05:26:59,395 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-02 05:26:59,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 05:26:59,395 INFO L130 BoogieDeclarations]: Found specification of procedure merge_pair [2018-12-02 05:26:59,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 05:26:59,395 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 05:26:59,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 05:26:59,395 INFO L130 BoogieDeclarations]: Found specification of procedure seq_sort_core [2018-12-02 05:26:59,395 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_before [2018-12-02 05:26:59,395 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_after [2018-12-02 05:26:59,395 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 05:26:59,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 05:26:59,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 05:26:59,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 05:26:59,849 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 05:26:59,849 INFO L280 CfgBuilder]: Removed 33 assue(true) statements. [2018-12-02 05:26:59,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:26:59 BoogieIcfgContainer [2018-12-02 05:26:59,850 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 05:26:59,850 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 05:26:59,850 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 05:26:59,852 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 05:26:59,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 05:26:59" (1/3) ... [2018-12-02 05:26:59,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4092b0d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:26:59, skipping insertion in model container [2018-12-02 05:26:59,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:26:59" (2/3) ... [2018-12-02 05:26:59,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4092b0d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:26:59, skipping insertion in model container [2018-12-02 05:26:59,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:26:59" (3/3) ... [2018-12-02 05:26:59,854 INFO L112 eAbstractionObserver]: Analyzing ICFG merge_sort_false-unreach-call_false-valid-memcleanup.i [2018-12-02 05:26:59,860 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 05:26:59,865 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 101 error locations. [2018-12-02 05:26:59,875 INFO L257 AbstractCegarLoop]: Starting to check reachability of 101 error locations. [2018-12-02 05:26:59,890 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 05:26:59,890 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 05:26:59,891 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-02 05:26:59,891 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 05:26:59,891 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 05:26:59,891 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 05:26:59,891 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 05:26:59,891 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 05:26:59,891 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 05:26:59,904 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states. [2018-12-02 05:26:59,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-02 05:26:59,910 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:26:59,910 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:26:59,912 INFO L423 AbstractCegarLoop]: === Iteration 1 === [merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-02 05:26:59,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:26:59,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1221642360, now seen corresponding path program 1 times [2018-12-02 05:26:59,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:26:59,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:26:59,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:26:59,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:26:59,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:26:59,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:26:59,990 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-02 05:26:59,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:26:59,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 05:26:59,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-02 05:27:00,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-02 05:27:00,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 05:27:00,003 INFO L87 Difference]: Start difference. First operand 272 states. Second operand 2 states. [2018-12-02 05:27:00,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:27:00,021 INFO L93 Difference]: Finished difference Result 270 states and 295 transitions. [2018-12-02 05:27:00,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 05:27:00,022 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-12-02 05:27:00,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:27:00,030 INFO L225 Difference]: With dead ends: 270 [2018-12-02 05:27:00,030 INFO L226 Difference]: Without dead ends: 253 [2018-12-02 05:27:00,031 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-02 05:27:00,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-12-02 05:27:00,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2018-12-02 05:27:00,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-12-02 05:27:00,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 266 transitions. [2018-12-02 05:27:00,061 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 266 transitions. Word has length 9 [2018-12-02 05:27:00,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:27:00,062 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 266 transitions. [2018-12-02 05:27:00,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-02 05:27:00,062 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 266 transitions. [2018-12-02 05:27:00,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 05:27:00,062 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:27:00,062 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:27:00,063 INFO L423 AbstractCegarLoop]: === Iteration 2 === [merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-02 05:27:00,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:27:00,063 INFO L82 PathProgramCache]: Analyzing trace with hash 782744891, now seen corresponding path program 1 times [2018-12-02 05:27:00,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:27:00,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:27:00,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:27:00,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:27:00,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:27:00,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:27:00,086 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-02 05:27:00,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:27:00,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 05:27:00,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:27:00,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:27:00,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:27:00,087 INFO L87 Difference]: Start difference. First operand 253 states and 266 transitions. Second operand 3 states. [2018-12-02 05:27:00,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:27:00,238 INFO L93 Difference]: Finished difference Result 293 states and 315 transitions. [2018-12-02 05:27:00,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:27:00,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-02 05:27:00,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:27:00,239 INFO L225 Difference]: With dead ends: 293 [2018-12-02 05:27:00,239 INFO L226 Difference]: Without dead ends: 292 [2018-12-02 05:27:00,240 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-02 05:27:00,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-12-02 05:27:00,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 256. [2018-12-02 05:27:00,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-12-02 05:27:00,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 270 transitions. [2018-12-02 05:27:00,250 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 270 transitions. Word has length 10 [2018-12-02 05:27:00,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:27:00,251 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 270 transitions. [2018-12-02 05:27:00,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:27:00,251 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 270 transitions. [2018-12-02 05:27:00,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 05:27:00,251 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:27:00,251 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:27:00,252 INFO L423 AbstractCegarLoop]: === Iteration 3 === [merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-02 05:27:00,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:27:00,252 INFO L82 PathProgramCache]: Analyzing trace with hash 782745869, now seen corresponding path program 1 times [2018-12-02 05:27:00,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:27:00,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:27:00,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:27:00,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:27:00,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:27:00,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:27:00,275 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-02 05:27:00,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:27:00,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 05:27:00,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:27:00,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:27:00,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:27:00,276 INFO L87 Difference]: Start difference. First operand 256 states and 270 transitions. Second operand 3 states. [2018-12-02 05:27:00,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:27:00,382 INFO L93 Difference]: Finished difference Result 271 states and 288 transitions. [2018-12-02 05:27:00,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:27:00,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-02 05:27:00,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:27:00,384 INFO L225 Difference]: With dead ends: 271 [2018-12-02 05:27:00,384 INFO L226 Difference]: Without dead ends: 271 [2018-12-02 05:27:00,384 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-02 05:27:00,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-12-02 05:27:00,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 254. [2018-12-02 05:27:00,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-12-02 05:27:00,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 268 transitions. [2018-12-02 05:27:00,392 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 268 transitions. Word has length 10 [2018-12-02 05:27:00,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:27:00,392 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 268 transitions. [2018-12-02 05:27:00,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:27:00,392 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 268 transitions. [2018-12-02 05:27:00,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 05:27:00,392 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:27:00,393 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:27:00,393 INFO L423 AbstractCegarLoop]: === Iteration 4 === [merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-02 05:27:00,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:27:00,393 INFO L82 PathProgramCache]: Analyzing trace with hash 782745870, now seen corresponding path program 1 times [2018-12-02 05:27:00,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:27:00,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:27:00,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:27:00,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:27:00,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:27:00,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:27:00,424 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-02 05:27:00,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:27:00,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 05:27:00,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:27:00,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:27:00,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:27:00,425 INFO L87 Difference]: Start difference. First operand 254 states and 268 transitions. Second operand 3 states. [2018-12-02 05:27:00,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:27:00,520 INFO L93 Difference]: Finished difference Result 279 states and 297 transitions. [2018-12-02 05:27:00,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:27:00,520 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-02 05:27:00,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:27:00,521 INFO L225 Difference]: With dead ends: 279 [2018-12-02 05:27:00,522 INFO L226 Difference]: Without dead ends: 279 [2018-12-02 05:27:00,522 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-02 05:27:00,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-12-02 05:27:00,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 252. [2018-12-02 05:27:00,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-12-02 05:27:00,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 266 transitions. [2018-12-02 05:27:00,531 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 266 transitions. Word has length 10 [2018-12-02 05:27:00,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:27:00,531 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 266 transitions. [2018-12-02 05:27:00,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:27:00,531 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 266 transitions. [2018-12-02 05:27:00,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-02 05:27:00,532 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:27:00,532 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:27:00,532 INFO L423 AbstractCegarLoop]: === Iteration 5 === [merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-02 05:27:00,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:27:00,532 INFO L82 PathProgramCache]: Analyzing trace with hash -199927265, now seen corresponding path program 1 times [2018-12-02 05:27:00,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:27:00,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:27:00,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:27:00,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:27:00,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:27:00,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:27:00,545 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-02 05:27:00,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:27:00,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 05:27:00,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:27:00,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:27:00,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:27:00,546 INFO L87 Difference]: Start difference. First operand 252 states and 266 transitions. Second operand 3 states. [2018-12-02 05:27:00,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:27:00,563 INFO L93 Difference]: Finished difference Result 267 states and 279 transitions. [2018-12-02 05:27:00,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:27:00,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-02 05:27:00,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:27:00,565 INFO L225 Difference]: With dead ends: 267 [2018-12-02 05:27:00,565 INFO L226 Difference]: Without dead ends: 266 [2018-12-02 05:27:00,565 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-02 05:27:00,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-12-02 05:27:00,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 251. [2018-12-02 05:27:00,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-12-02 05:27:00,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 264 transitions. [2018-12-02 05:27:00,572 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 264 transitions. Word has length 14 [2018-12-02 05:27:00,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:27:00,572 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 264 transitions. [2018-12-02 05:27:00,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:27:00,572 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 264 transitions. [2018-12-02 05:27:00,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-02 05:27:00,573 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:27:00,573 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:27:00,573 INFO L423 AbstractCegarLoop]: === Iteration 6 === [merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-02 05:27:00,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:27:00,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1704137441, now seen corresponding path program 1 times [2018-12-02 05:27:00,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:27:00,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:27:00,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:27:00,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:27:00,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:27:00,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:27:00,595 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-02 05:27:00,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:27:00,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 05:27:00,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:27:00,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:27:00,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:27:00,596 INFO L87 Difference]: Start difference. First operand 251 states and 264 transitions. Second operand 3 states. [2018-12-02 05:27:00,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:27:00,695 INFO L93 Difference]: Finished difference Result 270 states and 285 transitions. [2018-12-02 05:27:00,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:27:00,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-02 05:27:00,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:27:00,696 INFO L225 Difference]: With dead ends: 270 [2018-12-02 05:27:00,696 INFO L226 Difference]: Without dead ends: 270 [2018-12-02 05:27:00,696 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-02 05:27:00,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-12-02 05:27:00,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 249. [2018-12-02 05:27:00,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-12-02 05:27:00,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 262 transitions. [2018-12-02 05:27:00,701 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 262 transitions. Word has length 15 [2018-12-02 05:27:00,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:27:00,702 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 262 transitions. [2018-12-02 05:27:00,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:27:00,702 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 262 transitions. [2018-12-02 05:27:00,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-02 05:27:00,702 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:27:00,702 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:27:00,703 INFO L423 AbstractCegarLoop]: === Iteration 7 === [merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-02 05:27:00,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:27:00,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1704137442, now seen corresponding path program 1 times [2018-12-02 05:27:00,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:27:00,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:27:00,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:27:00,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:27:00,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:27:00,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:27:00,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:27:00,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:27:00,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 05:27:00,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:27:00,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:27:00,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:27:00,731 INFO L87 Difference]: Start difference. First operand 249 states and 262 transitions. Second operand 3 states. [2018-12-02 05:27:00,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:27:00,812 INFO L93 Difference]: Finished difference Result 278 states and 294 transitions. [2018-12-02 05:27:00,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:27:00,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-02 05:27:00,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:27:00,814 INFO L225 Difference]: With dead ends: 278 [2018-12-02 05:27:00,814 INFO L226 Difference]: Without dead ends: 278 [2018-12-02 05:27:00,814 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-02 05:27:00,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-12-02 05:27:00,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 247. [2018-12-02 05:27:00,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-12-02 05:27:00,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 260 transitions. [2018-12-02 05:27:00,819 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 260 transitions. Word has length 15 [2018-12-02 05:27:00,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:27:00,819 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 260 transitions. [2018-12-02 05:27:00,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:27:00,820 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 260 transitions. [2018-12-02 05:27:00,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 05:27:00,820 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:27:00,820 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-02 05:27:00,820 INFO L423 AbstractCegarLoop]: === Iteration 8 === [merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-02 05:27:00,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:27:00,820 INFO L82 PathProgramCache]: Analyzing trace with hash 664751673, now seen corresponding path program 1 times [2018-12-02 05:27:00,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:27:00,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:27:00,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:27:00,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:27:00,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:27:00,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:27:00,851 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-02 05:27:00,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:27:00,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:27:00,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:27:00,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:27:00,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:27:00,852 INFO L87 Difference]: Start difference. First operand 247 states and 260 transitions. Second operand 4 states. [2018-12-02 05:27:00,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:27:00,882 INFO L93 Difference]: Finished difference Result 282 states and 298 transitions. [2018-12-02 05:27:00,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:27:00,882 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-12-02 05:27:00,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:27:00,883 INFO L225 Difference]: With dead ends: 282 [2018-12-02 05:27:00,883 INFO L226 Difference]: Without dead ends: 282 [2018-12-02 05:27:00,883 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-02 05:27:00,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-12-02 05:27:00,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 247. [2018-12-02 05:27:00,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-12-02 05:27:00,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 259 transitions. [2018-12-02 05:27:00,888 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 259 transitions. Word has length 21 [2018-12-02 05:27:00,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:27:00,889 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 259 transitions. [2018-12-02 05:27:00,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:27:00,889 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 259 transitions. [2018-12-02 05:27:00,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 05:27:00,889 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:27:00,889 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-02 05:27:00,890 INFO L423 AbstractCegarLoop]: === Iteration 9 === [merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-02 05:27:00,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:27:00,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1799341027, now seen corresponding path program 1 times [2018-12-02 05:27:00,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:27:00,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:27:00,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:27:00,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:27:00,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:27:00,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:27:00,947 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-02 05:27:00,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:27:00,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:27:00,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 05:27:00,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 05:27:00,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:27:00,948 INFO L87 Difference]: Start difference. First operand 247 states and 259 transitions. Second operand 6 states. [2018-12-02 05:27:01,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:27:01,181 INFO L93 Difference]: Finished difference Result 260 states and 275 transitions. [2018-12-02 05:27:01,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 05:27:01,181 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-12-02 05:27:01,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:27:01,182 INFO L225 Difference]: With dead ends: 260 [2018-12-02 05:27:01,182 INFO L226 Difference]: Without dead ends: 260 [2018-12-02 05:27:01,182 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-02 05:27:01,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-12-02 05:27:01,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 240. [2018-12-02 05:27:01,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-12-02 05:27:01,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 254 transitions. [2018-12-02 05:27:01,185 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 254 transitions. Word has length 25 [2018-12-02 05:27:01,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:27:01,185 INFO L480 AbstractCegarLoop]: Abstraction has 240 states and 254 transitions. [2018-12-02 05:27:01,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 05:27:01,185 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 254 transitions. [2018-12-02 05:27:01,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 05:27:01,186 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:27:01,186 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-02 05:27:01,186 INFO L423 AbstractCegarLoop]: === Iteration 10 === [merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-02 05:27:01,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:27:01,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1799341026, now seen corresponding path program 1 times [2018-12-02 05:27:01,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:27:01,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:27:01,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:27:01,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:27:01,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:27:01,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:27:01,229 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-02 05:27:01,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:27:01,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:27:01,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 05:27:01,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 05:27:01,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:27:01,231 INFO L87 Difference]: Start difference. First operand 240 states and 254 transitions. Second operand 6 states. [2018-12-02 05:27:01,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:27:01,493 INFO L93 Difference]: Finished difference Result 301 states and 317 transitions. [2018-12-02 05:27:01,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 05:27:01,493 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-12-02 05:27:01,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:27:01,494 INFO L225 Difference]: With dead ends: 301 [2018-12-02 05:27:01,494 INFO L226 Difference]: Without dead ends: 301 [2018-12-02 05:27:01,495 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-02 05:27:01,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-12-02 05:27:01,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 268. [2018-12-02 05:27:01,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-12-02 05:27:01,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 285 transitions. [2018-12-02 05:27:01,500 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 285 transitions. Word has length 25 [2018-12-02 05:27:01,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:27:01,500 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 285 transitions. [2018-12-02 05:27:01,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 05:27:01,501 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 285 transitions. [2018-12-02 05:27:01,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-02 05:27:01,501 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:27:01,501 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-02 05:27:01,502 INFO L423 AbstractCegarLoop]: === Iteration 11 === [merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-02 05:27:01,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:27:01,502 INFO L82 PathProgramCache]: Analyzing trace with hash 34413144, now seen corresponding path program 1 times [2018-12-02 05:27:01,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:27:01,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:27:01,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:27:01,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:27:01,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:27:01,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:27:01,620 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-02 05:27:01,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:27:01,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 05:27:01,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 05:27:01,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 05:27:01,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-02 05:27:01,621 INFO L87 Difference]: Start difference. First operand 268 states and 285 transitions. Second operand 10 states. [2018-12-02 05:27:02,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:27:02,078 INFO L93 Difference]: Finished difference Result 295 states and 311 transitions. [2018-12-02 05:27:02,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 05:27:02,078 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2018-12-02 05:27:02,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:27:02,079 INFO L225 Difference]: With dead ends: 295 [2018-12-02 05:27:02,079 INFO L226 Difference]: Without dead ends: 295 [2018-12-02 05:27:02,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2018-12-02 05:27:02,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-12-02 05:27:02,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 269. [2018-12-02 05:27:02,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-12-02 05:27:02,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 287 transitions. [2018-12-02 05:27:02,083 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 287 transitions. Word has length 36 [2018-12-02 05:27:02,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:27:02,083 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 287 transitions. [2018-12-02 05:27:02,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 05:27:02,083 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 287 transitions. [2018-12-02 05:27:02,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-02 05:27:02,084 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:27:02,084 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-02 05:27:02,084 INFO L423 AbstractCegarLoop]: === Iteration 12 === [merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-02 05:27:02,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:27:02,084 INFO L82 PathProgramCache]: Analyzing trace with hash 34413145, now seen corresponding path program 1 times [2018-12-02 05:27:02,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:27:02,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:27:02,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:27:02,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:27:02,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:27:02,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:27: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-02 05:27:02,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:27:02,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 05:27:02,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 05:27:02,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 05:27:02,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-02 05:27:02,175 INFO L87 Difference]: Start difference. First operand 269 states and 287 transitions. Second operand 9 states. [2018-12-02 05:27:02,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:27:02,563 INFO L93 Difference]: Finished difference Result 294 states and 310 transitions. [2018-12-02 05:27:02,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 05:27:02,563 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-12-02 05:27:02,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:27:02,564 INFO L225 Difference]: With dead ends: 294 [2018-12-02 05:27:02,564 INFO L226 Difference]: Without dead ends: 294 [2018-12-02 05:27:02,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-12-02 05:27:02,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-12-02 05:27:02,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 269. [2018-12-02 05:27:02,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-12-02 05:27:02,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 286 transitions. [2018-12-02 05:27:02,569 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 286 transitions. Word has length 36 [2018-12-02 05:27:02,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:27:02,570 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 286 transitions. [2018-12-02 05:27:02,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 05:27:02,570 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 286 transitions. [2018-12-02 05:27:02,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-02 05:27:02,570 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:27:02,570 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-02 05:27:02,571 INFO L423 AbstractCegarLoop]: === Iteration 13 === [merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-02 05:27:02,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:27:02,571 INFO L82 PathProgramCache]: Analyzing trace with hash 2127903738, now seen corresponding path program 1 times [2018-12-02 05:27:02,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:27:02,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:27:02,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:27:02,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:27:02,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:27:02,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:27:02,671 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-02 05:27:02,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:27:02,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 05:27:02,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 05:27:02,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 05:27:02,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-02 05:27:02,672 INFO L87 Difference]: Start difference. First operand 269 states and 286 transitions. Second operand 10 states. [2018-12-02 05:27:03,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:27:03,156 INFO L93 Difference]: Finished difference Result 293 states and 309 transitions. [2018-12-02 05:27:03,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 05:27:03,157 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2018-12-02 05:27:03,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:27:03,157 INFO L225 Difference]: With dead ends: 293 [2018-12-02 05:27:03,158 INFO L226 Difference]: Without dead ends: 293 [2018-12-02 05:27:03,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2018-12-02 05:27:03,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-12-02 05:27:03,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 269. [2018-12-02 05:27:03,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-12-02 05:27:03,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 285 transitions. [2018-12-02 05:27:03,161 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 285 transitions. Word has length 36 [2018-12-02 05:27:03,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:27:03,161 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 285 transitions. [2018-12-02 05:27:03,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 05:27:03,161 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 285 transitions. [2018-12-02 05:27:03,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-02 05:27:03,161 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:27:03,161 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-02 05:27:03,162 INFO L423 AbstractCegarLoop]: === Iteration 14 === [merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-02 05:27:03,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:27:03,162 INFO L82 PathProgramCache]: Analyzing trace with hash 2127903739, now seen corresponding path program 1 times [2018-12-02 05:27:03,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:27:03,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:27:03,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:27:03,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:27:03,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:27:03,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:27:03,249 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-02 05:27:03,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:27:03,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 05:27:03,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 05:27:03,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 05:27:03,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-02 05:27:03,250 INFO L87 Difference]: Start difference. First operand 269 states and 285 transitions. Second operand 8 states. [2018-12-02 05:27:03,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:27:03,602 INFO L93 Difference]: Finished difference Result 292 states and 308 transitions. [2018-12-02 05:27:03,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 05:27:03,602 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2018-12-02 05:27:03,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:27:03,603 INFO L225 Difference]: With dead ends: 292 [2018-12-02 05:27:03,603 INFO L226 Difference]: Without dead ends: 292 [2018-12-02 05:27:03,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-12-02 05:27:03,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-12-02 05:27:03,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 269. [2018-12-02 05:27:03,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-12-02 05:27:03,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 284 transitions. [2018-12-02 05:27:03,608 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 284 transitions. Word has length 36 [2018-12-02 05:27:03,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:27:03,608 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 284 transitions. [2018-12-02 05:27:03,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 05:27:03,608 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 284 transitions. [2018-12-02 05:27:03,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-02 05:27:03,609 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:27:03,609 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-02 05:27:03,609 INFO L423 AbstractCegarLoop]: === Iteration 15 === [merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-02 05:27:03,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:27:03,610 INFO L82 PathProgramCache]: Analyzing trace with hash -627690379, now seen corresponding path program 1 times [2018-12-02 05:27:03,610 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:27:03,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:27:03,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:27:03,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:27:03,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:27:03,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:27:03,731 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-02 05:27:03,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:27:03,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-02 05:27:03,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 05:27:03,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 05:27:03,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-02 05:27:03,732 INFO L87 Difference]: Start difference. First operand 269 states and 284 transitions. Second operand 12 states. [2018-12-02 05:27:04,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:27:04,251 INFO L93 Difference]: Finished difference Result 246 states and 260 transitions. [2018-12-02 05:27:04,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 05:27:04,252 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-12-02 05:27:04,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:27:04,252 INFO L225 Difference]: With dead ends: 246 [2018-12-02 05:27:04,252 INFO L226 Difference]: Without dead ends: 235 [2018-12-02 05:27:04,253 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-02 05:27:04,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-12-02 05:27:04,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 217. [2018-12-02 05:27:04,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-12-02 05:27:04,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 230 transitions. [2018-12-02 05:27:04,255 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 230 transitions. Word has length 41 [2018-12-02 05:27:04,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:27:04,255 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 230 transitions. [2018-12-02 05:27:04,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 05:27:04,255 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 230 transitions. [2018-12-02 05:27:04,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 05:27:04,256 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:27:04,256 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-02 05:27:04,256 INFO L423 AbstractCegarLoop]: === Iteration 16 === [merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-02 05:27:04,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:27:04,256 INFO L82 PathProgramCache]: Analyzing trace with hash -501181479, now seen corresponding path program 1 times [2018-12-02 05:27:04,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:27:04,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:27:04,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:27:04,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:27:04,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:27:04,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:27:04,283 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-02 05:27:04,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:27:04,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:27:04,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 05:27:04,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 05:27:04,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:27:04,284 INFO L87 Difference]: Start difference. First operand 217 states and 230 transitions. Second operand 6 states. [2018-12-02 05:27:04,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:27:04,524 INFO L93 Difference]: Finished difference Result 247 states and 266 transitions. [2018-12-02 05:27:04,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 05:27:04,530 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-12-02 05:27:04,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:27:04,530 INFO L225 Difference]: With dead ends: 247 [2018-12-02 05:27:04,530 INFO L226 Difference]: Without dead ends: 247 [2018-12-02 05:27:04,530 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-02 05:27:04,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-12-02 05:27:04,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 217. [2018-12-02 05:27:04,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-12-02 05:27:04,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 232 transitions. [2018-12-02 05:27:04,533 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 232 transitions. Word has length 46 [2018-12-02 05:27:04,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:27:04,533 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 232 transitions. [2018-12-02 05:27:04,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 05:27:04,533 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 232 transitions. [2018-12-02 05:27:04,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 05:27:04,533 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:27:04,533 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-02 05:27:04,534 INFO L423 AbstractCegarLoop]: === Iteration 17 === [merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-02 05:27:04,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:27:04,534 INFO L82 PathProgramCache]: Analyzing trace with hash -501181478, now seen corresponding path program 1 times [2018-12-02 05:27:04,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:27:04,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:27:04,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:27:04,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:27:04,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:27:04,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:27:04,586 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-02 05:27:04,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:27:04,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:27:04,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 05:27:04,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 05:27:04,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:27:04,586 INFO L87 Difference]: Start difference. First operand 217 states and 232 transitions. Second operand 6 states. [2018-12-02 05:27:04,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:27:04,773 INFO L93 Difference]: Finished difference Result 256 states and 275 transitions. [2018-12-02 05:27:04,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 05:27:04,773 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-12-02 05:27:04,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:27:04,773 INFO L225 Difference]: With dead ends: 256 [2018-12-02 05:27:04,773 INFO L226 Difference]: Without dead ends: 256 [2018-12-02 05:27:04,774 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-02 05:27:04,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-12-02 05:27:04,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 229. [2018-12-02 05:27:04,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-12-02 05:27:04,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 247 transitions. [2018-12-02 05:27:04,776 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 247 transitions. Word has length 46 [2018-12-02 05:27:04,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:27:04,776 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 247 transitions. [2018-12-02 05:27:04,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 05:27:04,776 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 247 transitions. [2018-12-02 05:27:04,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-02 05:27:04,777 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:27:04,777 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-02 05:27:04,777 INFO L423 AbstractCegarLoop]: === Iteration 18 === [merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-02 05:27:04,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:27:04,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1578320400, now seen corresponding path program 1 times [2018-12-02 05:27:04,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:27:04,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:27:04,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:27:04,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:27:04,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:27:04,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:27:04,795 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-02 05:27:04,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:27:04,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:27:04,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:27:04,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:27:04,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:27:04,796 INFO L87 Difference]: Start difference. First operand 229 states and 247 transitions. Second operand 5 states. [2018-12-02 05:27:04,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:27:04,938 INFO L93 Difference]: Finished difference Result 226 states and 244 transitions. [2018-12-02 05:27:04,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 05:27:04,939 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-12-02 05:27:04,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:27:04,939 INFO L225 Difference]: With dead ends: 226 [2018-12-02 05:27:04,940 INFO L226 Difference]: Without dead ends: 226 [2018-12-02 05:27:04,940 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-02 05:27:04,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-12-02 05:27:04,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2018-12-02 05:27:04,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-12-02 05:27:04,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 244 transitions. [2018-12-02 05:27:04,944 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 244 transitions. Word has length 47 [2018-12-02 05:27:04,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:27:04,944 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 244 transitions. [2018-12-02 05:27:04,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:27:04,944 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 244 transitions. [2018-12-02 05:27:04,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-02 05:27:04,944 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:27:04,944 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-02 05:27:04,945 INFO L423 AbstractCegarLoop]: === Iteration 19 === [merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-02 05:27:04,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:27:04,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1578320401, now seen corresponding path program 1 times [2018-12-02 05:27:04,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:27:04,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:27:04,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:27:04,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:27:04,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:27:04,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:27:04,990 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-02 05:27:04,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:27:04,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:27:04,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 05:27:04,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 05:27:04,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:27:04,990 INFO L87 Difference]: Start difference. First operand 226 states and 244 transitions. Second operand 6 states. [2018-12-02 05:27:05,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:27:05,196 INFO L93 Difference]: Finished difference Result 275 states and 293 transitions. [2018-12-02 05:27:05,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 05:27:05,197 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-12-02 05:27:05,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:27:05,197 INFO L225 Difference]: With dead ends: 275 [2018-12-02 05:27:05,198 INFO L226 Difference]: Without dead ends: 275 [2018-12-02 05:27:05,198 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-02 05:27:05,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-12-02 05:27:05,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 247. [2018-12-02 05:27:05,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-12-02 05:27:05,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 271 transitions. [2018-12-02 05:27:05,202 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 271 transitions. Word has length 47 [2018-12-02 05:27:05,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:27:05,202 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 271 transitions. [2018-12-02 05:27:05,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 05:27:05,202 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 271 transitions. [2018-12-02 05:27:05,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-02 05:27:05,202 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:27:05,203 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-02 05:27:05,203 INFO L423 AbstractCegarLoop]: === Iteration 20 === [merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-02 05:27:05,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:27:05,203 INFO L82 PathProgramCache]: Analyzing trace with hash -183169795, now seen corresponding path program 1 times [2018-12-02 05:27:05,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:27:05,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:27:05,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:27:05,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:27:05,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:27:05,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:27:05,230 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-02 05:27:05,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:27:05,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 05:27:05,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 05:27:05,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 05:27:05,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:27:05,231 INFO L87 Difference]: Start difference. First operand 247 states and 271 transitions. Second operand 6 states. [2018-12-02 05:27:05,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:27:05,312 INFO L93 Difference]: Finished difference Result 300 states and 324 transitions. [2018-12-02 05:27:05,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 05:27:05,312 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2018-12-02 05:27:05,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:27:05,313 INFO L225 Difference]: With dead ends: 300 [2018-12-02 05:27:05,313 INFO L226 Difference]: Without dead ends: 297 [2018-12-02 05:27:05,314 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-02 05:27:05,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-12-02 05:27:05,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 254. [2018-12-02 05:27:05,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-12-02 05:27:05,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 279 transitions. [2018-12-02 05:27:05,319 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 279 transitions. Word has length 50 [2018-12-02 05:27:05,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:27:05,319 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 279 transitions. [2018-12-02 05:27:05,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 05:27:05,319 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 279 transitions. [2018-12-02 05:27:05,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-02 05:27:05,320 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:27:05,320 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-02 05:27:05,320 INFO L423 AbstractCegarLoop]: === Iteration 21 === [merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-02 05:27:05,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:27:05,320 INFO L82 PathProgramCache]: Analyzing trace with hash -160230747, now seen corresponding path program 1 times [2018-12-02 05:27:05,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:27:05,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:27:05,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:27:05,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:27:05,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:27:05,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:27:05,491 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-02 05:27:05,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:27:05,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-02 05:27:05,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 05:27:05,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 05:27:05,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-12-02 05:27:05,492 INFO L87 Difference]: Start difference. First operand 254 states and 279 transitions. Second operand 14 states. [2018-12-02 05:27:05,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:27:05,803 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-12-02 05:27:05,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 05:27:05,803 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 50 [2018-12-02 05:27:05,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:27:05,803 INFO L225 Difference]: With dead ends: 44 [2018-12-02 05:27:05,803 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 05:27:05,804 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-02 05:27:05,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 05:27:05,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 05:27:05,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 05:27:05,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 05:27:05,804 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2018-12-02 05:27:05,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:27:05,805 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 05:27:05,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 05:27:05,805 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 05:27:05,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 05:27:05,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 05:27:05 BoogieIcfgContainer [2018-12-02 05:27:05,810 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 05:27:05,810 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 05:27:05,810 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 05:27:05,811 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 05:27:05,811 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:26:59" (3/4) ... [2018-12-02 05:27:05,814 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 05:27:05,819 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fail [2018-12-02 05:27:05,819 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 05:27:05,819 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure merge_pair [2018-12-02 05:27:05,819 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure merge_single_node [2018-12-02 05:27:05,819 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2018-12-02 05:27:05,819 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure seq_sort_core [2018-12-02 05:27:05,820 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2018-12-02 05:27:05,820 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure inspect_before [2018-12-02 05:27:05,820 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 05:27:05,820 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure inspect_after [2018-12-02 05:27:05,826 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2018-12-02 05:27:05,826 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2018-12-02 05:27:05,827 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-02 05:27:05,866 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_32f7bb3d-8d78-4961-8129-430174e35962/bin-2019/uautomizer/witness.graphml [2018-12-02 05:27:05,867 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 05:27:05,867 INFO L168 Benchmark]: Toolchain (without parser) took 6835.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.8 MB). Free memory was 951.7 MB in the beginning and 802.0 MB in the end (delta: 149.7 MB). Peak memory consumption was 318.5 MB. Max. memory is 11.5 GB. [2018-12-02 05:27:05,868 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 05:27:05,868 INFO L168 Benchmark]: CACSL2BoogieTranslator took 282.46 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 86.5 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -118.6 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2018-12-02 05:27:05,869 INFO L168 Benchmark]: Boogie Preprocessor took 39.36 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-02 05:27:05,869 INFO L168 Benchmark]: RCFGBuilder took 494.55 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 969.2 MB in the end (delta: 95.8 MB). Peak memory consumption was 95.8 MB. Max. memory is 11.5 GB. [2018-12-02 05:27:05,869 INFO L168 Benchmark]: TraceAbstraction took 5959.80 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 82.3 MB). Free memory was 969.2 MB in the beginning and 809.4 MB in the end (delta: 159.8 MB). Peak memory consumption was 242.1 MB. Max. memory is 11.5 GB. [2018-12-02 05:27:05,869 INFO L168 Benchmark]: Witness Printer took 56.34 ms. Allocated memory is still 1.2 GB. Free memory was 809.4 MB in the beginning and 802.0 MB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 11.5 GB. [2018-12-02 05:27:05,871 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 282.46 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 86.5 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -118.6 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.36 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 494.55 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 969.2 MB in the end (delta: 95.8 MB). Peak memory consumption was 95.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5959.80 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 82.3 MB). Free memory was 969.2 MB in the beginning and 809.4 MB in the end (delta: 159.8 MB). Peak memory consumption was 242.1 MB. Max. memory is 11.5 GB. * Witness Printer took 56.34 ms. Allocated memory is still 1.2 GB. Free memory was 809.4 MB in the beginning and 802.0 MB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 590]: 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: 588]: 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: 588]: 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: 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: 598]: free always succeeds For all program executions holds that free 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: 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: 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: 608]: 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: 613]: 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: 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: 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: 612]: 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: 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: 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: 644]: 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: 638]: 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: 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: 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: 647]: 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: 633]: 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: 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: 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: 650]: 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: 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: 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: 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: 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 11 procedures, 278 locations, 101 error locations. SAFE Result, 5.9s OverallTime, 21 OverallIterations, 2 TraceHistogramMax, 4.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4586 SDtfs, 2008 SDslu, 10434 SDs, 0 SdLazy, 7065 SolverSat, 242 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 197 GetRequests, 49 SyntacticMatches, 10 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=272occurred in iteration=0, 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, 479 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, 134191 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...