./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/heap-manipulation/merge_sort-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 5758efa3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/heap-manipulation/merge_sort-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 64bit --witnessprinter.graph.data.programhash 534681b11e8e68e6058985d885b01f2cbfa43e5b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup) --- Real Ultimate output --- This is Ultimate 0.1.24-5758efa [2019-11-26 20:56:35,432 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 20:56:35,435 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 20:56:35,451 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 20:56:35,452 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 20:56:35,454 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 20:56:35,456 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 20:56:35,466 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 20:56:35,471 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 20:56:35,475 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 20:56:35,476 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 20:56:35,479 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 20:56:35,479 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 20:56:35,482 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 20:56:35,484 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 20:56:35,486 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 20:56:35,488 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 20:56:35,489 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 20:56:35,493 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 20:56:35,497 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 20:56:35,502 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 20:56:35,506 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 20:56:35,508 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 20:56:35,510 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 20:56:35,514 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 20:56:35,515 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 20:56:35,515 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 20:56:35,517 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 20:56:35,518 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 20:56:35,519 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 20:56:35,520 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 20:56:35,521 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 20:56:35,522 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 20:56:35,524 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 20:56:35,525 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 20:56:35,526 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 20:56:35,527 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 20:56:35,527 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 20:56:35,527 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 20:56:35,528 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 20:56:35,530 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 20:56:35,531 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-64bit-Automizer_Default.epf [2019-11-26 20:56:35,553 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 20:56:35,554 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 20:56:35,555 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-26 20:56:35,555 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-26 20:56:35,556 INFO L138 SettingsManager]: * Use SBE=true [2019-11-26 20:56:35,556 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 20:56:35,556 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-26 20:56:35,557 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 20:56:35,557 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 20:56:35,557 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-26 20:56:35,557 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-26 20:56:35,558 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 20:56:35,560 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-26 20:56:35,560 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-26 20:56:35,560 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 20:56:35,561 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-26 20:56:35,561 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 20:56:35,561 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 20:56:35,561 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 20:56:35,562 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 20:56:35,562 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 20:56:35,562 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-26 20:56:35,562 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 20:56:35,562 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 534681b11e8e68e6058985d885b01f2cbfa43e5b [2019-11-26 20:56:35,868 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 20:56:35,882 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 20:56:35,885 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 20:56:35,887 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 20:56:35,888 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 20:56:35,888 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/merge_sort-1.i [2019-11-26 20:56:35,951 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57679b75b/384f30ec62c54ebd88f558a89416ab62/FLAG4cdfbeaab [2019-11-26 20:56:36,453 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 20:56:36,458 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/merge_sort-1.i [2019-11-26 20:56:36,492 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57679b75b/384f30ec62c54ebd88f558a89416ab62/FLAG4cdfbeaab [2019-11-26 20:56:36,785 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57679b75b/384f30ec62c54ebd88f558a89416ab62 [2019-11-26 20:56:36,790 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 20:56:36,792 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-26 20:56:36,795 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 20:56:36,796 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 20:56:36,799 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 20:56:36,800 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 08:56:36" (1/1) ... [2019-11-26 20:56:36,804 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b9b6f68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:56:36, skipping insertion in model container [2019-11-26 20:56:36,804 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 08:56:36" (1/1) ... [2019-11-26 20:56:36,813 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 20:56:36,860 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-26 20:56:37,326 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 20:56:37,337 INFO L203 MainTranslator]: Completed pre-run [2019-11-26 20:56:37,411 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 20:56:37,465 INFO L208 MainTranslator]: Completed translation [2019-11-26 20:56:37,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:56:37 WrapperNode [2019-11-26 20:56:37,466 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 20:56:37,467 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 20:56:37,467 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 20:56:37,468 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 20:56:37,483 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:56:37" (1/1) ... [2019-11-26 20:56:37,483 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:56:37" (1/1) ... [2019-11-26 20:56:37,503 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:56:37" (1/1) ... [2019-11-26 20:56:37,503 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:56:37" (1/1) ... [2019-11-26 20:56:37,535 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:56:37" (1/1) ... [2019-11-26 20:56:37,553 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:56:37" (1/1) ... [2019-11-26 20:56:37,559 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:56:37" (1/1) ... [2019-11-26 20:56:37,568 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 20:56:37,575 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 20:56:37,575 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 20:56:37,575 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 20:56:37,576 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:56:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 20:56:37,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-26 20:56:37,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 20:56:37,634 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-26 20:56:37,634 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-26 20:56:37,634 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2019-11-26 20:56:37,634 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2019-11-26 20:56:37,635 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_pair [2019-11-26 20:56:37,635 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_sort_core [2019-11-26 20:56:37,635 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_before [2019-11-26 20:56:37,635 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_after [2019-11-26 20:56:37,636 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-26 20:56:37,636 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-26 20:56:37,636 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-26 20:56:37,637 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-26 20:56:37,637 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-26 20:56:37,637 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-26 20:56:37,637 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-26 20:56:37,638 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-26 20:56:37,638 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-26 20:56:37,638 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-26 20:56:37,638 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-26 20:56:37,639 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-26 20:56:37,639 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-26 20:56:37,639 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-26 20:56:37,639 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-26 20:56:37,640 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-26 20:56:37,640 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-26 20:56:37,640 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-26 20:56:37,640 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-26 20:56:37,641 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-26 20:56:37,641 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-26 20:56:37,641 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-26 20:56:37,641 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-26 20:56:37,642 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-26 20:56:37,642 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-26 20:56:37,642 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-26 20:56:37,642 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-26 20:56:37,643 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-26 20:56:37,643 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-26 20:56:37,643 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-26 20:56:37,643 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-26 20:56:37,644 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-26 20:56:37,644 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-26 20:56:37,644 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-26 20:56:37,644 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-26 20:56:37,645 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-26 20:56:37,645 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-26 20:56:37,645 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-26 20:56:37,646 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-26 20:56:37,646 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-26 20:56:37,646 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-26 20:56:37,646 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-26 20:56:37,646 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-26 20:56:37,647 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-26 20:56:37,647 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-26 20:56:37,647 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-26 20:56:37,647 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-26 20:56:37,647 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-26 20:56:37,648 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-26 20:56:37,648 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-26 20:56:37,648 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-26 20:56:37,648 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-26 20:56:37,649 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-26 20:56:37,649 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-26 20:56:37,649 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-26 20:56:37,649 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-26 20:56:37,649 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-26 20:56:37,650 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-26 20:56:37,650 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-26 20:56:37,650 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-26 20:56:37,650 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-26 20:56:37,650 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-26 20:56:37,651 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-26 20:56:37,651 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-26 20:56:37,651 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-26 20:56:37,651 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-26 20:56:37,651 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-26 20:56:37,652 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-26 20:56:37,652 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-26 20:56:37,652 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-26 20:56:37,652 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-26 20:56:37,653 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-26 20:56:37,653 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-26 20:56:37,653 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-26 20:56:37,653 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-26 20:56:37,653 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-26 20:56:37,654 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-26 20:56:37,654 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-26 20:56:37,654 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-26 20:56:37,654 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-26 20:56:37,655 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-26 20:56:37,655 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-26 20:56:37,655 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-26 20:56:37,655 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-26 20:56:37,655 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-26 20:56:37,656 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-26 20:56:37,656 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-26 20:56:37,656 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-26 20:56:37,656 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-26 20:56:37,656 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-26 20:56:37,657 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-26 20:56:37,657 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-26 20:56:37,657 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-26 20:56:37,657 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-26 20:56:37,657 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-26 20:56:37,657 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-26 20:56:37,658 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-26 20:56:37,658 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-26 20:56:37,658 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-26 20:56:37,658 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-26 20:56:37,658 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-26 20:56:37,659 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-26 20:56:37,659 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-26 20:56:37,659 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-26 20:56:37,659 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-26 20:56:37,659 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2019-11-26 20:56:37,660 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2019-11-26 20:56:37,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-26 20:56:37,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-26 20:56:37,660 INFO L130 BoogieDeclarations]: Found specification of procedure merge_pair [2019-11-26 20:56:37,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-26 20:56:37,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-26 20:56:37,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-26 20:56:37,661 INFO L130 BoogieDeclarations]: Found specification of procedure seq_sort_core [2019-11-26 20:56:37,661 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_before [2019-11-26 20:56:37,661 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_after [2019-11-26 20:56:37,662 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-26 20:56:37,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-26 20:56:37,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-26 20:56:37,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-26 20:56:37,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 20:56:38,817 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 20:56:38,817 INFO L284 CfgBuilder]: Removed 33 assume(true) statements. [2019-11-26 20:56:38,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 08:56:38 BoogieIcfgContainer [2019-11-26 20:56:38,819 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 20:56:38,822 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 20:56:38,822 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 20:56:38,829 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 20:56:38,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 08:56:36" (1/3) ... [2019-11-26 20:56:38,832 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fc683b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 08:56:38, skipping insertion in model container [2019-11-26 20:56:38,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:56:37" (2/3) ... [2019-11-26 20:56:38,833 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fc683b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 08:56:38, skipping insertion in model container [2019-11-26 20:56:38,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 08:56:38" (3/3) ... [2019-11-26 20:56:38,835 INFO L109 eAbstractionObserver]: Analyzing ICFG merge_sort-1.i [2019-11-26 20:56:38,847 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 20:56:38,860 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 105 error locations. [2019-11-26 20:56:38,876 INFO L249 AbstractCegarLoop]: Starting to check reachability of 105 error locations. [2019-11-26 20:56:38,902 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 20:56:38,903 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-26 20:56:38,912 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 20:56:38,912 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 20:56:38,913 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 20:56:38,913 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 20:56:38,913 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 20:56:38,913 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 20:56:38,959 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states. [2019-11-26 20:56:38,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-26 20:56:38,977 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:56:38,978 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:56:38,979 INFO L410 AbstractCegarLoop]: === Iteration 1 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-26 20:56:38,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:56:38,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1848291795, now seen corresponding path program 1 times [2019-11-26 20:56:38,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:56:38,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547078364] [2019-11-26 20:56:38,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:56:39,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:56:39,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:56:39,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:56:39,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547078364] [2019-11-26 20:56:39,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:56:39,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 20:56:39,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740035220] [2019-11-26 20:56:39,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 20:56:39,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:56:39,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 20:56:39,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 20:56:39,215 INFO L87 Difference]: Start difference. First operand 279 states. Second operand 3 states. [2019-11-26 20:56:39,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:56:39,773 INFO L93 Difference]: Finished difference Result 319 states and 354 transitions. [2019-11-26 20:56:39,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 20:56:39,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-26 20:56:39,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:56:39,800 INFO L225 Difference]: With dead ends: 319 [2019-11-26 20:56:39,800 INFO L226 Difference]: Without dead ends: 315 [2019-11-26 20:56:39,802 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 20:56:39,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-11-26 20:56:39,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 277. [2019-11-26 20:56:39,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-11-26 20:56:39,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 303 transitions. [2019-11-26 20:56:39,877 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 303 transitions. Word has length 9 [2019-11-26 20:56:39,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:56:39,879 INFO L462 AbstractCegarLoop]: Abstraction has 277 states and 303 transitions. [2019-11-26 20:56:39,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 20:56:39,879 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 303 transitions. [2019-11-26 20:56:39,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-26 20:56:39,880 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:56:39,880 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:56:39,881 INFO L410 AbstractCegarLoop]: === Iteration 2 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-26 20:56:39,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:56:39,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1461424039, now seen corresponding path program 1 times [2019-11-26 20:56:39,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:56:39,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768178815] [2019-11-26 20:56:39,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:56:39,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:56:39,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:56:39,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:56:39,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768178815] [2019-11-26 20:56:39,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:56:39,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 20:56:39,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964118662] [2019-11-26 20:56:39,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 20:56:39,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:56:39,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 20:56:39,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 20:56:39,982 INFO L87 Difference]: Start difference. First operand 277 states and 303 transitions. Second operand 4 states. [2019-11-26 20:56:40,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:56:40,757 INFO L93 Difference]: Finished difference Result 332 states and 369 transitions. [2019-11-26 20:56:40,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 20:56:40,759 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-26 20:56:40,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:56:40,762 INFO L225 Difference]: With dead ends: 332 [2019-11-26 20:56:40,762 INFO L226 Difference]: Without dead ends: 332 [2019-11-26 20:56:40,763 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 20:56:40,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-11-26 20:56:40,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 275. [2019-11-26 20:56:40,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-11-26 20:56:40,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 301 transitions. [2019-11-26 20:56:40,785 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 301 transitions. Word has length 10 [2019-11-26 20:56:40,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:56:40,786 INFO L462 AbstractCegarLoop]: Abstraction has 275 states and 301 transitions. [2019-11-26 20:56:40,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 20:56:40,786 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 301 transitions. [2019-11-26 20:56:40,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-26 20:56:40,787 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:56:40,787 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:56:40,787 INFO L410 AbstractCegarLoop]: === Iteration 3 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-26 20:56:40,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:56:40,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1461424040, now seen corresponding path program 1 times [2019-11-26 20:56:40,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:56:40,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990724182] [2019-11-26 20:56:40,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:56:40,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:56:40,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:56:40,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:56:40,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990724182] [2019-11-26 20:56:40,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:56:40,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 20:56:40,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184734490] [2019-11-26 20:56:40,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 20:56:40,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:56:40,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 20:56:40,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 20:56:40,934 INFO L87 Difference]: Start difference. First operand 275 states and 301 transitions. Second operand 4 states. [2019-11-26 20:56:41,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:56:41,555 INFO L93 Difference]: Finished difference Result 311 states and 345 transitions. [2019-11-26 20:56:41,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 20:56:41,561 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-26 20:56:41,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:56:41,563 INFO L225 Difference]: With dead ends: 311 [2019-11-26 20:56:41,564 INFO L226 Difference]: Without dead ends: 311 [2019-11-26 20:56:41,565 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 20:56:41,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-11-26 20:56:41,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 273. [2019-11-26 20:56:41,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-11-26 20:56:41,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 299 transitions. [2019-11-26 20:56:41,598 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 299 transitions. Word has length 10 [2019-11-26 20:56:41,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:56:41,598 INFO L462 AbstractCegarLoop]: Abstraction has 273 states and 299 transitions. [2019-11-26 20:56:41,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 20:56:41,599 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 299 transitions. [2019-11-26 20:56:41,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-26 20:56:41,599 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:56:41,600 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:56:41,600 INFO L410 AbstractCegarLoop]: === Iteration 4 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-26 20:56:41,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:56:41,601 INFO L82 PathProgramCache]: Analyzing trace with hash 180424867, now seen corresponding path program 1 times [2019-11-26 20:56:41,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:56:41,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721034746] [2019-11-26 20:56:41,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:56:41,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:56:41,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:56:41,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:56:41,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721034746] [2019-11-26 20:56:41,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:56:41,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 20:56:41,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440583994] [2019-11-26 20:56:41,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 20:56:41,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:56:41,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 20:56:41,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 20:56:41,644 INFO L87 Difference]: Start difference. First operand 273 states and 299 transitions. Second operand 4 states. [2019-11-26 20:56:42,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:56:42,198 INFO L93 Difference]: Finished difference Result 308 states and 335 transitions. [2019-11-26 20:56:42,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 20:56:42,198 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-26 20:56:42,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:56:42,201 INFO L225 Difference]: With dead ends: 308 [2019-11-26 20:56:42,201 INFO L226 Difference]: Without dead ends: 307 [2019-11-26 20:56:42,201 INFO L630 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 [2019-11-26 20:56:42,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-11-26 20:56:42,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 272. [2019-11-26 20:56:42,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-11-26 20:56:42,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 297 transitions. [2019-11-26 20:56:42,214 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 297 transitions. Word has length 14 [2019-11-26 20:56:42,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:56:42,214 INFO L462 AbstractCegarLoop]: Abstraction has 272 states and 297 transitions. [2019-11-26 20:56:42,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 20:56:42,214 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 297 transitions. [2019-11-26 20:56:42,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-26 20:56:42,215 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:56:42,215 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:56:42,216 INFO L410 AbstractCegarLoop]: === Iteration 5 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-26 20:56:42,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:56:42,217 INFO L82 PathProgramCache]: Analyzing trace with hash 438887496, now seen corresponding path program 1 times [2019-11-26 20:56:42,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:56:42,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763094895] [2019-11-26 20:56:42,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:56:42,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:56:42,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:56:42,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:56:42,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763094895] [2019-11-26 20:56:42,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:56:42,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 20:56:42,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135478543] [2019-11-26 20:56:42,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 20:56:42,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:56:42,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 20:56:42,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 20:56:42,306 INFO L87 Difference]: Start difference. First operand 272 states and 297 transitions. Second operand 4 states. [2019-11-26 20:56:42,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:56:42,879 INFO L93 Difference]: Finished difference Result 314 states and 345 transitions. [2019-11-26 20:56:42,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 20:56:42,880 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-26 20:56:42,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:56:42,882 INFO L225 Difference]: With dead ends: 314 [2019-11-26 20:56:42,882 INFO L226 Difference]: Without dead ends: 314 [2019-11-26 20:56:42,883 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 20:56:42,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-11-26 20:56:42,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 270. [2019-11-26 20:56:42,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-11-26 20:56:42,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 295 transitions. [2019-11-26 20:56:42,894 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 295 transitions. Word has length 15 [2019-11-26 20:56:42,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:56:42,894 INFO L462 AbstractCegarLoop]: Abstraction has 270 states and 295 transitions. [2019-11-26 20:56:42,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 20:56:42,894 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 295 transitions. [2019-11-26 20:56:42,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-26 20:56:42,895 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:56:42,895 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:56:42,895 INFO L410 AbstractCegarLoop]: === Iteration 6 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-26 20:56:42,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:56:42,896 INFO L82 PathProgramCache]: Analyzing trace with hash 438887497, now seen corresponding path program 1 times [2019-11-26 20:56:42,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:56:42,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273786935] [2019-11-26 20:56:42,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:56:42,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:56:42,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:56:42,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:56:42,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273786935] [2019-11-26 20:56:42,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:56:42,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 20:56:42,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159048807] [2019-11-26 20:56:42,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 20:56:42,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:56:42,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 20:56:42,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 20:56:42,961 INFO L87 Difference]: Start difference. First operand 270 states and 295 transitions. Second operand 4 states. [2019-11-26 20:56:43,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:56:43,505 INFO L93 Difference]: Finished difference Result 318 states and 350 transitions. [2019-11-26 20:56:43,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 20:56:43,506 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-26 20:56:43,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:56:43,508 INFO L225 Difference]: With dead ends: 318 [2019-11-26 20:56:43,508 INFO L226 Difference]: Without dead ends: 318 [2019-11-26 20:56:43,509 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 20:56:43,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-11-26 20:56:43,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 268. [2019-11-26 20:56:43,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-11-26 20:56:43,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 293 transitions. [2019-11-26 20:56:43,520 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 293 transitions. Word has length 15 [2019-11-26 20:56:43,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:56:43,520 INFO L462 AbstractCegarLoop]: Abstraction has 268 states and 293 transitions. [2019-11-26 20:56:43,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 20:56:43,521 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 293 transitions. [2019-11-26 20:56:43,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-26 20:56:43,522 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:56:43,522 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:56:43,522 INFO L410 AbstractCegarLoop]: === Iteration 7 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-26 20:56:43,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:56:43,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1724277052, now seen corresponding path program 1 times [2019-11-26 20:56:43,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:56:43,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585093322] [2019-11-26 20:56:43,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:56:43,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:56:43,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:56:43,615 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:56:43,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585093322] [2019-11-26 20:56:43,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:56:43,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 20:56:43,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826922531] [2019-11-26 20:56:43,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 20:56:43,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:56:43,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 20:56:43,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 20:56:43,618 INFO L87 Difference]: Start difference. First operand 268 states and 293 transitions. Second operand 5 states. [2019-11-26 20:56:44,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:56:44,283 INFO L93 Difference]: Finished difference Result 327 states and 359 transitions. [2019-11-26 20:56:44,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 20:56:44,284 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-11-26 20:56:44,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:56:44,286 INFO L225 Difference]: With dead ends: 327 [2019-11-26 20:56:44,286 INFO L226 Difference]: Without dead ends: 327 [2019-11-26 20:56:44,287 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-26 20:56:44,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-11-26 20:56:44,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 268. [2019-11-26 20:56:44,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-11-26 20:56:44,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 292 transitions. [2019-11-26 20:56:44,296 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 292 transitions. Word has length 21 [2019-11-26 20:56:44,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:56:44,296 INFO L462 AbstractCegarLoop]: Abstraction has 268 states and 292 transitions. [2019-11-26 20:56:44,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 20:56:44,297 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 292 transitions. [2019-11-26 20:56:44,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-26 20:56:44,298 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:56:44,298 INFO L410 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] [2019-11-26 20:56:44,298 INFO L410 AbstractCegarLoop]: === Iteration 8 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-26 20:56:44,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:56:44,299 INFO L82 PathProgramCache]: Analyzing trace with hash 410367502, now seen corresponding path program 1 times [2019-11-26 20:56:44,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:56:44,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555238932] [2019-11-26 20:56:44,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:56:44,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:56:44,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:56:44,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:56:44,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555238932] [2019-11-26 20:56:44,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:56:44,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-26 20:56:44,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775875591] [2019-11-26 20:56:44,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-26 20:56:44,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:56:44,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-26 20:56:44,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-26 20:56:44,393 INFO L87 Difference]: Start difference. First operand 268 states and 292 transitions. Second operand 7 states. [2019-11-26 20:56:45,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:56:45,387 INFO L93 Difference]: Finished difference Result 382 states and 420 transitions. [2019-11-26 20:56:45,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 20:56:45,387 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-11-26 20:56:45,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:56:45,390 INFO L225 Difference]: With dead ends: 382 [2019-11-26 20:56:45,391 INFO L226 Difference]: Without dead ends: 382 [2019-11-26 20:56:45,391 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-26 20:56:45,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-11-26 20:56:45,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 271. [2019-11-26 20:56:45,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-11-26 20:56:45,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 297 transitions. [2019-11-26 20:56:45,401 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 297 transitions. Word has length 25 [2019-11-26 20:56:45,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:56:45,402 INFO L462 AbstractCegarLoop]: Abstraction has 271 states and 297 transitions. [2019-11-26 20:56:45,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-26 20:56:45,402 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 297 transitions. [2019-11-26 20:56:45,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-26 20:56:45,403 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:56:45,403 INFO L410 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] [2019-11-26 20:56:45,404 INFO L410 AbstractCegarLoop]: === Iteration 9 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-26 20:56:45,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:56:45,404 INFO L82 PathProgramCache]: Analyzing trace with hash 410353194, now seen corresponding path program 1 times [2019-11-26 20:56:45,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:56:45,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766548237] [2019-11-26 20:56:45,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:56:45,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:56:45,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:56:45,490 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:56:45,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766548237] [2019-11-26 20:56:45,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:56:45,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 20:56:45,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737662747] [2019-11-26 20:56:45,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-26 20:56:45,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:56:45,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-26 20:56:45,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-26 20:56:45,496 INFO L87 Difference]: Start difference. First operand 271 states and 297 transitions. Second operand 7 states. [2019-11-26 20:56:46,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:56:46,575 INFO L93 Difference]: Finished difference Result 310 states and 341 transitions. [2019-11-26 20:56:46,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-26 20:56:46,576 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-11-26 20:56:46,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:56:46,579 INFO L225 Difference]: With dead ends: 310 [2019-11-26 20:56:46,579 INFO L226 Difference]: Without dead ends: 310 [2019-11-26 20:56:46,579 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-26 20:56:46,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-11-26 20:56:46,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 263. [2019-11-26 20:56:46,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-11-26 20:56:46,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 289 transitions. [2019-11-26 20:56:46,587 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 289 transitions. Word has length 25 [2019-11-26 20:56:46,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:56:46,588 INFO L462 AbstractCegarLoop]: Abstraction has 263 states and 289 transitions. [2019-11-26 20:56:46,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-26 20:56:46,588 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 289 transitions. [2019-11-26 20:56:46,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-26 20:56:46,589 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:56:46,589 INFO L410 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] [2019-11-26 20:56:46,589 INFO L410 AbstractCegarLoop]: === Iteration 10 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-26 20:56:46,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:56:46,590 INFO L82 PathProgramCache]: Analyzing trace with hash 410353195, now seen corresponding path program 1 times [2019-11-26 20:56:46,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:56:46,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155835868] [2019-11-26 20:56:46,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:56:46,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:56:46,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:56:46,689 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:56:46,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155835868] [2019-11-26 20:56:46,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:56:46,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 20:56:46,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320682434] [2019-11-26 20:56:46,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-26 20:56:46,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:56:46,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-26 20:56:46,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-26 20:56:46,691 INFO L87 Difference]: Start difference. First operand 263 states and 289 transitions. Second operand 7 states. [2019-11-26 20:56:47,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:56:47,845 INFO L93 Difference]: Finished difference Result 342 states and 379 transitions. [2019-11-26 20:56:47,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 20:56:47,845 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-11-26 20:56:47,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:56:47,848 INFO L225 Difference]: With dead ends: 342 [2019-11-26 20:56:47,848 INFO L226 Difference]: Without dead ends: 342 [2019-11-26 20:56:47,849 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-26 20:56:47,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-11-26 20:56:47,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 288. [2019-11-26 20:56:47,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-11-26 20:56:47,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 321 transitions. [2019-11-26 20:56:47,864 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 321 transitions. Word has length 25 [2019-11-26 20:56:47,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:56:47,867 INFO L462 AbstractCegarLoop]: Abstraction has 288 states and 321 transitions. [2019-11-26 20:56:47,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-26 20:56:47,867 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 321 transitions. [2019-11-26 20:56:47,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-26 20:56:47,872 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:56:47,872 INFO L410 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] [2019-11-26 20:56:47,873 INFO L410 AbstractCegarLoop]: === Iteration 11 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-26 20:56:47,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:56:47,874 INFO L82 PathProgramCache]: Analyzing trace with hash -576712388, now seen corresponding path program 1 times [2019-11-26 20:56:47,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:56:47,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584739462] [2019-11-26 20:56:47,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:56:47,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:56:48,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:56:48,028 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-26 20:56:48,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584739462] [2019-11-26 20:56:48,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:56:48,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 20:56:48,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98317969] [2019-11-26 20:56:48,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 20:56:48,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:56:48,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 20:56:48,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-26 20:56:48,034 INFO L87 Difference]: Start difference. First operand 288 states and 321 transitions. Second operand 6 states. [2019-11-26 20:56:48,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:56:48,824 INFO L93 Difference]: Finished difference Result 307 states and 341 transitions. [2019-11-26 20:56:48,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 20:56:48,825 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-11-26 20:56:48,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:56:48,827 INFO L225 Difference]: With dead ends: 307 [2019-11-26 20:56:48,829 INFO L226 Difference]: Without dead ends: 307 [2019-11-26 20:56:48,829 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-26 20:56:48,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-11-26 20:56:48,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 287. [2019-11-26 20:56:48,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-11-26 20:56:48,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 318 transitions. [2019-11-26 20:56:48,841 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 318 transitions. Word has length 32 [2019-11-26 20:56:48,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:56:48,842 INFO L462 AbstractCegarLoop]: Abstraction has 287 states and 318 transitions. [2019-11-26 20:56:48,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 20:56:48,842 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 318 transitions. [2019-11-26 20:56:48,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-26 20:56:48,849 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:56:48,850 INFO L410 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] [2019-11-26 20:56:48,850 INFO L410 AbstractCegarLoop]: === Iteration 12 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-26 20:56:48,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:56:48,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1257129466, now seen corresponding path program 1 times [2019-11-26 20:56:48,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:56:48,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077684703] [2019-11-26 20:56:48,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:56:48,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:56:48,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:56:48,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-26 20:56:48,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077684703] [2019-11-26 20:56:48,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:56:48,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 20:56:48,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760500946] [2019-11-26 20:56:48,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 20:56:48,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:56:48,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 20:56:48,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-26 20:56:48,939 INFO L87 Difference]: Start difference. First operand 287 states and 318 transitions. Second operand 6 states. [2019-11-26 20:56:49,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:56:49,753 INFO L93 Difference]: Finished difference Result 306 states and 338 transitions. [2019-11-26 20:56:49,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 20:56:49,754 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-11-26 20:56:49,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:56:49,759 INFO L225 Difference]: With dead ends: 306 [2019-11-26 20:56:49,760 INFO L226 Difference]: Without dead ends: 306 [2019-11-26 20:56:49,760 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-26 20:56:49,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-11-26 20:56:49,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 286. [2019-11-26 20:56:49,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-11-26 20:56:49,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 315 transitions. [2019-11-26 20:56:49,771 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 315 transitions. Word has length 32 [2019-11-26 20:56:49,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:56:49,773 INFO L462 AbstractCegarLoop]: Abstraction has 286 states and 315 transitions. [2019-11-26 20:56:49,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 20:56:49,773 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 315 transitions. [2019-11-26 20:56:49,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-26 20:56:49,777 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:56:49,778 INFO L410 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] [2019-11-26 20:56:49,778 INFO L410 AbstractCegarLoop]: === Iteration 13 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-26 20:56:49,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:56:49,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1283785288, now seen corresponding path program 1 times [2019-11-26 20:56:49,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:56:49,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544193051] [2019-11-26 20:56:49,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:56:49,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:56:49,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:56:49,941 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:56:49,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544193051] [2019-11-26 20:56:49,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:56:49,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-26 20:56:49,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510558164] [2019-11-26 20:56:49,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-26 20:56:49,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:56:49,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-26 20:56:49,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-26 20:56:49,944 INFO L87 Difference]: Start difference. First operand 286 states and 315 transitions. Second operand 9 states. [2019-11-26 20:56:51,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:56:51,198 INFO L93 Difference]: Finished difference Result 341 states and 373 transitions. [2019-11-26 20:56:51,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-26 20:56:51,199 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-11-26 20:56:51,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:56:51,202 INFO L225 Difference]: With dead ends: 341 [2019-11-26 20:56:51,202 INFO L226 Difference]: Without dead ends: 341 [2019-11-26 20:56:51,203 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-11-26 20:56:51,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2019-11-26 20:56:51,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 286. [2019-11-26 20:56:51,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-11-26 20:56:51,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 314 transitions. [2019-11-26 20:56:51,214 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 314 transitions. Word has length 35 [2019-11-26 20:56:51,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:56:51,215 INFO L462 AbstractCegarLoop]: Abstraction has 286 states and 314 transitions. [2019-11-26 20:56:51,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-26 20:56:51,215 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 314 transitions. [2019-11-26 20:56:51,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-26 20:56:51,216 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:56:51,216 INFO L410 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] [2019-11-26 20:56:51,216 INFO L410 AbstractCegarLoop]: === Iteration 14 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-26 20:56:51,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:56:51,217 INFO L82 PathProgramCache]: Analyzing trace with hash 584864395, now seen corresponding path program 1 times [2019-11-26 20:56:51,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:56:51,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272865344] [2019-11-26 20:56:51,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:56:51,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:56:51,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:56:51,314 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:56:51,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272865344] [2019-11-26 20:56:51,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:56:51,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-26 20:56:51,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977200691] [2019-11-26 20:56:51,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-26 20:56:51,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:56:51,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-26 20:56:51,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-26 20:56:51,317 INFO L87 Difference]: Start difference. First operand 286 states and 314 transitions. Second operand 9 states. [2019-11-26 20:56:52,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:56:52,549 INFO L93 Difference]: Finished difference Result 340 states and 371 transitions. [2019-11-26 20:56:52,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-26 20:56:52,549 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-11-26 20:56:52,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:56:52,552 INFO L225 Difference]: With dead ends: 340 [2019-11-26 20:56:52,552 INFO L226 Difference]: Without dead ends: 340 [2019-11-26 20:56:52,553 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-11-26 20:56:52,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2019-11-26 20:56:52,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 286. [2019-11-26 20:56:52,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-11-26 20:56:52,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 313 transitions. [2019-11-26 20:56:52,561 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 313 transitions. Word has length 35 [2019-11-26 20:56:52,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:56:52,562 INFO L462 AbstractCegarLoop]: Abstraction has 286 states and 313 transitions. [2019-11-26 20:56:52,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-26 20:56:52,562 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 313 transitions. [2019-11-26 20:56:52,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-26 20:56:52,563 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:56:52,563 INFO L410 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] [2019-11-26 20:56:52,563 INFO L410 AbstractCegarLoop]: === Iteration 15 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-26 20:56:52,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:56:52,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1142948309, now seen corresponding path program 1 times [2019-11-26 20:56:52,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:56:52,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861655296] [2019-11-26 20:56:52,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:56:52,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:56:52,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:56:52,703 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:56:52,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861655296] [2019-11-26 20:56:52,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:56:52,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-26 20:56:52,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595188367] [2019-11-26 20:56:52,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-26 20:56:52,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:56:52,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-26 20:56:52,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-26 20:56:52,705 INFO L87 Difference]: Start difference. First operand 286 states and 313 transitions. Second operand 11 states. [2019-11-26 20:56:54,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:56:54,277 INFO L93 Difference]: Finished difference Result 354 states and 389 transitions. [2019-11-26 20:56:54,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-26 20:56:54,283 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2019-11-26 20:56:54,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:56:54,285 INFO L225 Difference]: With dead ends: 354 [2019-11-26 20:56:54,285 INFO L226 Difference]: Without dead ends: 354 [2019-11-26 20:56:54,289 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2019-11-26 20:56:54,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-11-26 20:56:54,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 287. [2019-11-26 20:56:54,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-11-26 20:56:54,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 315 transitions. [2019-11-26 20:56:54,299 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 315 transitions. Word has length 36 [2019-11-26 20:56:54,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:56:54,300 INFO L462 AbstractCegarLoop]: Abstraction has 287 states and 315 transitions. [2019-11-26 20:56:54,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-26 20:56:54,301 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 315 transitions. [2019-11-26 20:56:54,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-26 20:56:54,301 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:56:54,301 INFO L410 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] [2019-11-26 20:56:54,302 INFO L410 AbstractCegarLoop]: === Iteration 16 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-26 20:56:54,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:56:54,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1142948308, now seen corresponding path program 1 times [2019-11-26 20:56:54,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:56:54,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619496898] [2019-11-26 20:56:54,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:56:54,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:56:54,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:56:54,510 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:56:54,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619496898] [2019-11-26 20:56:54,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:56:54,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-26 20:56:54,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851766249] [2019-11-26 20:56:54,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-26 20:56:54,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:56:54,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-26 20:56:54,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-11-26 20:56:54,513 INFO L87 Difference]: Start difference. First operand 287 states and 315 transitions. Second operand 11 states. [2019-11-26 20:56:56,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:56:56,256 INFO L93 Difference]: Finished difference Result 338 states and 369 transitions. [2019-11-26 20:56:56,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-26 20:56:56,257 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2019-11-26 20:56:56,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:56:56,259 INFO L225 Difference]: With dead ends: 338 [2019-11-26 20:56:56,259 INFO L226 Difference]: Without dead ends: 338 [2019-11-26 20:56:56,260 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-11-26 20:56:56,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-11-26 20:56:56,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 287. [2019-11-26 20:56:56,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-11-26 20:56:56,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 314 transitions. [2019-11-26 20:56:56,268 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 314 transitions. Word has length 36 [2019-11-26 20:56:56,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:56:56,268 INFO L462 AbstractCegarLoop]: Abstraction has 287 states and 314 transitions. [2019-11-26 20:56:56,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-26 20:56:56,268 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 314 transitions. [2019-11-26 20:56:56,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-26 20:56:56,269 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:56:56,269 INFO L410 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] [2019-11-26 20:56:56,270 INFO L410 AbstractCegarLoop]: === Iteration 17 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-26 20:56:56,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:56:56,270 INFO L82 PathProgramCache]: Analyzing trace with hash 950542285, now seen corresponding path program 1 times [2019-11-26 20:56:56,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:56:56,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634717471] [2019-11-26 20:56:56,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:56:56,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:56:56,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:56:56,435 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:56:56,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634717471] [2019-11-26 20:56:56,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:56:56,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-26 20:56:56,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588881201] [2019-11-26 20:56:56,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-26 20:56:56,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:56:56,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-26 20:56:56,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-26 20:56:56,438 INFO L87 Difference]: Start difference. First operand 287 states and 314 transitions. Second operand 11 states. [2019-11-26 20:56:58,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:56:58,141 INFO L93 Difference]: Finished difference Result 352 states and 387 transitions. [2019-11-26 20:56:58,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-26 20:56:58,141 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2019-11-26 20:56:58,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:56:58,144 INFO L225 Difference]: With dead ends: 352 [2019-11-26 20:56:58,145 INFO L226 Difference]: Without dead ends: 352 [2019-11-26 20:56:58,145 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2019-11-26 20:56:58,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-11-26 20:56:58,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 287. [2019-11-26 20:56:58,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-11-26 20:56:58,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 313 transitions. [2019-11-26 20:56:58,154 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 313 transitions. Word has length 36 [2019-11-26 20:56:58,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:56:58,154 INFO L462 AbstractCegarLoop]: Abstraction has 287 states and 313 transitions. [2019-11-26 20:56:58,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-26 20:56:58,154 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 313 transitions. [2019-11-26 20:56:58,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-26 20:56:58,155 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:56:58,155 INFO L410 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] [2019-11-26 20:56:58,156 INFO L410 AbstractCegarLoop]: === Iteration 18 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-26 20:56:58,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:56:58,156 INFO L82 PathProgramCache]: Analyzing trace with hash 950542286, now seen corresponding path program 1 times [2019-11-26 20:56:58,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:56:58,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094844292] [2019-11-26 20:56:58,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:56:58,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:56:58,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:56:58,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:56:58,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094844292] [2019-11-26 20:56:58,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:56:58,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-26 20:56:58,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239043146] [2019-11-26 20:56:58,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-26 20:56:58,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:56:58,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-26 20:56:58,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-11-26 20:56:58,290 INFO L87 Difference]: Start difference. First operand 287 states and 313 transitions. Second operand 10 states. [2019-11-26 20:56:59,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:56:59,897 INFO L93 Difference]: Finished difference Result 336 states and 367 transitions. [2019-11-26 20:56:59,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-26 20:56:59,898 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2019-11-26 20:56:59,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:56:59,900 INFO L225 Difference]: With dead ends: 336 [2019-11-26 20:56:59,900 INFO L226 Difference]: Without dead ends: 336 [2019-11-26 20:56:59,900 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-11-26 20:56:59,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-11-26 20:56:59,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 287. [2019-11-26 20:56:59,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-11-26 20:56:59,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 312 transitions. [2019-11-26 20:56:59,910 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 312 transitions. Word has length 36 [2019-11-26 20:56:59,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:56:59,911 INFO L462 AbstractCegarLoop]: Abstraction has 287 states and 312 transitions. [2019-11-26 20:56:59,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-26 20:56:59,911 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 312 transitions. [2019-11-26 20:56:59,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-26 20:56:59,912 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:56:59,912 INFO L410 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] [2019-11-26 20:56:59,912 INFO L410 AbstractCegarLoop]: === Iteration 19 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-26 20:56:59,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:56:59,913 INFO L82 PathProgramCache]: Analyzing trace with hash 927806725, now seen corresponding path program 1 times [2019-11-26 20:56:59,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:56:59,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156205562] [2019-11-26 20:56:59,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:56:59,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-26 20:56:59,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-26 20:56:59,994 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-26 20:56:59,995 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-26 20:57:00,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 08:57:00 BoogieIcfgContainer [2019-11-26 20:57:00,049 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 20:57:00,050 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 20:57:00,050 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 20:57:00,051 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 20:57:00,051 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 08:56:38" (3/4) ... [2019-11-26 20:57:00,054 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-26 20:57:00,143 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-26 20:57:00,144 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 20:57:00,146 INFO L168 Benchmark]: Toolchain (without parser) took 23354.37 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 465.6 MB). Free memory was 946.9 MB in the beginning and 1.4 GB in the end (delta: -444.0 MB). Peak memory consumption was 21.6 MB. Max. memory is 11.5 GB. [2019-11-26 20:57:00,147 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 20:57:00,154 INFO L168 Benchmark]: CACSL2BoogieTranslator took 672.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -177.6 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2019-11-26 20:57:00,154 INFO L168 Benchmark]: Boogie Preprocessor took 100.90 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 20:57:00,154 INFO L168 Benchmark]: RCFGBuilder took 1244.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 97.0 MB). Peak memory consumption was 97.0 MB. Max. memory is 11.5 GB. [2019-11-26 20:57:00,155 INFO L168 Benchmark]: TraceAbstraction took 21227.85 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 310.9 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -363.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 20:57:00,155 INFO L168 Benchmark]: Witness Printer took 93.65 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-11-26 20:57:00,157 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 672.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -177.6 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 100.90 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1244.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 97.0 MB). Peak memory consumption was 97.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 21227.85 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 310.9 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -363.4 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 93.65 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 554]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L627] struct list *data = ((void *)0); VAL [data={0:0}] [L628] COND TRUE __VERIFIER_nondet_int() [L629] struct node *node = malloc(sizeof *node); VAL [data={0:0}, malloc(sizeof *node)={-1:0}, node={-1:0}] [L630] COND FALSE !(!node) VAL [data={0:0}, malloc(sizeof *node)={-1:0}, node={-1:0}] [L632] node->next = node VAL [data={0:0}, malloc(sizeof *node)={-1:0}, node={-1:0}] [L633] node->value = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, data={0:0}, malloc(sizeof *node)={-1:0}, node={-1:0}] [L634] struct list *item = malloc(sizeof *item); VAL [data={0:0}, item={-2:0}, malloc(sizeof *item)={-2:0}, malloc(sizeof *node)={-1:0}, node={-1:0}] [L635] COND FALSE !(!item) VAL [data={0:0}, item={-2:0}, malloc(sizeof *item)={-2:0}, malloc(sizeof *node)={-1:0}, node={-1:0}] [L637] item->slist = node VAL [data={0:0}, item={-2:0}, malloc(sizeof *item)={-2:0}, malloc(sizeof *node)={-1:0}, node={-1:0}] [L638] item->next = data VAL [data={0:0}, item={-2:0}, malloc(sizeof *item)={-2:0}, malloc(sizeof *node)={-1:0}, node={-1:0}] [L639] data = item VAL [data={-2:0}, item={-2:0}, malloc(sizeof *item)={-2:0}, malloc(sizeof *node)={-1:0}, node={-1:0}] [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) VAL [data={-2:0}, item={-2:0}, malloc(sizeof *item)={-2:0}, malloc(sizeof *node)={-1:0}, node={-1:0}] [L643] CALL inspect_before(data) VAL [shape={-2:0}] [L604] COND FALSE !(!(shape)) VAL [shape={-2:0}, shape={-2:0}] [L605] shape->next VAL [shape={-2:0}, shape={-2:0}, shape->next={0:0}] [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) VAL [shape={-2:0}, shape={-2:0}] [L612] EXPR shape->next VAL [shape={-2:0}, shape={-2:0}, shape->next={0:0}] [L612] COND FALSE !(!(shape->next == ((void *)0))) [L613] EXPR shape->slist VAL [shape={-2:0}, shape={-2:0}, shape->slist={-1:0}] [L613] COND FALSE !(!(shape->slist)) [L614] EXPR shape->slist VAL [shape={-2:0}, shape={-2:0}, shape->slist={-1:0}] [L614] EXPR shape->slist->next VAL [shape={-2:0}, shape={-2:0}, shape->slist={-1:0}, shape->slist->next={-1:0}] [L614] COND TRUE !(shape->slist->next == ((void *)0)) [L614] CALL fail() [L554] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 285 locations, 105 error locations. Result: UNSAFE, OverallTime: 21.0s, OverallIterations: 19, TraceHistogramMax: 2, AutomataDifference: 18.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3905 SDtfs, 5117 SDslu, 5539 SDs, 0 SdLazy, 15421 SolverSat, 650 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 203 GetRequests, 56 SyntacticMatches, 8 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=288occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 914 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 486 NumberOfCodeBlocks, 486 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 429 ConstructedInterpolants, 0 QuantifiedInterpolants, 86358 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 24/24 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...