./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 c1f4b5c4 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.25-c1f4b5c [2019-12-08 16:28:39,262 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-08 16:28:39,265 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-08 16:28:39,282 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-08 16:28:39,283 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-08 16:28:39,285 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-08 16:28:39,287 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-08 16:28:39,296 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-08 16:28:39,300 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-08 16:28:39,302 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-08 16:28:39,303 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-08 16:28:39,304 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-08 16:28:39,304 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-08 16:28:39,305 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-08 16:28:39,306 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-08 16:28:39,307 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-08 16:28:39,308 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-08 16:28:39,309 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-08 16:28:39,311 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-08 16:28:39,313 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-08 16:28:39,314 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-08 16:28:39,315 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-08 16:28:39,316 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-08 16:28:39,317 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-08 16:28:39,319 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-08 16:28:39,320 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-08 16:28:39,320 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-08 16:28:39,321 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-08 16:28:39,321 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-08 16:28:39,323 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-08 16:28:39,323 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-08 16:28:39,324 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-08 16:28:39,325 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-08 16:28:39,326 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-08 16:28:39,327 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-08 16:28:39,327 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-08 16:28:39,328 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-08 16:28:39,328 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-08 16:28:39,328 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-08 16:28:39,329 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-08 16:28:39,330 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-08 16:28:39,331 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2019-12-08 16:28:39,359 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-08 16:28:39,359 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-08 16:28:39,365 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-08 16:28:39,365 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-08 16:28:39,365 INFO L138 SettingsManager]: * Use SBE=true [2019-12-08 16:28:39,365 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-08 16:28:39,366 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-08 16:28:39,366 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-08 16:28:39,366 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-08 16:28:39,366 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-08 16:28:39,367 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-08 16:28:39,371 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-08 16:28:39,371 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-08 16:28:39,371 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-08 16:28:39,371 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-08 16:28:39,372 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-08 16:28:39,372 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-08 16:28:39,372 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-08 16:28:39,372 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-08 16:28:39,372 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-08 16:28:39,373 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-08 16:28:39,373 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-08 16:28:39,373 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-08 16:28:39,373 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-08 16:28:39,375 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-08 16:28:39,375 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-08 16:28:39,376 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-08 16:28:39,376 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-12-08 16:28:39,676 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-08 16:28:39,694 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-08 16:28:39,699 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-08 16:28:39,700 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-08 16:28:39,701 INFO L275 PluginConnector]: CDTParser initialized [2019-12-08 16:28:39,702 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-12-08 16:28:39,768 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9df493ba5/a447317de37b4f92848e324067652547/FLAG6fb70edab [2019-12-08 16:28:40,304 INFO L306 CDTParser]: Found 1 translation units. [2019-12-08 16:28:40,305 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/merge_sort-1.i [2019-12-08 16:28:40,320 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9df493ba5/a447317de37b4f92848e324067652547/FLAG6fb70edab [2019-12-08 16:28:40,604 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9df493ba5/a447317de37b4f92848e324067652547 [2019-12-08 16:28:40,608 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-08 16:28:40,610 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-08 16:28:40,612 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-08 16:28:40,612 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-08 16:28:40,616 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-08 16:28:40,617 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 04:28:40" (1/1) ... [2019-12-08 16:28:40,620 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e7d0465 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:28:40, skipping insertion in model container [2019-12-08 16:28:40,620 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 04:28:40" (1/1) ... [2019-12-08 16:28:40,628 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-08 16:28:40,667 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-08 16:28:41,102 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-08 16:28:41,113 INFO L203 MainTranslator]: Completed pre-run [2019-12-08 16:28:41,182 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-08 16:28:41,240 INFO L208 MainTranslator]: Completed translation [2019-12-08 16:28:41,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:28:41 WrapperNode [2019-12-08 16:28:41,241 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-08 16:28:41,242 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-08 16:28:41,242 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-08 16:28:41,242 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-08 16:28:41,255 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:28:41" (1/1) ... [2019-12-08 16:28:41,256 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:28:41" (1/1) ... [2019-12-08 16:28:41,279 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:28:41" (1/1) ... [2019-12-08 16:28:41,280 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:28:41" (1/1) ... [2019-12-08 16:28:41,308 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:28:41" (1/1) ... [2019-12-08 16:28:41,320 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:28:41" (1/1) ... [2019-12-08 16:28:41,326 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:28:41" (1/1) ... [2019-12-08 16:28:41,335 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-08 16:28:41,335 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-08 16:28:41,336 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-08 16:28:41,336 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-08 16:28:41,337 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:28:41" (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-12-08 16:28:41,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-12-08 16:28:41,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-08 16:28:41,393 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-12-08 16:28:41,393 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-12-08 16:28:41,393 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2019-12-08 16:28:41,393 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2019-12-08 16:28:41,393 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_pair [2019-12-08 16:28:41,393 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_sort_core [2019-12-08 16:28:41,394 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_before [2019-12-08 16:28:41,394 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_after [2019-12-08 16:28:41,394 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-12-08 16:28:41,395 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-12-08 16:28:41,396 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-12-08 16:28:41,396 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-12-08 16:28:41,396 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-12-08 16:28:41,396 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-12-08 16:28:41,396 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-12-08 16:28:41,399 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-12-08 16:28:41,399 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-12-08 16:28:41,399 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-12-08 16:28:41,399 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-12-08 16:28:41,400 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-12-08 16:28:41,400 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-12-08 16:28:41,400 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-12-08 16:28:41,400 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-12-08 16:28:41,400 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-12-08 16:28:41,400 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-12-08 16:28:41,401 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-12-08 16:28:41,401 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-12-08 16:28:41,401 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-12-08 16:28:41,401 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-12-08 16:28:41,401 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-12-08 16:28:41,402 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-12-08 16:28:41,402 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-12-08 16:28:41,402 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-12-08 16:28:41,402 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-12-08 16:28:41,402 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-12-08 16:28:41,402 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-12-08 16:28:41,402 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-12-08 16:28:41,403 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-12-08 16:28:41,403 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-12-08 16:28:41,403 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-12-08 16:28:41,403 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-12-08 16:28:41,403 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-12-08 16:28:41,405 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-12-08 16:28:41,405 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-12-08 16:28:41,405 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-12-08 16:28:41,405 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-12-08 16:28:41,405 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-12-08 16:28:41,405 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-12-08 16:28:41,406 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-12-08 16:28:41,406 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-12-08 16:28:41,406 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-12-08 16:28:41,406 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-12-08 16:28:41,406 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-12-08 16:28:41,407 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-12-08 16:28:41,407 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-12-08 16:28:41,407 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-12-08 16:28:41,407 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-12-08 16:28:41,407 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-12-08 16:28:41,407 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-12-08 16:28:41,408 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-12-08 16:28:41,408 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-12-08 16:28:41,408 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-12-08 16:28:41,408 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-12-08 16:28:41,408 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-12-08 16:28:41,408 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-12-08 16:28:41,408 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-12-08 16:28:41,409 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-12-08 16:28:41,410 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-12-08 16:28:41,410 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-12-08 16:28:41,410 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-12-08 16:28:41,410 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-12-08 16:28:41,411 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-12-08 16:28:41,411 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-12-08 16:28:41,412 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-12-08 16:28:41,412 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-12-08 16:28:41,413 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-12-08 16:28:41,413 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-12-08 16:28:41,413 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-12-08 16:28:41,413 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-12-08 16:28:41,413 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-12-08 16:28:41,413 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-12-08 16:28:41,413 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-12-08 16:28:41,414 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-12-08 16:28:41,414 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-12-08 16:28:41,414 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-12-08 16:28:41,414 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-12-08 16:28:41,414 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-12-08 16:28:41,414 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-12-08 16:28:41,414 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-12-08 16:28:41,415 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-12-08 16:28:41,415 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-12-08 16:28:41,415 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-12-08 16:28:41,415 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-12-08 16:28:41,415 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-12-08 16:28:41,415 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-12-08 16:28:41,415 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-12-08 16:28:41,415 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-12-08 16:28:41,416 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-12-08 16:28:41,416 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-12-08 16:28:41,416 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-12-08 16:28:41,416 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-12-08 16:28:41,416 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-12-08 16:28:41,416 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-12-08 16:28:41,416 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-12-08 16:28:41,417 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-12-08 16:28:41,417 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-12-08 16:28:41,417 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-12-08 16:28:41,417 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-12-08 16:28:41,417 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-12-08 16:28:41,417 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-12-08 16:28:41,417 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-12-08 16:28:41,418 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-12-08 16:28:41,418 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-12-08 16:28:41,418 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2019-12-08 16:28:41,418 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2019-12-08 16:28:41,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-08 16:28:41,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-08 16:28:41,419 INFO L130 BoogieDeclarations]: Found specification of procedure merge_pair [2019-12-08 16:28:41,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-08 16:28:41,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-08 16:28:41,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-08 16:28:41,420 INFO L130 BoogieDeclarations]: Found specification of procedure seq_sort_core [2019-12-08 16:28:41,420 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_before [2019-12-08 16:28:41,420 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_after [2019-12-08 16:28:41,420 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-12-08 16:28:41,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-08 16:28:41,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-08 16:28:41,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-12-08 16:28:41,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-08 16:28:42,492 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-08 16:28:42,492 INFO L287 CfgBuilder]: Removed 33 assume(true) statements. [2019-12-08 16:28:42,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 04:28:42 BoogieIcfgContainer [2019-12-08 16:28:42,494 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-08 16:28:42,495 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-08 16:28:42,495 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-08 16:28:42,499 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-08 16:28:42,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 04:28:40" (1/3) ... [2019-12-08 16:28:42,500 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77d8b3e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 04:28:42, skipping insertion in model container [2019-12-08 16:28:42,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:28:41" (2/3) ... [2019-12-08 16:28:42,500 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77d8b3e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 04:28:42, skipping insertion in model container [2019-12-08 16:28:42,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 04:28:42" (3/3) ... [2019-12-08 16:28:42,502 INFO L109 eAbstractionObserver]: Analyzing ICFG merge_sort-1.i [2019-12-08 16:28:42,513 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-08 16:28:42,521 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 104 error locations. [2019-12-08 16:28:42,534 INFO L249 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2019-12-08 16:28:42,556 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-08 16:28:42,557 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-08 16:28:42,557 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-08 16:28:42,557 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-08 16:28:42,557 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-08 16:28:42,557 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-08 16:28:42,558 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-08 16:28:42,558 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-08 16:28:42,585 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states. [2019-12-08 16:28:42,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-08 16:28:42,596 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:28:42,597 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 16:28:42,598 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-12-08 16:28:42,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:28:42,604 INFO L82 PathProgramCache]: Analyzing trace with hash 995848786, now seen corresponding path program 1 times [2019-12-08 16:28:42,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 16:28:42,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7512529] [2019-12-08 16:28:42,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 16:28:42,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:42,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:42,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:28:42,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7512529] [2019-12-08 16:28:42,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:28:42,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-08 16:28:42,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228689085] [2019-12-08 16:28:42,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-08 16:28:42,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 16:28:42,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-08 16:28:42,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-08 16:28:42,811 INFO L87 Difference]: Start difference. First operand 278 states. Second operand 3 states. [2019-12-08 16:28:43,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:28:43,370 INFO L93 Difference]: Finished difference Result 318 states and 353 transitions. [2019-12-08 16:28:43,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-08 16:28:43,372 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-08 16:28:43,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:28:43,388 INFO L225 Difference]: With dead ends: 318 [2019-12-08 16:28:43,389 INFO L226 Difference]: Without dead ends: 300 [2019-12-08 16:28:43,391 INFO L631 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-12-08 16:28:43,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-12-08 16:28:43,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 262. [2019-12-08 16:28:43,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-12-08 16:28:43,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 276 transitions. [2019-12-08 16:28:43,458 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 276 transitions. Word has length 9 [2019-12-08 16:28:43,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:28:43,459 INFO L462 AbstractCegarLoop]: Abstraction has 262 states and 276 transitions. [2019-12-08 16:28:43,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-08 16:28:43,459 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 276 transitions. [2019-12-08 16:28:43,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-08 16:28:43,460 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:28:43,460 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 16:28:43,461 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-12-08 16:28:43,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:28:43,462 INFO L82 PathProgramCache]: Analyzing trace with hash 805494535, now seen corresponding path program 1 times [2019-12-08 16:28:43,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 16:28:43,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073382762] [2019-12-08 16:28:43,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 16:28:43,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:43,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:43,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:28:43,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073382762] [2019-12-08 16:28:43,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:28:43,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-08 16:28:43,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450969341] [2019-12-08 16:28:43,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-08 16:28:43,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 16:28:43,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-08 16:28:43,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-08 16:28:43,565 INFO L87 Difference]: Start difference. First operand 262 states and 276 transitions. Second operand 4 states. [2019-12-08 16:28:44,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:28:44,276 INFO L93 Difference]: Finished difference Result 317 states and 342 transitions. [2019-12-08 16:28:44,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-08 16:28:44,277 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-08 16:28:44,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:28:44,280 INFO L225 Difference]: With dead ends: 317 [2019-12-08 16:28:44,283 INFO L226 Difference]: Without dead ends: 317 [2019-12-08 16:28:44,284 INFO L631 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-12-08 16:28:44,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2019-12-08 16:28:44,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 260. [2019-12-08 16:28:44,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-12-08 16:28:44,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 274 transitions. [2019-12-08 16:28:44,327 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 274 transitions. Word has length 10 [2019-12-08 16:28:44,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:28:44,328 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 274 transitions. [2019-12-08 16:28:44,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-08 16:28:44,328 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 274 transitions. [2019-12-08 16:28:44,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-08 16:28:44,329 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:28:44,329 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 16:28:44,330 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-12-08 16:28:44,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:28:44,331 INFO L82 PathProgramCache]: Analyzing trace with hash 805494536, now seen corresponding path program 1 times [2019-12-08 16:28:44,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 16:28:44,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118761024] [2019-12-08 16:28:44,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 16:28:44,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:44,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:44,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:28:44,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118761024] [2019-12-08 16:28:44,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:28:44,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-08 16:28:44,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362307127] [2019-12-08 16:28:44,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-08 16:28:44,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 16:28:44,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-08 16:28:44,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-08 16:28:44,427 INFO L87 Difference]: Start difference. First operand 260 states and 274 transitions. Second operand 4 states. [2019-12-08 16:28:45,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:28:45,064 INFO L93 Difference]: Finished difference Result 326 states and 352 transitions. [2019-12-08 16:28:45,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-08 16:28:45,065 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-08 16:28:45,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:28:45,068 INFO L225 Difference]: With dead ends: 326 [2019-12-08 16:28:45,068 INFO L226 Difference]: Without dead ends: 326 [2019-12-08 16:28:45,069 INFO L631 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-12-08 16:28:45,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-12-08 16:28:45,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 258. [2019-12-08 16:28:45,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-12-08 16:28:45,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 272 transitions. [2019-12-08 16:28:45,083 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 272 transitions. Word has length 10 [2019-12-08 16:28:45,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:28:45,084 INFO L462 AbstractCegarLoop]: Abstraction has 258 states and 272 transitions. [2019-12-08 16:28:45,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-08 16:28:45,084 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 272 transitions. [2019-12-08 16:28:45,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-08 16:28:45,084 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:28:45,085 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 16:28:45,086 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-12-08 16:28:45,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:28:45,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1991342111, now seen corresponding path program 1 times [2019-12-08 16:28:45,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 16:28:45,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639565091] [2019-12-08 16:28:45,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 16:28:45,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:45,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:45,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:28:45,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639565091] [2019-12-08 16:28:45,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:28:45,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-08 16:28:45,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739202332] [2019-12-08 16:28:45,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-08 16:28:45,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 16:28:45,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-08 16:28:45,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-08 16:28:45,141 INFO L87 Difference]: Start difference. First operand 258 states and 272 transitions. Second operand 4 states. [2019-12-08 16:28:45,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:28:45,671 INFO L93 Difference]: Finished difference Result 293 states and 308 transitions. [2019-12-08 16:28:45,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-08 16:28:45,672 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-08 16:28:45,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:28:45,675 INFO L225 Difference]: With dead ends: 293 [2019-12-08 16:28:45,676 INFO L226 Difference]: Without dead ends: 292 [2019-12-08 16:28:45,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-08 16:28:45,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-12-08 16:28:45,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 257. [2019-12-08 16:28:45,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-12-08 16:28:45,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 270 transitions. [2019-12-08 16:28:45,688 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 270 transitions. Word has length 14 [2019-12-08 16:28:45,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:28:45,688 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 270 transitions. [2019-12-08 16:28:45,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-08 16:28:45,688 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 270 transitions. [2019-12-08 16:28:45,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-08 16:28:45,689 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:28:45,689 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 16:28:45,689 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-12-08 16:28:45,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:28:45,690 INFO L82 PathProgramCache]: Analyzing trace with hash 742236455, now seen corresponding path program 1 times [2019-12-08 16:28:45,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 16:28:45,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304410710] [2019-12-08 16:28:45,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 16:28:45,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:45,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:45,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:28:45,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304410710] [2019-12-08 16:28:45,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:28:45,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-08 16:28:45,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097025848] [2019-12-08 16:28:45,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-08 16:28:45,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 16:28:45,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-08 16:28:45,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-08 16:28:45,745 INFO L87 Difference]: Start difference. First operand 257 states and 270 transitions. Second operand 4 states. [2019-12-08 16:28:46,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:28:46,325 INFO L93 Difference]: Finished difference Result 299 states and 318 transitions. [2019-12-08 16:28:46,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-08 16:28:46,326 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-08 16:28:46,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:28:46,329 INFO L225 Difference]: With dead ends: 299 [2019-12-08 16:28:46,329 INFO L226 Difference]: Without dead ends: 299 [2019-12-08 16:28:46,329 INFO L631 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-12-08 16:28:46,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-12-08 16:28:46,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 255. [2019-12-08 16:28:46,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-12-08 16:28:46,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 268 transitions. [2019-12-08 16:28:46,341 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 268 transitions. Word has length 15 [2019-12-08 16:28:46,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:28:46,341 INFO L462 AbstractCegarLoop]: Abstraction has 255 states and 268 transitions. [2019-12-08 16:28:46,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-08 16:28:46,342 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 268 transitions. [2019-12-08 16:28:46,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-08 16:28:46,342 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:28:46,343 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 16:28:46,343 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-12-08 16:28:46,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:28:46,344 INFO L82 PathProgramCache]: Analyzing trace with hash 742236456, now seen corresponding path program 1 times [2019-12-08 16:28:46,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 16:28:46,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920632583] [2019-12-08 16:28:46,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 16:28:46,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:46,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:46,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:28:46,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920632583] [2019-12-08 16:28:46,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:28:46,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-08 16:28:46,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763920137] [2019-12-08 16:28:46,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-08 16:28:46,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 16:28:46,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-08 16:28:46,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-08 16:28:46,410 INFO L87 Difference]: Start difference. First operand 255 states and 268 transitions. Second operand 4 states. [2019-12-08 16:28:46,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:28:46,932 INFO L93 Difference]: Finished difference Result 308 states and 328 transitions. [2019-12-08 16:28:46,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-08 16:28:46,933 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-08 16:28:46,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:28:46,935 INFO L225 Difference]: With dead ends: 308 [2019-12-08 16:28:46,936 INFO L226 Difference]: Without dead ends: 308 [2019-12-08 16:28:46,936 INFO L631 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-12-08 16:28:46,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-12-08 16:28:46,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 253. [2019-12-08 16:28:46,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-12-08 16:28:46,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 266 transitions. [2019-12-08 16:28:46,946 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 266 transitions. Word has length 15 [2019-12-08 16:28:46,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:28:46,946 INFO L462 AbstractCegarLoop]: Abstraction has 253 states and 266 transitions. [2019-12-08 16:28:46,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-08 16:28:46,946 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 266 transitions. [2019-12-08 16:28:46,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-08 16:28:46,947 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:28:46,947 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 16:28:46,948 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-12-08 16:28:46,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:28:46,949 INFO L82 PathProgramCache]: Analyzing trace with hash -224686077, now seen corresponding path program 1 times [2019-12-08 16:28:46,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 16:28:46,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160963487] [2019-12-08 16:28:46,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 16:28:46,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:47,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:47,012 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:28:47,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160963487] [2019-12-08 16:28:47,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:28:47,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-08 16:28:47,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957493518] [2019-12-08 16:28:47,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-08 16:28:47,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 16:28:47,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-08 16:28:47,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-08 16:28:47,014 INFO L87 Difference]: Start difference. First operand 253 states and 266 transitions. Second operand 5 states. [2019-12-08 16:28:47,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:28:47,712 INFO L93 Difference]: Finished difference Result 312 states and 332 transitions. [2019-12-08 16:28:47,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-08 16:28:47,713 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-08 16:28:47,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:28:47,716 INFO L225 Difference]: With dead ends: 312 [2019-12-08 16:28:47,716 INFO L226 Difference]: Without dead ends: 312 [2019-12-08 16:28:47,717 INFO L631 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-12-08 16:28:47,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-12-08 16:28:47,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 253. [2019-12-08 16:28:47,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-12-08 16:28:47,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 265 transitions. [2019-12-08 16:28:47,726 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 265 transitions. Word has length 21 [2019-12-08 16:28:47,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:28:47,726 INFO L462 AbstractCegarLoop]: Abstraction has 253 states and 265 transitions. [2019-12-08 16:28:47,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-08 16:28:47,726 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 265 transitions. [2019-12-08 16:28:47,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-08 16:28:47,727 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:28:47,727 INFO L411 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-12-08 16:28:47,728 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-12-08 16:28:47,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:28:47,728 INFO L82 PathProgramCache]: Analyzing trace with hash 552515561, now seen corresponding path program 1 times [2019-12-08 16:28:47,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 16:28:47,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055005542] [2019-12-08 16:28:47,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 16:28:47,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:47,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:47,798 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:28:47,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055005542] [2019-12-08 16:28:47,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:28:47,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-08 16:28:47,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977079172] [2019-12-08 16:28:47,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-08 16:28:47,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 16:28:47,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-08 16:28:47,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-08 16:28:47,800 INFO L87 Difference]: Start difference. First operand 253 states and 265 transitions. Second operand 7 states. [2019-12-08 16:28:48,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:28:48,811 INFO L93 Difference]: Finished difference Result 293 states and 312 transitions. [2019-12-08 16:28:48,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-08 16:28:48,812 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-12-08 16:28:48,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:28:48,814 INFO L225 Difference]: With dead ends: 293 [2019-12-08 16:28:48,814 INFO L226 Difference]: Without dead ends: 293 [2019-12-08 16:28:48,815 INFO L631 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-12-08 16:28:48,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-12-08 16:28:48,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 246. [2019-12-08 16:28:48,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-12-08 16:28:48,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 260 transitions. [2019-12-08 16:28:48,823 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 260 transitions. Word has length 25 [2019-12-08 16:28:48,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:28:48,824 INFO L462 AbstractCegarLoop]: Abstraction has 246 states and 260 transitions. [2019-12-08 16:28:48,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-08 16:28:48,824 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 260 transitions. [2019-12-08 16:28:48,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-08 16:28:48,825 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:28:48,825 INFO L411 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-12-08 16:28:48,825 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-12-08 16:28:48,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:28:48,826 INFO L82 PathProgramCache]: Analyzing trace with hash 552515562, now seen corresponding path program 1 times [2019-12-08 16:28:48,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 16:28:48,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355093855] [2019-12-08 16:28:48,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 16:28:48,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:48,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:48,948 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:28:48,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355093855] [2019-12-08 16:28:48,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:28:48,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-08 16:28:48,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931250992] [2019-12-08 16:28:48,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-08 16:28:48,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 16:28:48,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-08 16:28:48,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-08 16:28:48,950 INFO L87 Difference]: Start difference. First operand 246 states and 260 transitions. Second operand 7 states. [2019-12-08 16:28:49,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:28:49,819 INFO L93 Difference]: Finished difference Result 331 states and 351 transitions. [2019-12-08 16:28:49,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-08 16:28:49,820 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-12-08 16:28:49,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:28:49,824 INFO L225 Difference]: With dead ends: 331 [2019-12-08 16:28:49,824 INFO L226 Difference]: Without dead ends: 331 [2019-12-08 16:28:49,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-08 16:28:49,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-12-08 16:28:49,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 274. [2019-12-08 16:28:49,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-12-08 16:28:49,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 291 transitions. [2019-12-08 16:28:49,833 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 291 transitions. Word has length 25 [2019-12-08 16:28:49,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:28:49,834 INFO L462 AbstractCegarLoop]: Abstraction has 274 states and 291 transitions. [2019-12-08 16:28:49,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-08 16:28:49,834 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 291 transitions. [2019-12-08 16:28:49,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-08 16:28:49,835 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:28:49,835 INFO L411 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-12-08 16:28:49,836 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-12-08 16:28:49,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:28:49,836 INFO L82 PathProgramCache]: Analyzing trace with hash 690194188, now seen corresponding path program 1 times [2019-12-08 16:28:49,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 16:28:49,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307004553] [2019-12-08 16:28:49,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 16:28:49,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:50,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:50,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:28:50,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307004553] [2019-12-08 16:28:50,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:28:50,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-08 16:28:50,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983438848] [2019-12-08 16:28:50,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-08 16:28:50,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 16:28:50,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-08 16:28:50,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-08 16:28:50,040 INFO L87 Difference]: Start difference. First operand 274 states and 291 transitions. Second operand 11 states. [2019-12-08 16:28:51,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:28:51,705 INFO L93 Difference]: Finished difference Result 340 states and 364 transitions. [2019-12-08 16:28:51,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-08 16:28:51,706 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2019-12-08 16:28:51,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:28:51,709 INFO L225 Difference]: With dead ends: 340 [2019-12-08 16:28:51,709 INFO L226 Difference]: Without dead ends: 340 [2019-12-08 16:28:51,710 INFO L631 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-12-08 16:28:51,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2019-12-08 16:28:51,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 275. [2019-12-08 16:28:51,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-12-08 16:28:51,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 293 transitions. [2019-12-08 16:28:51,719 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 293 transitions. Word has length 36 [2019-12-08 16:28:51,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:28:51,720 INFO L462 AbstractCegarLoop]: Abstraction has 275 states and 293 transitions. [2019-12-08 16:28:51,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-08 16:28:51,721 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 293 transitions. [2019-12-08 16:28:51,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-08 16:28:51,722 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:28:51,722 INFO L411 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-12-08 16:28:51,722 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-12-08 16:28:51,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:28:51,723 INFO L82 PathProgramCache]: Analyzing trace with hash 690194189, now seen corresponding path program 1 times [2019-12-08 16:28:51,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 16:28:51,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848769241] [2019-12-08 16:28:51,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 16:28:51,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:51,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:51,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-12-08 16:28:51,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848769241] [2019-12-08 16:28:51,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:28:51,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-08 16:28:51,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317368862] [2019-12-08 16:28:51,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-08 16:28:51,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 16:28:51,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-08 16:28:51,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-12-08 16:28:51,877 INFO L87 Difference]: Start difference. First operand 275 states and 293 transitions. Second operand 9 states. [2019-12-08 16:28:53,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:28:53,316 INFO L93 Difference]: Finished difference Result 324 states and 344 transitions. [2019-12-08 16:28:53,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-08 16:28:53,317 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2019-12-08 16:28:53,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:28:53,319 INFO L225 Difference]: With dead ends: 324 [2019-12-08 16:28:53,320 INFO L226 Difference]: Without dead ends: 324 [2019-12-08 16:28:53,320 INFO L631 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-12-08 16:28:53,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-12-08 16:28:53,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 275. [2019-12-08 16:28:53,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-12-08 16:28:53,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 292 transitions. [2019-12-08 16:28:53,328 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 292 transitions. Word has length 36 [2019-12-08 16:28:53,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:28:53,329 INFO L462 AbstractCegarLoop]: Abstraction has 275 states and 292 transitions. [2019-12-08 16:28:53,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-08 16:28:53,329 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 292 transitions. [2019-12-08 16:28:53,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-08 16:28:53,330 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:28:53,330 INFO L411 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-12-08 16:28:53,330 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-12-08 16:28:53,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:28:53,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1511282514, now seen corresponding path program 1 times [2019-12-08 16:28:53,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 16:28:53,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701250543] [2019-12-08 16:28:53,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 16:28:53,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:53,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:53,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:28:53,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701250543] [2019-12-08 16:28:53,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:28:53,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-08 16:28:53,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164863910] [2019-12-08 16:28:53,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-08 16:28:53,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 16:28:53,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-08 16:28:53,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-08 16:28:53,474 INFO L87 Difference]: Start difference. First operand 275 states and 292 transitions. Second operand 11 states. [2019-12-08 16:28:55,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:28:55,091 INFO L93 Difference]: Finished difference Result 338 states and 362 transitions. [2019-12-08 16:28:55,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-08 16:28:55,092 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2019-12-08 16:28:55,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:28:55,095 INFO L225 Difference]: With dead ends: 338 [2019-12-08 16:28:55,096 INFO L226 Difference]: Without dead ends: 338 [2019-12-08 16:28:55,096 INFO L631 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-12-08 16:28:55,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-12-08 16:28:55,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 275. [2019-12-08 16:28:55,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-12-08 16:28:55,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 291 transitions. [2019-12-08 16:28:55,105 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 291 transitions. Word has length 36 [2019-12-08 16:28:55,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:28:55,105 INFO L462 AbstractCegarLoop]: Abstraction has 275 states and 291 transitions. [2019-12-08 16:28:55,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-08 16:28:55,105 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 291 transitions. [2019-12-08 16:28:55,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-08 16:28:55,106 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:28:55,106 INFO L411 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-12-08 16:28:55,107 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-12-08 16:28:55,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:28:55,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1511282513, now seen corresponding path program 1 times [2019-12-08 16:28:55,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 16:28:55,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207965360] [2019-12-08 16:28:55,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 16:28:55,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:55,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:55,256 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:28:55,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207965360] [2019-12-08 16:28:55,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:28:55,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-08 16:28:55,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571005627] [2019-12-08 16:28:55,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-08 16:28:55,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 16:28:55,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-08 16:28:55,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-12-08 16:28:55,258 INFO L87 Difference]: Start difference. First operand 275 states and 291 transitions. Second operand 9 states. [2019-12-08 16:28:56,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:28:56,723 INFO L93 Difference]: Finished difference Result 322 states and 342 transitions. [2019-12-08 16:28:56,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-08 16:28:56,726 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2019-12-08 16:28:56,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:28:56,728 INFO L225 Difference]: With dead ends: 322 [2019-12-08 16:28:56,728 INFO L226 Difference]: Without dead ends: 322 [2019-12-08 16:28:56,729 INFO L631 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-12-08 16:28:56,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-12-08 16:28:56,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 275. [2019-12-08 16:28:56,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-12-08 16:28:56,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 290 transitions. [2019-12-08 16:28:56,741 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 290 transitions. Word has length 36 [2019-12-08 16:28:56,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:28:56,741 INFO L462 AbstractCegarLoop]: Abstraction has 275 states and 290 transitions. [2019-12-08 16:28:56,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-08 16:28:56,742 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 290 transitions. [2019-12-08 16:28:56,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-08 16:28:56,747 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:28:56,748 INFO L411 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-12-08 16:28:56,748 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-12-08 16:28:56,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:28:56,749 INFO L82 PathProgramCache]: Analyzing trace with hash 801871937, now seen corresponding path program 1 times [2019-12-08 16:28:56,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 16:28:56,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684302802] [2019-12-08 16:28:56,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 16:28:56,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:56,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:56,963 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:28:56,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684302802] [2019-12-08 16:28:56,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:28:56,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-08 16:28:56,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35286268] [2019-12-08 16:28:56,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-08 16:28:56,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 16:28:56,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-08 16:28:56,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-12-08 16:28:56,965 INFO L87 Difference]: Start difference. First operand 275 states and 290 transitions. Second operand 13 states. [2019-12-08 16:28:58,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:28:58,708 INFO L93 Difference]: Finished difference Result 276 states and 294 transitions. [2019-12-08 16:28:58,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-08 16:28:58,709 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 41 [2019-12-08 16:28:58,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:28:58,712 INFO L225 Difference]: With dead ends: 276 [2019-12-08 16:28:58,712 INFO L226 Difference]: Without dead ends: 265 [2019-12-08 16:28:58,713 INFO L631 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-12-08 16:28:58,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-12-08 16:28:58,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 223. [2019-12-08 16:28:58,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-12-08 16:28:58,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 236 transitions. [2019-12-08 16:28:58,720 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 236 transitions. Word has length 41 [2019-12-08 16:28:58,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:28:58,720 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 236 transitions. [2019-12-08 16:28:58,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-08 16:28:58,720 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 236 transitions. [2019-12-08 16:28:58,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-08 16:28:58,721 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:28:58,721 INFO L411 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-12-08 16:28:58,722 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-12-08 16:28:58,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:28:58,722 INFO L82 PathProgramCache]: Analyzing trace with hash 257285329, now seen corresponding path program 1 times [2019-12-08 16:28:58,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 16:28:58,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403451791] [2019-12-08 16:28:58,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 16:28:58,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:58,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:58,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:58,792 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:28:58,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403451791] [2019-12-08 16:28:58,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:28:58,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-08 16:28:58,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512314191] [2019-12-08 16:28:58,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-08 16:28:58,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 16:28:58,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-08 16:28:58,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-08 16:28:58,795 INFO L87 Difference]: Start difference. First operand 223 states and 236 transitions. Second operand 7 states. [2019-12-08 16:28:59,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:28:59,690 INFO L93 Difference]: Finished difference Result 266 states and 287 transitions. [2019-12-08 16:28:59,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-08 16:28:59,691 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2019-12-08 16:28:59,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:28:59,694 INFO L225 Difference]: With dead ends: 266 [2019-12-08 16:28:59,694 INFO L226 Difference]: Without dead ends: 266 [2019-12-08 16:28:59,694 INFO L631 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-12-08 16:28:59,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-12-08 16:28:59,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 223. [2019-12-08 16:28:59,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-12-08 16:28:59,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 238 transitions. [2019-12-08 16:28:59,701 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 238 transitions. Word has length 46 [2019-12-08 16:28:59,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:28:59,701 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 238 transitions. [2019-12-08 16:28:59,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-08 16:28:59,701 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 238 transitions. [2019-12-08 16:28:59,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-08 16:28:59,702 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:28:59,702 INFO L411 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-12-08 16:28:59,703 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-12-08 16:28:59,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:28:59,703 INFO L82 PathProgramCache]: Analyzing trace with hash 257285330, now seen corresponding path program 1 times [2019-12-08 16:28:59,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 16:28:59,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014859260] [2019-12-08 16:28:59,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 16:28:59,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:59,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:59,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:59,804 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:28:59,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014859260] [2019-12-08 16:28:59,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:28:59,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-08 16:28:59,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812404754] [2019-12-08 16:28:59,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-08 16:28:59,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 16:28:59,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-08 16:28:59,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-08 16:28:59,806 INFO L87 Difference]: Start difference. First operand 223 states and 238 transitions. Second operand 7 states. [2019-12-08 16:29:00,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:29:00,668 INFO L93 Difference]: Finished difference Result 281 states and 301 transitions. [2019-12-08 16:29:00,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-08 16:29:00,669 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2019-12-08 16:29:00,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:29:00,671 INFO L225 Difference]: With dead ends: 281 [2019-12-08 16:29:00,671 INFO L226 Difference]: Without dead ends: 281 [2019-12-08 16:29:00,672 INFO L631 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-12-08 16:29:00,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-12-08 16:29:00,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 242. [2019-12-08 16:29:00,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-12-08 16:29:00,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 262 transitions. [2019-12-08 16:29:00,680 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 262 transitions. Word has length 46 [2019-12-08 16:29:00,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:29:00,681 INFO L462 AbstractCegarLoop]: Abstraction has 242 states and 262 transitions. [2019-12-08 16:29:00,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-08 16:29:00,681 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 262 transitions. [2019-12-08 16:29:00,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-08 16:29:00,681 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:29:00,682 INFO L411 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-12-08 16:29:00,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-12-08 16:29:00,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:29:00,682 INFO L82 PathProgramCache]: Analyzing trace with hash -679135460, now seen corresponding path program 1 times [2019-12-08 16:29:00,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 16:29:00,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542184654] [2019-12-08 16:29:00,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 16:29:00,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:29:00,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:29:00,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:29:00,745 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-08 16:29:00,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542184654] [2019-12-08 16:29:00,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:29:00,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-08 16:29:00,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123622802] [2019-12-08 16:29:00,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-08 16:29:00,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 16:29:00,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-08 16:29:00,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-08 16:29:00,748 INFO L87 Difference]: Start difference. First operand 242 states and 262 transitions. Second operand 6 states. [2019-12-08 16:29:01,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:29:01,354 INFO L93 Difference]: Finished difference Result 248 states and 267 transitions. [2019-12-08 16:29:01,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-08 16:29:01,354 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-12-08 16:29:01,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:29:01,356 INFO L225 Difference]: With dead ends: 248 [2019-12-08 16:29:01,357 INFO L226 Difference]: Without dead ends: 248 [2019-12-08 16:29:01,359 INFO L631 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-12-08 16:29:01,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-12-08 16:29:01,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 239. [2019-12-08 16:29:01,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-12-08 16:29:01,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 259 transitions. [2019-12-08 16:29:01,372 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 259 transitions. Word has length 47 [2019-12-08 16:29:01,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:29:01,372 INFO L462 AbstractCegarLoop]: Abstraction has 239 states and 259 transitions. [2019-12-08 16:29:01,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-08 16:29:01,373 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 259 transitions. [2019-12-08 16:29:01,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-08 16:29:01,376 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:29:01,376 INFO L411 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-12-08 16:29:01,377 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-12-08 16:29:01,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:29:01,377 INFO L82 PathProgramCache]: Analyzing trace with hash -679135459, now seen corresponding path program 1 times [2019-12-08 16:29:01,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 16:29:01,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225772920] [2019-12-08 16:29:01,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 16:29:01,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:29:01,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:29:01,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:29:01,509 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:29:01,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225772920] [2019-12-08 16:29:01,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:29:01,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-08 16:29:01,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936027253] [2019-12-08 16:29:01,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-08 16:29:01,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 16:29:01,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-08 16:29:01,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-08 16:29:01,518 INFO L87 Difference]: Start difference. First operand 239 states and 259 transitions. Second operand 7 states. [2019-12-08 16:29:02,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:29:02,382 INFO L93 Difference]: Finished difference Result 300 states and 319 transitions. [2019-12-08 16:29:02,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-08 16:29:02,388 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-12-08 16:29:02,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:29:02,391 INFO L225 Difference]: With dead ends: 300 [2019-12-08 16:29:02,391 INFO L226 Difference]: Without dead ends: 300 [2019-12-08 16:29:02,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-08 16:29:02,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-12-08 16:29:02,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 260. [2019-12-08 16:29:02,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-12-08 16:29:02,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 286 transitions. [2019-12-08 16:29:02,400 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 286 transitions. Word has length 47 [2019-12-08 16:29:02,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:29:02,401 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 286 transitions. [2019-12-08 16:29:02,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-08 16:29:02,401 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 286 transitions. [2019-12-08 16:29:02,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-08 16:29:02,402 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:29:02,402 INFO L411 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-12-08 16:29:02,402 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-12-08 16:29:02,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:29:02,403 INFO L82 PathProgramCache]: Analyzing trace with hash -2077484617, now seen corresponding path program 1 times [2019-12-08 16:29:02,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 16:29:02,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132743922] [2019-12-08 16:29:02,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 16:29:02,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:29:02,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:29:02,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:29:02,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:29:02,505 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:29:02,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132743922] [2019-12-08 16:29:02,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:29:02,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-08 16:29:02,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289064053] [2019-12-08 16:29:02,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-08 16:29:02,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 16:29:02,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-08 16:29:02,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-08 16:29:02,507 INFO L87 Difference]: Start difference. First operand 260 states and 286 transitions. Second operand 8 states. [2019-12-08 16:29:03,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:29:03,419 INFO L93 Difference]: Finished difference Result 310 states and 334 transitions. [2019-12-08 16:29:03,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-08 16:29:03,420 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2019-12-08 16:29:03,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:29:03,422 INFO L225 Difference]: With dead ends: 310 [2019-12-08 16:29:03,423 INFO L226 Difference]: Without dead ends: 307 [2019-12-08 16:29:03,423 INFO L631 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-12-08 16:29:03,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-12-08 16:29:03,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 260. [2019-12-08 16:29:03,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-12-08 16:29:03,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 285 transitions. [2019-12-08 16:29:03,433 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 285 transitions. Word has length 50 [2019-12-08 16:29:03,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:29:03,434 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 285 transitions. [2019-12-08 16:29:03,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-08 16:29:03,434 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 285 transitions. [2019-12-08 16:29:03,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-08 16:29:03,435 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:29:03,435 INFO L411 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-12-08 16:29:03,436 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-12-08 16:29:03,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:29:03,439 INFO L82 PathProgramCache]: Analyzing trace with hash -2056453987, now seen corresponding path program 1 times [2019-12-08 16:29:03,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 16:29:03,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013462225] [2019-12-08 16:29:03,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 16:29:03,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:29:03,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:29:03,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:29:03,690 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:29:03,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013462225] [2019-12-08 16:29:03,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:29:03,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-08 16:29:03,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091320297] [2019-12-08 16:29:03,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-08 16:29:03,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 16:29:03,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-08 16:29:03,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-12-08 16:29:03,693 INFO L87 Difference]: Start difference. First operand 260 states and 285 transitions. Second operand 13 states. [2019-12-08 16:29:04,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:29:04,205 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-12-08 16:29:04,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-08 16:29:04,210 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 50 [2019-12-08 16:29:04,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:29:04,210 INFO L225 Difference]: With dead ends: 44 [2019-12-08 16:29:04,210 INFO L226 Difference]: Without dead ends: 0 [2019-12-08 16:29:04,211 INFO L631 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-12-08 16:29:04,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-08 16:29:04,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-08 16:29:04,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-08 16:29:04,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-08 16:29:04,212 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2019-12-08 16:29:04,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:29:04,212 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-08 16:29:04,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-08 16:29:04,212 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-08 16:29:04,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-08 16:29:04,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 04:29:04 BoogieIcfgContainer [2019-12-08 16:29:04,221 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-08 16:29:04,221 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-08 16:29:04,221 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-08 16:29:04,222 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-08 16:29:04,222 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 04:28:42" (3/4) ... [2019-12-08 16:29:04,227 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-08 16:29:04,237 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fail [2019-12-08 16:29:04,237 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-12-08 16:29:04,238 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure merge_pair [2019-12-08 16:29:04,238 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure merge_single_node [2019-12-08 16:29:04,238 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-12-08 16:29:04,238 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure seq_sort_core [2019-12-08 16:29:04,239 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-12-08 16:29:04,239 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure inspect_before [2019-12-08 16:29:04,239 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-12-08 16:29:04,239 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure inspect_after [2019-12-08 16:29:04,265 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2019-12-08 16:29:04,266 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-12-08 16:29:04,266 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-12-08 16:29:04,267 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-08 16:29:04,362 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-12-08 16:29:04,362 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-08 16:29:04,365 INFO L168 Benchmark]: Toolchain (without parser) took 23754.73 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 470.8 MB). Free memory was 951.0 MB in the beginning and 1.4 GB in the end (delta: -426.8 MB). Peak memory consumption was 44.0 MB. Max. memory is 11.5 GB. [2019-12-08 16:29:04,365 INFO L168 Benchmark]: CDTParser took 1.45 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-12-08 16:29:04,366 INFO L168 Benchmark]: CACSL2BoogieTranslator took 629.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -147.4 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2019-12-08 16:29:04,366 INFO L168 Benchmark]: Boogie Preprocessor took 92.93 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-12-08 16:29:04,367 INFO L168 Benchmark]: RCFGBuilder took 1158.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 98.1 MB). Peak memory consumption was 98.1 MB. Max. memory is 11.5 GB. [2019-12-08 16:29:04,367 INFO L168 Benchmark]: TraceAbstraction took 21725.69 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 341.8 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -390.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-08 16:29:04,367 INFO L168 Benchmark]: Witness Printer took 141.01 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.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2019-12-08 16:29:04,369 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.45 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 629.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -147.4 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 92.93 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 1158.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 98.1 MB). Peak memory consumption was 98.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 21725.69 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 341.8 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -390.5 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 141.01 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.1 MB). Peak memory consumption was 13.1 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.6s, OverallIterations: 20, TraceHistogramMax: 2, AutomataDifference: 18.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3613 SDtfs, 4687 SDslu, 5481 SDs, 0 SdLazy, 16049 SolverSat, 472 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 258 GetRequests, 78 SyntacticMatches, 8 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 2.2s 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...