./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/heap-manipulation/merge_sort-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 5a079682 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-32bit-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 32bit --witnessprinter.graph.data.programhash 534681b11e8e68e6058985d885b01f2cbfa43e5b ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-5a07968 [2019-11-22 11:21:38,334 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-22 11:21:38,336 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-22 11:21:38,348 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-22 11:21:38,348 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-22 11:21:38,350 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-22 11:21:38,351 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-22 11:21:38,353 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-22 11:21:38,355 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-22 11:21:38,356 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-22 11:21:38,357 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-22 11:21:38,358 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-22 11:21:38,358 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-22 11:21:38,359 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-22 11:21:38,360 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-22 11:21:38,361 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-22 11:21:38,364 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-22 11:21:38,367 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-22 11:21:38,371 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-22 11:21:38,374 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-22 11:21:38,377 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-22 11:21:38,380 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-22 11:21:38,384 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-22 11:21:38,385 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-22 11:21:38,390 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-22 11:21:38,392 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-22 11:21:38,392 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-22 11:21:38,393 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-22 11:21:38,395 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-22 11:21:38,397 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-22 11:21:38,397 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-22 11:21:38,398 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-22 11:21:38,399 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-22 11:21:38,399 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-22 11:21:38,401 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-22 11:21:38,402 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-22 11:21:38,403 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-22 11:21:38,403 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-22 11:21:38,404 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-22 11:21:38,406 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-22 11:21:38,408 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-22 11:21:38,408 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2019-11-22 11:21:38,432 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-22 11:21:38,432 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-22 11:21:38,434 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-22 11:21:38,434 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-22 11:21:38,434 INFO L138 SettingsManager]: * Use SBE=true [2019-11-22 11:21:38,435 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-22 11:21:38,435 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-22 11:21:38,435 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-22 11:21:38,436 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-22 11:21:38,436 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-22 11:21:38,437 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-22 11:21:38,437 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-22 11:21:38,438 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-22 11:21:38,438 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-22 11:21:38,438 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-22 11:21:38,439 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-22 11:21:38,439 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-22 11:21:38,439 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-22 11:21:38,439 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-22 11:21:38,440 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-22 11:21:38,440 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-22 11:21:38,440 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 11:21:38,441 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-22 11:21:38,441 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-22 11:21:38,441 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-22 11:21:38,441 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-22 11:21:38,442 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 534681b11e8e68e6058985d885b01f2cbfa43e5b [2019-11-22 11:21:38,749 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-22 11:21:38,763 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-22 11:21:38,767 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-22 11:21:38,768 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-22 11:21:38,769 INFO L275 PluginConnector]: CDTParser initialized [2019-11-22 11:21:38,770 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-22 11:21:38,845 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/835ed30b3/273a2c231c3843e7bbc5a54aacbc5750/FLAG61dcbf385 [2019-11-22 11:21:39,386 INFO L306 CDTParser]: Found 1 translation units. [2019-11-22 11:21:39,387 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/merge_sort-1.i [2019-11-22 11:21:39,400 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/835ed30b3/273a2c231c3843e7bbc5a54aacbc5750/FLAG61dcbf385 [2019-11-22 11:21:39,706 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/835ed30b3/273a2c231c3843e7bbc5a54aacbc5750 [2019-11-22 11:21:39,709 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-22 11:21:39,710 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-22 11:21:39,711 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-22 11:21:39,711 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-22 11:21:39,715 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-22 11:21:39,716 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:21:39" (1/1) ... [2019-11-22 11:21:39,719 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13d9cfd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:21:39, skipping insertion in model container [2019-11-22 11:21:39,719 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:21:39" (1/1) ... [2019-11-22 11:21:39,727 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-22 11:21:39,775 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-22 11:21:40,232 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 11:21:40,243 INFO L203 MainTranslator]: Completed pre-run [2019-11-22 11:21:40,299 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 11:21:40,360 INFO L208 MainTranslator]: Completed translation [2019-11-22 11:21:40,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:21:40 WrapperNode [2019-11-22 11:21:40,361 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-22 11:21:40,362 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-22 11:21:40,363 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-22 11:21:40,363 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-22 11:21:40,374 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:21:40" (1/1) ... [2019-11-22 11:21:40,375 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:21:40" (1/1) ... [2019-11-22 11:21:40,399 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:21:40" (1/1) ... [2019-11-22 11:21:40,399 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:21:40" (1/1) ... [2019-11-22 11:21:40,449 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:21:40" (1/1) ... [2019-11-22 11:21:40,465 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:21:40" (1/1) ... [2019-11-22 11:21:40,475 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:21:40" (1/1) ... [2019-11-22 11:21:40,483 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-22 11:21:40,483 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-22 11:21:40,484 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-22 11:21:40,484 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-22 11:21:40,485 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:21:40" (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-22 11:21:40,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-22 11:21:40,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-22 11:21:40,547 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-22 11:21:40,548 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-22 11:21:40,548 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2019-11-22 11:21:40,548 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2019-11-22 11:21:40,549 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_pair [2019-11-22 11:21:40,549 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_sort_core [2019-11-22 11:21:40,550 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_before [2019-11-22 11:21:40,550 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_after [2019-11-22 11:21:40,550 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-22 11:21:40,551 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-22 11:21:40,551 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-22 11:21:40,552 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-22 11:21:40,552 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-22 11:21:40,552 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-22 11:21:40,552 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-22 11:21:40,552 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-22 11:21:40,555 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-22 11:21:40,555 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-22 11:21:40,555 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-22 11:21:40,555 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-22 11:21:40,555 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-22 11:21:40,556 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-22 11:21:40,556 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-22 11:21:40,556 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-22 11:21:40,557 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-22 11:21:40,558 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-22 11:21:40,558 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-22 11:21:40,559 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-22 11:21:40,559 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-22 11:21:40,559 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-22 11:21:40,559 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-22 11:21:40,559 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-22 11:21:40,559 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-22 11:21:40,559 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-22 11:21:40,560 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-22 11:21:40,560 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-22 11:21:40,560 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-22 11:21:40,560 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-22 11:21:40,560 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-22 11:21:40,560 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-22 11:21:40,560 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-22 11:21:40,561 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-22 11:21:40,561 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-22 11:21:40,561 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-22 11:21:40,562 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-22 11:21:40,562 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-22 11:21:40,563 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-22 11:21:40,563 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-22 11:21:40,563 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-22 11:21:40,563 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-22 11:21:40,563 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-22 11:21:40,563 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-22 11:21:40,563 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-22 11:21:40,564 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-22 11:21:40,564 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-22 11:21:40,564 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-22 11:21:40,564 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-22 11:21:40,564 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-22 11:21:40,565 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-22 11:21:40,565 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-22 11:21:40,565 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-22 11:21:40,565 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-22 11:21:40,565 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-22 11:21:40,565 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-22 11:21:40,566 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-22 11:21:40,566 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-22 11:21:40,566 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-22 11:21:40,566 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-22 11:21:40,567 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-22 11:21:40,567 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-22 11:21:40,567 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-22 11:21:40,567 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-22 11:21:40,568 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-22 11:21:40,569 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-22 11:21:40,569 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-22 11:21:40,570 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-22 11:21:40,570 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-22 11:21:40,570 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-22 11:21:40,570 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-22 11:21:40,571 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-22 11:21:40,571 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-22 11:21:40,571 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-22 11:21:40,571 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-22 11:21:40,571 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-22 11:21:40,571 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-22 11:21:40,571 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-22 11:21:40,572 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-22 11:21:40,572 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-22 11:21:40,572 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-22 11:21:40,572 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-22 11:21:40,572 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-22 11:21:40,572 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-22 11:21:40,572 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-22 11:21:40,573 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-22 11:21:40,573 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-22 11:21:40,573 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-22 11:21:40,573 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-22 11:21:40,573 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-22 11:21:40,573 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-22 11:21:40,573 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-22 11:21:40,573 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-22 11:21:40,574 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-22 11:21:40,574 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-22 11:21:40,574 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-22 11:21:40,574 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-22 11:21:40,574 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-22 11:21:40,574 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-22 11:21:40,574 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-22 11:21:40,575 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-22 11:21:40,575 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-22 11:21:40,575 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-22 11:21:40,575 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-22 11:21:40,575 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-22 11:21:40,575 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2019-11-22 11:21:40,576 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2019-11-22 11:21:40,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-22 11:21:40,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-22 11:21:40,576 INFO L130 BoogieDeclarations]: Found specification of procedure merge_pair [2019-11-22 11:21:40,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-22 11:21:40,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-22 11:21:40,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-22 11:21:40,577 INFO L130 BoogieDeclarations]: Found specification of procedure seq_sort_core [2019-11-22 11:21:40,577 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_before [2019-11-22 11:21:40,578 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_after [2019-11-22 11:21:40,578 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-22 11:21:40,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-22 11:21:40,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-22 11:21:40,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-22 11:21:40,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-22 11:21:41,632 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-22 11:21:41,633 INFO L284 CfgBuilder]: Removed 33 assume(true) statements. [2019-11-22 11:21:41,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:21:41 BoogieIcfgContainer [2019-11-22 11:21:41,638 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-22 11:21:41,640 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-22 11:21:41,642 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-22 11:21:41,646 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-22 11:21:41,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 11:21:39" (1/3) ... [2019-11-22 11:21:41,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a0fc2a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:21:41, skipping insertion in model container [2019-11-22 11:21:41,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:21:40" (2/3) ... [2019-11-22 11:21:41,650 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a0fc2a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:21:41, skipping insertion in model container [2019-11-22 11:21:41,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:21:41" (3/3) ... [2019-11-22 11:21:41,655 INFO L109 eAbstractionObserver]: Analyzing ICFG merge_sort-1.i [2019-11-22 11:21:41,666 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-22 11:21:41,679 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 104 error locations. [2019-11-22 11:21:41,698 INFO L249 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2019-11-22 11:21:41,715 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-22 11:21:41,715 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-22 11:21:41,715 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-22 11:21:41,715 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-22 11:21:41,716 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-22 11:21:41,716 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-22 11:21:41,716 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-22 11:21:41,716 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-22 11:21:41,744 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states. [2019-11-22 11:21:41,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-22 11:21:41,756 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:21:41,757 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:21:41,758 INFO L410 AbstractCegarLoop]: === Iteration 1 === [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-22 11:21:41,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:21:41,765 INFO L82 PathProgramCache]: Analyzing trace with hash 995848786, now seen corresponding path program 1 times [2019-11-22 11:21:41,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:21:41,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390383654] [2019-11-22 11:21:41,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:21:41,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:41,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:41,967 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-22 11:21:41,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390383654] [2019-11-22 11:21:41,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:21:41,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-22 11:21:41,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012820526] [2019-11-22 11:21:41,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-22 11:21:41,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:21:41,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-22 11:21:41,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 11:21:42,000 INFO L87 Difference]: Start difference. First operand 278 states. Second operand 3 states. [2019-11-22 11:21:42,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:21:42,531 INFO L93 Difference]: Finished difference Result 318 states and 353 transitions. [2019-11-22 11:21:42,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-22 11:21:42,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-22 11:21:42,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:21:42,562 INFO L225 Difference]: With dead ends: 318 [2019-11-22 11:21:42,562 INFO L226 Difference]: Without dead ends: 300 [2019-11-22 11:21:42,566 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-22 11:21:42,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-11-22 11:21:42,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 262. [2019-11-22 11:21:42,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-11-22 11:21:42,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 276 transitions. [2019-11-22 11:21:42,685 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 276 transitions. Word has length 9 [2019-11-22 11:21:42,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:21:42,686 INFO L462 AbstractCegarLoop]: Abstraction has 262 states and 276 transitions. [2019-11-22 11:21:42,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-22 11:21:42,686 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 276 transitions. [2019-11-22 11:21:42,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-22 11:21:42,687 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:21:42,687 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:21:42,687 INFO L410 AbstractCegarLoop]: === Iteration 2 === [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-22 11:21:42,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:21:42,689 INFO L82 PathProgramCache]: Analyzing trace with hash 805494535, now seen corresponding path program 1 times [2019-11-22 11:21:42,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:21:42,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537358805] [2019-11-22 11:21:42,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:21:42,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:42,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:42,827 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-22 11:21:42,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537358805] [2019-11-22 11:21:42,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:21:42,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-22 11:21:42,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794101675] [2019-11-22 11:21:42,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 11:21:42,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:21:42,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 11:21:42,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-22 11:21:42,830 INFO L87 Difference]: Start difference. First operand 262 states and 276 transitions. Second operand 4 states. [2019-11-22 11:21:43,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:21:43,594 INFO L93 Difference]: Finished difference Result 317 states and 342 transitions. [2019-11-22 11:21:43,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-22 11:21:43,595 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-22 11:21:43,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:21:43,599 INFO L225 Difference]: With dead ends: 317 [2019-11-22 11:21:43,599 INFO L226 Difference]: Without dead ends: 317 [2019-11-22 11:21:43,600 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-22 11:21:43,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2019-11-22 11:21:43,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 260. [2019-11-22 11:21:43,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-11-22 11:21:43,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 274 transitions. [2019-11-22 11:21:43,617 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 274 transitions. Word has length 10 [2019-11-22 11:21:43,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:21:43,618 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 274 transitions. [2019-11-22 11:21:43,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 11:21:43,618 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 274 transitions. [2019-11-22 11:21:43,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-22 11:21:43,619 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:21:43,619 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:21:43,620 INFO L410 AbstractCegarLoop]: === Iteration 3 === [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-22 11:21:43,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:21:43,620 INFO L82 PathProgramCache]: Analyzing trace with hash 805494536, now seen corresponding path program 1 times [2019-11-22 11:21:43,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:21:43,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962057856] [2019-11-22 11:21:43,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:21:43,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:43,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:43,719 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-22 11:21:43,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962057856] [2019-11-22 11:21:43,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:21:43,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-22 11:21:43,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168614203] [2019-11-22 11:21:43,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 11:21:43,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:21:43,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 11:21:43,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-22 11:21:43,724 INFO L87 Difference]: Start difference. First operand 260 states and 274 transitions. Second operand 4 states. [2019-11-22 11:21:44,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:21:44,371 INFO L93 Difference]: Finished difference Result 326 states and 352 transitions. [2019-11-22 11:21:44,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-22 11:21:44,371 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-22 11:21:44,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:21:44,375 INFO L225 Difference]: With dead ends: 326 [2019-11-22 11:21:44,375 INFO L226 Difference]: Without dead ends: 326 [2019-11-22 11:21:44,375 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-22 11:21:44,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-11-22 11:21:44,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 258. [2019-11-22 11:21:44,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-11-22 11:21:44,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 272 transitions. [2019-11-22 11:21:44,388 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 272 transitions. Word has length 10 [2019-11-22 11:21:44,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:21:44,388 INFO L462 AbstractCegarLoop]: Abstraction has 258 states and 272 transitions. [2019-11-22 11:21:44,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 11:21:44,388 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 272 transitions. [2019-11-22 11:21:44,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-22 11:21:44,389 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:21:44,389 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:21:44,389 INFO L410 AbstractCegarLoop]: === Iteration 4 === [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-22 11:21:44,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:21:44,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1991342111, now seen corresponding path program 1 times [2019-11-22 11:21:44,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:21:44,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835531703] [2019-11-22 11:21:44,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:21:44,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:44,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:44,442 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-22 11:21:44,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835531703] [2019-11-22 11:21:44,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:21:44,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-22 11:21:44,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678541887] [2019-11-22 11:21:44,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 11:21:44,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:21:44,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 11:21:44,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-22 11:21:44,444 INFO L87 Difference]: Start difference. First operand 258 states and 272 transitions. Second operand 4 states. [2019-11-22 11:21:44,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:21:44,958 INFO L93 Difference]: Finished difference Result 293 states and 308 transitions. [2019-11-22 11:21:44,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 11:21:44,959 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-22 11:21:44,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:21:44,961 INFO L225 Difference]: With dead ends: 293 [2019-11-22 11:21:44,961 INFO L226 Difference]: Without dead ends: 292 [2019-11-22 11:21:44,962 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-22 11:21:44,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-11-22 11:21:44,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 257. [2019-11-22 11:21:44,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-22 11:21:44,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 270 transitions. [2019-11-22 11:21:44,972 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 270 transitions. Word has length 14 [2019-11-22 11:21:44,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:21:44,972 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 270 transitions. [2019-11-22 11:21:44,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 11:21:44,973 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 270 transitions. [2019-11-22 11:21:44,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-22 11:21:44,973 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:21:44,973 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:21:44,974 INFO L410 AbstractCegarLoop]: === Iteration 5 === [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-22 11:21:44,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:21:44,975 INFO L82 PathProgramCache]: Analyzing trace with hash 742236455, now seen corresponding path program 1 times [2019-11-22 11:21:44,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:21:44,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215470721] [2019-11-22 11:21:44,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:21:44,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:45,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:45,025 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-22 11:21:45,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215470721] [2019-11-22 11:21:45,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:21:45,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-22 11:21:45,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644429917] [2019-11-22 11:21:45,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 11:21:45,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:21:45,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 11:21:45,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-22 11:21:45,027 INFO L87 Difference]: Start difference. First operand 257 states and 270 transitions. Second operand 4 states. [2019-11-22 11:21:45,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:21:45,553 INFO L93 Difference]: Finished difference Result 299 states and 318 transitions. [2019-11-22 11:21:45,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-22 11:21:45,554 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-22 11:21:45,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:21:45,556 INFO L225 Difference]: With dead ends: 299 [2019-11-22 11:21:45,556 INFO L226 Difference]: Without dead ends: 299 [2019-11-22 11:21:45,557 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-22 11:21:45,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-11-22 11:21:45,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 255. [2019-11-22 11:21:45,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-11-22 11:21:45,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 268 transitions. [2019-11-22 11:21:45,565 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 268 transitions. Word has length 15 [2019-11-22 11:21:45,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:21:45,566 INFO L462 AbstractCegarLoop]: Abstraction has 255 states and 268 transitions. [2019-11-22 11:21:45,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 11:21:45,566 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 268 transitions. [2019-11-22 11:21:45,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-22 11:21:45,566 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:21:45,567 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:21:45,567 INFO L410 AbstractCegarLoop]: === Iteration 6 === [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-22 11:21:45,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:21:45,568 INFO L82 PathProgramCache]: Analyzing trace with hash 742236456, now seen corresponding path program 1 times [2019-11-22 11:21:45,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:21:45,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223075228] [2019-11-22 11:21:45,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:21:45,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:45,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:45,626 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-22 11:21:45,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223075228] [2019-11-22 11:21:45,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:21:45,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-22 11:21:45,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15669849] [2019-11-22 11:21:45,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 11:21:45,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:21:45,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 11:21:45,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-22 11:21:45,628 INFO L87 Difference]: Start difference. First operand 255 states and 268 transitions. Second operand 4 states. [2019-11-22 11:21:46,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:21:46,162 INFO L93 Difference]: Finished difference Result 308 states and 328 transitions. [2019-11-22 11:21:46,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-22 11:21:46,163 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-22 11:21:46,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:21:46,165 INFO L225 Difference]: With dead ends: 308 [2019-11-22 11:21:46,165 INFO L226 Difference]: Without dead ends: 308 [2019-11-22 11:21:46,165 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-22 11:21:46,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-11-22 11:21:46,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 253. [2019-11-22 11:21:46,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-11-22 11:21:46,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 266 transitions. [2019-11-22 11:21:46,174 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 266 transitions. Word has length 15 [2019-11-22 11:21:46,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:21:46,174 INFO L462 AbstractCegarLoop]: Abstraction has 253 states and 266 transitions. [2019-11-22 11:21:46,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 11:21:46,175 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 266 transitions. [2019-11-22 11:21:46,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-22 11:21:46,175 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:21:46,176 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-22 11:21:46,176 INFO L410 AbstractCegarLoop]: === Iteration 7 === [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-22 11:21:46,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:21:46,176 INFO L82 PathProgramCache]: Analyzing trace with hash -224686077, now seen corresponding path program 1 times [2019-11-22 11:21:46,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:21:46,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673724069] [2019-11-22 11:21:46,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:21:46,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:46,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:46,229 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-22 11:21:46,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673724069] [2019-11-22 11:21:46,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:21:46,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-22 11:21:46,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177182761] [2019-11-22 11:21:46,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-22 11:21:46,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:21:46,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-22 11:21:46,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-22 11:21:46,232 INFO L87 Difference]: Start difference. First operand 253 states and 266 transitions. Second operand 5 states. [2019-11-22 11:21:46,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:21:46,865 INFO L93 Difference]: Finished difference Result 312 states and 332 transitions. [2019-11-22 11:21:46,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 11:21:46,865 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-11-22 11:21:46,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:21:46,867 INFO L225 Difference]: With dead ends: 312 [2019-11-22 11:21:46,868 INFO L226 Difference]: Without dead ends: 312 [2019-11-22 11:21:46,868 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-22 11:21:46,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-11-22 11:21:46,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 253. [2019-11-22 11:21:46,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-11-22 11:21:46,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 265 transitions. [2019-11-22 11:21:46,880 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 265 transitions. Word has length 21 [2019-11-22 11:21:46,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:21:46,880 INFO L462 AbstractCegarLoop]: Abstraction has 253 states and 265 transitions. [2019-11-22 11:21:46,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-22 11:21:46,881 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 265 transitions. [2019-11-22 11:21:46,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-22 11:21:46,882 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:21:46,883 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-22 11:21:46,887 INFO L410 AbstractCegarLoop]: === Iteration 8 === [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-22 11:21:46,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:21:46,888 INFO L82 PathProgramCache]: Analyzing trace with hash 552515561, now seen corresponding path program 1 times [2019-11-22 11:21:46,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:21:46,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283521120] [2019-11-22 11:21:46,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:21:46,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:47,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:47,006 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-22 11:21:47,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283521120] [2019-11-22 11:21:47,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:21:47,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-22 11:21:47,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333334855] [2019-11-22 11:21:47,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-22 11:21:47,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:21:47,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-22 11:21:47,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-22 11:21:47,008 INFO L87 Difference]: Start difference. First operand 253 states and 265 transitions. Second operand 7 states. [2019-11-22 11:21:47,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:21:47,887 INFO L93 Difference]: Finished difference Result 293 states and 312 transitions. [2019-11-22 11:21:47,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-22 11:21:47,888 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-11-22 11:21:47,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:21:47,890 INFO L225 Difference]: With dead ends: 293 [2019-11-22 11:21:47,890 INFO L226 Difference]: Without dead ends: 293 [2019-11-22 11:21:47,891 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-22 11:21:47,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-11-22 11:21:47,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 246. [2019-11-22 11:21:47,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-11-22 11:21:47,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 260 transitions. [2019-11-22 11:21:47,902 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 260 transitions. Word has length 25 [2019-11-22 11:21:47,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:21:47,903 INFO L462 AbstractCegarLoop]: Abstraction has 246 states and 260 transitions. [2019-11-22 11:21:47,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-22 11:21:47,903 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 260 transitions. [2019-11-22 11:21:47,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-22 11:21:47,904 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:21:47,904 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-22 11:21:47,904 INFO L410 AbstractCegarLoop]: === Iteration 9 === [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-22 11:21:47,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:21:47,905 INFO L82 PathProgramCache]: Analyzing trace with hash 552515562, now seen corresponding path program 1 times [2019-11-22 11:21:47,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:21:47,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893604122] [2019-11-22 11:21:47,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:21:47,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:48,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:48,055 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-22 11:21:48,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893604122] [2019-11-22 11:21:48,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:21:48,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-22 11:21:48,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050109452] [2019-11-22 11:21:48,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-22 11:21:48,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:21:48,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-22 11:21:48,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-22 11:21:48,061 INFO L87 Difference]: Start difference. First operand 246 states and 260 transitions. Second operand 7 states. [2019-11-22 11:21:49,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:21:49,137 INFO L93 Difference]: Finished difference Result 331 states and 351 transitions. [2019-11-22 11:21:49,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-22 11:21:49,138 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-11-22 11:21:49,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:21:49,140 INFO L225 Difference]: With dead ends: 331 [2019-11-22 11:21:49,140 INFO L226 Difference]: Without dead ends: 331 [2019-11-22 11:21:49,141 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-22 11:21:49,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-11-22 11:21:49,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 274. [2019-11-22 11:21:49,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-11-22 11:21:49,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 291 transitions. [2019-11-22 11:21:49,149 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 291 transitions. Word has length 25 [2019-11-22 11:21:49,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:21:49,149 INFO L462 AbstractCegarLoop]: Abstraction has 274 states and 291 transitions. [2019-11-22 11:21:49,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-22 11:21:49,149 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 291 transitions. [2019-11-22 11:21:49,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-22 11:21:49,150 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:21:49,151 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-22 11:21:49,151 INFO L410 AbstractCegarLoop]: === Iteration 10 === [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-22 11:21:49,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:21:49,151 INFO L82 PathProgramCache]: Analyzing trace with hash 690194188, now seen corresponding path program 1 times [2019-11-22 11:21:49,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:21:49,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488967112] [2019-11-22 11:21:49,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:21:49,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:49,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:49,342 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-22 11:21:49,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488967112] [2019-11-22 11:21:49,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:21:49,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-22 11:21:49,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471135317] [2019-11-22 11:21:49,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-22 11:21:49,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:21:49,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-22 11:21:49,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-22 11:21:49,344 INFO L87 Difference]: Start difference. First operand 274 states and 291 transitions. Second operand 11 states. [2019-11-22 11:21:50,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:21:50,994 INFO L93 Difference]: Finished difference Result 340 states and 364 transitions. [2019-11-22 11:21:50,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-22 11:21:50,995 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2019-11-22 11:21:50,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:21:50,998 INFO L225 Difference]: With dead ends: 340 [2019-11-22 11:21:50,998 INFO L226 Difference]: Without dead ends: 340 [2019-11-22 11:21:51,000 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-22 11:21:51,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2019-11-22 11:21:51,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 275. [2019-11-22 11:21:51,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-11-22 11:21:51,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 293 transitions. [2019-11-22 11:21:51,013 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 293 transitions. Word has length 36 [2019-11-22 11:21:51,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:21:51,014 INFO L462 AbstractCegarLoop]: Abstraction has 275 states and 293 transitions. [2019-11-22 11:21:51,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-22 11:21:51,014 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 293 transitions. [2019-11-22 11:21:51,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-22 11:21:51,015 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:21:51,015 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-22 11:21:51,016 INFO L410 AbstractCegarLoop]: === Iteration 11 === [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-22 11:21:51,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:21:51,016 INFO L82 PathProgramCache]: Analyzing trace with hash 690194189, now seen corresponding path program 1 times [2019-11-22 11:21:51,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:21:51,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679777993] [2019-11-22 11:21:51,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:21:51,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:51,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:51,171 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-22 11:21:51,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679777993] [2019-11-22 11:21:51,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:21:51,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-22 11:21:51,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774296588] [2019-11-22 11:21:51,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-22 11:21:51,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:21:51,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-22 11:21:51,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-22 11:21:51,174 INFO L87 Difference]: Start difference. First operand 275 states and 293 transitions. Second operand 9 states. [2019-11-22 11:21:52,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:21:52,581 INFO L93 Difference]: Finished difference Result 324 states and 344 transitions. [2019-11-22 11:21:52,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 11:21:52,583 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2019-11-22 11:21:52,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:21:52,585 INFO L225 Difference]: With dead ends: 324 [2019-11-22 11:21:52,590 INFO L226 Difference]: Without dead ends: 324 [2019-11-22 11:21:52,590 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-11-22 11:21:52,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-11-22 11:21:52,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 275. [2019-11-22 11:21:52,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-11-22 11:21:52,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 292 transitions. [2019-11-22 11:21:52,602 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 292 transitions. Word has length 36 [2019-11-22 11:21:52,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:21:52,604 INFO L462 AbstractCegarLoop]: Abstraction has 275 states and 292 transitions. [2019-11-22 11:21:52,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-22 11:21:52,604 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 292 transitions. [2019-11-22 11:21:52,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-22 11:21:52,609 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:21:52,609 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-22 11:21:52,609 INFO L410 AbstractCegarLoop]: === Iteration 12 === [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-22 11:21:52,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:21:52,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1511282514, now seen corresponding path program 1 times [2019-11-22 11:21:52,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:21:52,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610683316] [2019-11-22 11:21:52,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:21:52,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:52,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:52,851 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-22 11:21:52,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610683316] [2019-11-22 11:21:52,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:21:52,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-22 11:21:52,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549480880] [2019-11-22 11:21:52,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-22 11:21:52,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:21:52,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-22 11:21:52,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-22 11:21:52,855 INFO L87 Difference]: Start difference. First operand 275 states and 292 transitions. Second operand 11 states. [2019-11-22 11:21:54,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:21:54,400 INFO L93 Difference]: Finished difference Result 338 states and 362 transitions. [2019-11-22 11:21:54,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-22 11:21:54,401 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2019-11-22 11:21:54,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:21:54,403 INFO L225 Difference]: With dead ends: 338 [2019-11-22 11:21:54,403 INFO L226 Difference]: Without dead ends: 338 [2019-11-22 11:21:54,404 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-22 11:21:54,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-11-22 11:21:54,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 275. [2019-11-22 11:21:54,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-11-22 11:21:54,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 291 transitions. [2019-11-22 11:21:54,422 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 291 transitions. Word has length 36 [2019-11-22 11:21:54,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:21:54,422 INFO L462 AbstractCegarLoop]: Abstraction has 275 states and 291 transitions. [2019-11-22 11:21:54,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-22 11:21:54,423 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 291 transitions. [2019-11-22 11:21:54,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-22 11:21:54,425 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:21:54,426 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-22 11:21:54,426 INFO L410 AbstractCegarLoop]: === Iteration 13 === [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-22 11:21:54,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:21:54,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1511282513, now seen corresponding path program 1 times [2019-11-22 11:21:54,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:21:54,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035217451] [2019-11-22 11:21:54,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:21:54,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:54,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:54,611 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-22 11:21:54,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035217451] [2019-11-22 11:21:54,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:21:54,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-22 11:21:54,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410947582] [2019-11-22 11:21:54,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-22 11:21:54,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:21:54,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-22 11:21:54,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-22 11:21:54,613 INFO L87 Difference]: Start difference. First operand 275 states and 291 transitions. Second operand 9 states. [2019-11-22 11:21:55,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:21:55,934 INFO L93 Difference]: Finished difference Result 322 states and 342 transitions. [2019-11-22 11:21:55,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 11:21:55,934 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2019-11-22 11:21:55,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:21:55,937 INFO L225 Difference]: With dead ends: 322 [2019-11-22 11:21:55,937 INFO L226 Difference]: Without dead ends: 322 [2019-11-22 11:21:55,938 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-22 11:21:55,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-11-22 11:21:55,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 275. [2019-11-22 11:21:55,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-11-22 11:21:55,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 290 transitions. [2019-11-22 11:21:55,945 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 290 transitions. Word has length 36 [2019-11-22 11:21:55,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:21:55,945 INFO L462 AbstractCegarLoop]: Abstraction has 275 states and 290 transitions. [2019-11-22 11:21:55,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-22 11:21:55,945 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 290 transitions. [2019-11-22 11:21:55,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-22 11:21:55,946 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:21:55,946 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, 1, 1] [2019-11-22 11:21:55,947 INFO L410 AbstractCegarLoop]: === Iteration 14 === [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-22 11:21:55,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:21:55,947 INFO L82 PathProgramCache]: Analyzing trace with hash 801871937, now seen corresponding path program 1 times [2019-11-22 11:21:55,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:21:55,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575034199] [2019-11-22 11:21:55,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:21:55,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:56,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:56,109 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:21:56,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575034199] [2019-11-22 11:21:56,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:21:56,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-22 11:21:56,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382095203] [2019-11-22 11:21:56,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-22 11:21:56,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:21:56,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-22 11:21:56,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-11-22 11:21:56,111 INFO L87 Difference]: Start difference. First operand 275 states and 290 transitions. Second operand 13 states. [2019-11-22 11:21:57,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:21:57,842 INFO L93 Difference]: Finished difference Result 276 states and 294 transitions. [2019-11-22 11:21:57,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-22 11:21:57,842 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 41 [2019-11-22 11:21:57,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:21:57,844 INFO L225 Difference]: With dead ends: 276 [2019-11-22 11:21:57,845 INFO L226 Difference]: Without dead ends: 265 [2019-11-22 11:21:57,846 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2019-11-22 11:21:57,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-11-22 11:21:57,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 223. [2019-11-22 11:21:57,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-11-22 11:21:57,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 236 transitions. [2019-11-22 11:21:57,852 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 236 transitions. Word has length 41 [2019-11-22 11:21:57,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:21:57,852 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 236 transitions. [2019-11-22 11:21:57,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-22 11:21:57,853 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 236 transitions. [2019-11-22 11:21:57,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-22 11:21:57,853 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:21:57,853 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:21:57,854 INFO L410 AbstractCegarLoop]: === Iteration 15 === [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-22 11:21:57,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:21:57,854 INFO L82 PathProgramCache]: Analyzing trace with hash 257285329, now seen corresponding path program 1 times [2019-11-22 11:21:57,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:21:57,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791508233] [2019-11-22 11:21:57,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:21:57,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:57,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:57,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:57,933 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-22 11:21:57,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791508233] [2019-11-22 11:21:57,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:21:57,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-22 11:21:57,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738343020] [2019-11-22 11:21:57,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-22 11:21:57,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:21:57,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-22 11:21:57,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-22 11:21:57,936 INFO L87 Difference]: Start difference. First operand 223 states and 236 transitions. Second operand 7 states. [2019-11-22 11:21:58,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:21:58,744 INFO L93 Difference]: Finished difference Result 266 states and 287 transitions. [2019-11-22 11:21:58,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 11:21:58,745 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2019-11-22 11:21:58,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:21:58,747 INFO L225 Difference]: With dead ends: 266 [2019-11-22 11:21:58,747 INFO L226 Difference]: Without dead ends: 266 [2019-11-22 11:21:58,748 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 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-22 11:21:58,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-11-22 11:21:58,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 223. [2019-11-22 11:21:58,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-11-22 11:21:58,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 238 transitions. [2019-11-22 11:21:58,755 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 238 transitions. Word has length 46 [2019-11-22 11:21:58,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:21:58,755 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 238 transitions. [2019-11-22 11:21:58,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-22 11:21:58,755 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 238 transitions. [2019-11-22 11:21:58,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-22 11:21:58,756 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:21:58,756 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:21:58,757 INFO L410 AbstractCegarLoop]: === Iteration 16 === [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-22 11:21:58,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:21:58,757 INFO L82 PathProgramCache]: Analyzing trace with hash 257285330, now seen corresponding path program 1 times [2019-11-22 11:21:58,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:21:58,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453510079] [2019-11-22 11:21:58,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:21:58,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:58,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:58,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:58,875 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-22 11:21:58,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453510079] [2019-11-22 11:21:58,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:21:58,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-22 11:21:58,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191757505] [2019-11-22 11:21:58,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-22 11:21:58,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:21:58,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-22 11:21:58,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-22 11:21:58,880 INFO L87 Difference]: Start difference. First operand 223 states and 238 transitions. Second operand 7 states. [2019-11-22 11:21:59,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:21:59,670 INFO L93 Difference]: Finished difference Result 281 states and 301 transitions. [2019-11-22 11:21:59,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-22 11:21:59,670 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2019-11-22 11:21:59,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:21:59,672 INFO L225 Difference]: With dead ends: 281 [2019-11-22 11:21:59,672 INFO L226 Difference]: Without dead ends: 281 [2019-11-22 11:21:59,673 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 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-22 11:21:59,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-11-22 11:21:59,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 242. [2019-11-22 11:21:59,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-11-22 11:21:59,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 262 transitions. [2019-11-22 11:21:59,680 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 262 transitions. Word has length 46 [2019-11-22 11:21:59,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:21:59,680 INFO L462 AbstractCegarLoop]: Abstraction has 242 states and 262 transitions. [2019-11-22 11:21:59,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-22 11:21:59,680 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 262 transitions. [2019-11-22 11:21:59,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-22 11:21:59,681 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:21:59,681 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:21:59,682 INFO L410 AbstractCegarLoop]: === Iteration 17 === [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-22 11:21:59,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:21:59,682 INFO L82 PathProgramCache]: Analyzing trace with hash -679135460, now seen corresponding path program 1 times [2019-11-22 11:21:59,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:21:59,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133506858] [2019-11-22 11:21:59,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:21:59,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:59,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:59,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:59,740 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-22 11:21:59,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133506858] [2019-11-22 11:21:59,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:21:59,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-22 11:21:59,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44269295] [2019-11-22 11:21:59,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 11:21:59,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:21:59,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 11:21:59,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-22 11:21:59,744 INFO L87 Difference]: Start difference. First operand 242 states and 262 transitions. Second operand 6 states. [2019-11-22 11:22:00,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:22:00,299 INFO L93 Difference]: Finished difference Result 248 states and 267 transitions. [2019-11-22 11:22:00,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-22 11:22:00,300 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-11-22 11:22:00,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:22:00,302 INFO L225 Difference]: With dead ends: 248 [2019-11-22 11:22:00,303 INFO L226 Difference]: Without dead ends: 248 [2019-11-22 11:22:00,303 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-22 11:22:00,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-11-22 11:22:00,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 239. [2019-11-22 11:22:00,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-11-22 11:22:00,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 259 transitions. [2019-11-22 11:22:00,309 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 259 transitions. Word has length 47 [2019-11-22 11:22:00,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:22:00,309 INFO L462 AbstractCegarLoop]: Abstraction has 239 states and 259 transitions. [2019-11-22 11:22:00,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 11:22:00,309 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 259 transitions. [2019-11-22 11:22:00,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-22 11:22:00,310 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:22:00,310 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:22:00,310 INFO L410 AbstractCegarLoop]: === Iteration 18 === [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-22 11:22:00,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:22:00,311 INFO L82 PathProgramCache]: Analyzing trace with hash -679135459, now seen corresponding path program 1 times [2019-11-22 11:22:00,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:22:00,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292576353] [2019-11-22 11:22:00,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:22:00,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:22:00,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:22:00,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:22:00,409 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-22 11:22:00,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292576353] [2019-11-22 11:22:00,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:22:00,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-22 11:22:00,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083592918] [2019-11-22 11:22:00,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-22 11:22:00,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:22:00,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-22 11:22:00,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-22 11:22:00,411 INFO L87 Difference]: Start difference. First operand 239 states and 259 transitions. Second operand 7 states. [2019-11-22 11:22:01,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:22:01,235 INFO L93 Difference]: Finished difference Result 300 states and 319 transitions. [2019-11-22 11:22:01,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-22 11:22:01,236 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-11-22 11:22:01,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:22:01,238 INFO L225 Difference]: With dead ends: 300 [2019-11-22 11:22:01,238 INFO L226 Difference]: Without dead ends: 300 [2019-11-22 11:22:01,238 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 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-22 11:22:01,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-11-22 11:22:01,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 260. [2019-11-22 11:22:01,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-11-22 11:22:01,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 286 transitions. [2019-11-22 11:22:01,245 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 286 transitions. Word has length 47 [2019-11-22 11:22:01,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:22:01,246 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 286 transitions. [2019-11-22 11:22:01,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-22 11:22:01,246 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 286 transitions. [2019-11-22 11:22:01,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-22 11:22:01,247 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:22:01,248 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:22:01,248 INFO L410 AbstractCegarLoop]: === Iteration 19 === [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-22 11:22:01,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:22:01,249 INFO L82 PathProgramCache]: Analyzing trace with hash -2077484617, now seen corresponding path program 1 times [2019-11-22 11:22:01,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:22:01,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028903204] [2019-11-22 11:22:01,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:22:01,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:22:01,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:22:01,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:22:01,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:22:01,331 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:22:01,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028903204] [2019-11-22 11:22:01,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:22:01,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-22 11:22:01,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207137227] [2019-11-22 11:22:01,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 11:22:01,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:22:01,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 11:22:01,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-22 11:22:01,333 INFO L87 Difference]: Start difference. First operand 260 states and 286 transitions. Second operand 8 states. [2019-11-22 11:22:02,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:22:02,139 INFO L93 Difference]: Finished difference Result 310 states and 334 transitions. [2019-11-22 11:22:02,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-22 11:22:02,140 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2019-11-22 11:22:02,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:22:02,141 INFO L225 Difference]: With dead ends: 310 [2019-11-22 11:22:02,141 INFO L226 Difference]: Without dead ends: 307 [2019-11-22 11:22:02,142 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-11-22 11:22:02,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-11-22 11:22:02,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 260. [2019-11-22 11:22:02,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-11-22 11:22:02,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 285 transitions. [2019-11-22 11:22:02,147 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 285 transitions. Word has length 50 [2019-11-22 11:22:02,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:22:02,147 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 285 transitions. [2019-11-22 11:22:02,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 11:22:02,147 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 285 transitions. [2019-11-22 11:22:02,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-22 11:22:02,148 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:22:02,148 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:22:02,148 INFO L410 AbstractCegarLoop]: === Iteration 20 === [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-22 11:22:02,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:22:02,149 INFO L82 PathProgramCache]: Analyzing trace with hash -2056453987, now seen corresponding path program 1 times [2019-11-22 11:22:02,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:22:02,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647726430] [2019-11-22 11:22:02,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:22:02,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:22:02,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:22:02,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:22:02,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-22 11:22:02,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647726430] [2019-11-22 11:22:02,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:22:02,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-22 11:22:02,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627742619] [2019-11-22 11:22:02,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-22 11:22:02,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:22:02,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-22 11:22:02,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-11-22 11:22:02,316 INFO L87 Difference]: Start difference. First operand 260 states and 285 transitions. Second operand 13 states. [2019-11-22 11:22:02,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:22:02,859 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-11-22 11:22:02,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-22 11:22:02,860 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 50 [2019-11-22 11:22:02,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:22:02,861 INFO L225 Difference]: With dead ends: 44 [2019-11-22 11:22:02,861 INFO L226 Difference]: Without dead ends: 0 [2019-11-22 11:22:02,862 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2019-11-22 11:22:02,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-22 11:22:02,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-22 11:22:02,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-22 11:22:02,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-22 11:22:02,863 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2019-11-22 11:22:02,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:22:02,864 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-22 11:22:02,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-22 11:22:02,864 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-22 11:22:02,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-22 11:22:02,872 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 11:22:02 BoogieIcfgContainer [2019-11-22 11:22:02,872 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-22 11:22:02,873 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-22 11:22:02,873 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-22 11:22:02,873 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-22 11:22:02,874 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:21:41" (3/4) ... [2019-11-22 11:22:02,878 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-22 11:22:02,886 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fail [2019-11-22 11:22:02,886 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-22 11:22:02,886 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure merge_pair [2019-11-22 11:22:02,886 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure merge_single_node [2019-11-22 11:22:02,887 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-11-22 11:22:02,887 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure seq_sort_core [2019-11-22 11:22:02,887 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-11-22 11:22:02,887 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure inspect_before [2019-11-22 11:22:02,888 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-22 11:22:02,888 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure inspect_after [2019-11-22 11:22:02,899 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2019-11-22 11:22:02,900 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-11-22 11:22:02,900 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-22 11:22:02,901 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-22 11:22:02,999 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-22 11:22:02,999 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-22 11:22:03,004 INFO L168 Benchmark]: Toolchain (without parser) took 23290.79 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 477.6 MB). Free memory was 956.3 MB in the beginning and 1.4 GB in the end (delta: -466.9 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-22 11:22:03,004 INFO L168 Benchmark]: CDTParser took 0.21 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-22 11:22:03,005 INFO L168 Benchmark]: CACSL2BoogieTranslator took 650.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -141.8 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-22 11:22:03,005 INFO L168 Benchmark]: Boogie Preprocessor took 121.11 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-22 11:22:03,006 INFO L168 Benchmark]: RCFGBuilder took 1155.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 998.5 MB in the end (delta: 99.6 MB). Peak memory consumption was 99.6 MB. Max. memory is 11.5 GB. [2019-11-22 11:22:03,006 INFO L168 Benchmark]: TraceAbstraction took 21232.01 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 353.9 MB). Free memory was 998.5 MB in the beginning and 1.4 GB in the end (delta: -438.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 11:22:03,007 INFO L168 Benchmark]: Witness Printer took 126.76 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: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2019-11-22 11:22:03,008 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.21 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 650.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -141.8 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 121.11 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 1155.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 998.5 MB in the end (delta: 99.6 MB). Peak memory consumption was 99.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 21232.01 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 353.9 MB). Free memory was 998.5 MB in the beginning and 1.4 GB in the end (delta: -438.3 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 126.76 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: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 573]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 573]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 573]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 573]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 573]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 577]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 577]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 577]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 577]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 573]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 570]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 570]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 571]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 570]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 570]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 571]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 590]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 598]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 590]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 595]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 598]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 598]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 595]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 597]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 597]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 614]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 609]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 609]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 614]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 612]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 613]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 613]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 605]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 605]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 605]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 612]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 605]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 609]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 614]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 614]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 609]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 644]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 648]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 644]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 648]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 637]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 648]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 650]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 651]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 638]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 638]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 651]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 633]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 633]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 651]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 650]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 637]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 625]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 647]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 647]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 632]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 632]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 620]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 620]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 622]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 622]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 622]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 622]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 623]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 619]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 623]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 619]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 622]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 622]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 104 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 284 locations, 104 error locations. Result: SAFE, OverallTime: 21.1s, OverallIterations: 20, TraceHistogramMax: 2, AutomataDifference: 18.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3613 SDtfs, 4687 SDslu, 5481 SDs, 0 SdLazy, 16049 SolverSat, 472 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 258 GetRequests, 78 SyntacticMatches, 8 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=278occurred in iteration=0, 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, 20 MinimizatonAttempts, 904 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 615 NumberOfCodeBlocks, 615 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 595 ConstructedInterpolants, 0 QuantifiedInterpolants, 129379 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 30/30 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...