./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 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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 54165abed718b8d39f88748583b76365fb540324 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup) --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 04:26:11,012 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 04:26:11,017 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 04:26:11,045 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 04:26:11,046 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 04:26:11,048 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 04:26:11,049 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 04:26:11,052 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 04:26:11,054 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 04:26:11,057 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 04:26:11,058 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 04:26:11,060 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 04:26:11,060 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 04:26:11,062 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 04:26:11,085 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 04:26:11,086 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 04:26:11,086 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 04:26:11,087 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 04:26:11,088 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 04:26:11,090 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 04:26:11,092 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 04:26:11,093 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 04:26:11,094 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 04:26:11,095 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 04:26:11,098 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 04:26:11,100 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 04:26:11,100 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 04:26:11,101 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 04:26:11,102 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 04:26:11,103 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 04:26:11,103 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 04:26:11,103 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 04:26:11,104 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 04:26:11,105 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 04:26:11,106 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 04:26:11,106 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 04:26:11,107 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 04:26:11,107 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 04:26:11,107 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 04:26:11,108 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 04:26:11,109 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 04:26:11,112 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2021-08-27 04:26:11,137 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 04:26:11,137 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 04:26:11,138 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 04:26:11,138 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 04:26:11,141 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 04:26:11,141 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 04:26:11,141 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 04:26:11,142 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 04:26:11,142 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 04:26:11,142 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 04:26:11,143 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 04:26:11,143 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 04:26:11,143 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 04:26:11,143 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-08-27 04:26:11,143 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-08-27 04:26:11,143 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-27 04:26:11,144 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-08-27 04:26:11,144 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 04:26:11,144 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 04:26:11,144 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 04:26:11,144 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 04:26:11,144 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-27 04:26:11,144 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 04:26:11,145 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 04:26:11,145 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-27 04:26:11,145 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 04:26:11,145 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-27 04:26:11,145 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 04:26:11,145 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 54165abed718b8d39f88748583b76365fb540324 [2021-08-27 04:26:11,409 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 04:26:11,431 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 04:26:11,433 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 04:26:11,434 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 04:26:11,434 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 04:26:11,435 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/merge_sort-1.i [2021-08-27 04:26:11,496 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6ba176f8/2ddf77d5b5c94a41ae20a3d8080be3c1/FLAGd761ba63e [2021-08-27 04:26:11,888 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 04:26:11,889 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/merge_sort-1.i [2021-08-27 04:26:11,898 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6ba176f8/2ddf77d5b5c94a41ae20a3d8080be3c1/FLAGd761ba63e [2021-08-27 04:26:12,263 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6ba176f8/2ddf77d5b5c94a41ae20a3d8080be3c1 [2021-08-27 04:26:12,264 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 04:26:12,265 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-27 04:26:12,267 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 04:26:12,267 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 04:26:12,269 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 04:26:12,270 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 04:26:12" (1/1) ... [2021-08-27 04:26:12,270 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c5b1094 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:12, skipping insertion in model container [2021-08-27 04:26:12,270 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 04:26:12" (1/1) ... [2021-08-27 04:26:12,275 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 04:26:12,301 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 04:26:12,516 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/merge_sort-1.i[22632,22645] [2021-08-27 04:26:12,554 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 04:26:12,561 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 04:26:12,591 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/merge_sort-1.i[22632,22645] [2021-08-27 04:26:12,614 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 04:26:12,636 INFO L208 MainTranslator]: Completed translation [2021-08-27 04:26:12,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:12 WrapperNode [2021-08-27 04:26:12,637 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 04:26:12,638 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 04:26:12,638 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 04:26:12,639 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 04:26:12,646 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:12" (1/1) ... [2021-08-27 04:26:12,647 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:12" (1/1) ... [2021-08-27 04:26:12,675 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:12" (1/1) ... [2021-08-27 04:26:12,681 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:12" (1/1) ... [2021-08-27 04:26:12,695 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:12" (1/1) ... [2021-08-27 04:26:12,705 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:12" (1/1) ... [2021-08-27 04:26:12,719 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:12" (1/1) ... [2021-08-27 04:26:12,723 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 04:26:12,724 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 04:26:12,724 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 04:26:12,724 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 04:26:12,725 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:12" (1/1) ... [2021-08-27 04:26:12,729 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 04:26:12,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 04:26:12,744 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-27 04:26:12,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-27 04:26:12,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-08-27 04:26:12,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 04:26:12,784 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-08-27 04:26:12,784 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2021-08-27 04:26:12,785 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2021-08-27 04:26:12,785 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2021-08-27 04:26:12,785 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2021-08-27 04:26:12,786 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_pair [2021-08-27 04:26:12,786 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_sort_core [2021-08-27 04:26:12,786 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_before [2021-08-27 04:26:12,786 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_after [2021-08-27 04:26:12,787 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-08-27 04:26:12,787 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-08-27 04:26:12,787 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-08-27 04:26:12,787 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-08-27 04:26:12,787 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-08-27 04:26:12,787 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-08-27 04:26:12,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 04:26:12,787 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2021-08-27 04:26:12,788 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2021-08-27 04:26:12,788 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-08-27 04:26:12,788 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-08-27 04:26:12,788 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-08-27 04:26:12,788 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-08-27 04:26:12,788 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-08-27 04:26:12,788 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-08-27 04:26:12,789 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-08-27 04:26:12,789 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-08-27 04:26:12,789 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-08-27 04:26:12,789 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-08-27 04:26:12,789 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-08-27 04:26:12,789 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-08-27 04:26:12,789 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-08-27 04:26:12,789 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-08-27 04:26:12,790 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-08-27 04:26:12,790 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-08-27 04:26:12,790 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-08-27 04:26:12,790 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-08-27 04:26:12,790 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-08-27 04:26:12,790 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-08-27 04:26:12,790 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-08-27 04:26:12,790 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-08-27 04:26:12,791 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-08-27 04:26:12,791 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-08-27 04:26:12,791 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-08-27 04:26:12,791 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-08-27 04:26:12,791 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-08-27 04:26:12,792 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-08-27 04:26:12,792 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-08-27 04:26:12,792 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-08-27 04:26:12,793 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-08-27 04:26:12,793 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-08-27 04:26:12,793 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-08-27 04:26:12,793 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-08-27 04:26:12,793 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-08-27 04:26:12,793 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-08-27 04:26:12,794 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-08-27 04:26:12,794 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-08-27 04:26:12,794 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-08-27 04:26:12,794 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-08-27 04:26:12,794 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-08-27 04:26:12,794 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-08-27 04:26:12,794 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-08-27 04:26:12,794 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-08-27 04:26:12,795 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-08-27 04:26:12,795 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-08-27 04:26:12,795 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-08-27 04:26:12,796 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-08-27 04:26:12,796 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-08-27 04:26:12,796 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-08-27 04:26:12,796 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-08-27 04:26:12,797 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-08-27 04:26:12,797 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-08-27 04:26:12,797 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-08-27 04:26:12,797 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2021-08-27 04:26:12,797 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-08-27 04:26:12,797 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-08-27 04:26:12,797 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-08-27 04:26:12,797 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-08-27 04:26:12,798 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-08-27 04:26:12,798 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-08-27 04:26:12,798 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-08-27 04:26:12,798 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-08-27 04:26:12,799 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-08-27 04:26:12,799 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-08-27 04:26:12,799 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-08-27 04:26:12,799 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-08-27 04:26:12,799 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-08-27 04:26:12,799 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-08-27 04:26:12,799 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-08-27 04:26:12,799 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-08-27 04:26:12,800 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-08-27 04:26:12,800 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-08-27 04:26:12,800 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-08-27 04:26:12,800 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-08-27 04:26:12,800 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-08-27 04:26:12,800 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-08-27 04:26:12,800 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-08-27 04:26:12,800 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-08-27 04:26:12,801 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-08-27 04:26:12,801 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-08-27 04:26:12,801 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-08-27 04:26:12,801 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-08-27 04:26:12,801 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-08-27 04:26:12,801 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-08-27 04:26:12,801 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-08-27 04:26:12,802 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-08-27 04:26:12,802 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-08-27 04:26:12,802 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-08-27 04:26:12,802 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-08-27 04:26:12,803 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-08-27 04:26:12,803 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-08-27 04:26:12,803 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-08-27 04:26:12,803 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-08-27 04:26:12,804 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-08-27 04:26:12,804 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-08-27 04:26:12,804 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-08-27 04:26:12,804 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-08-27 04:26:12,804 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-08-27 04:26:12,804 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-08-27 04:26:12,804 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2021-08-27 04:26:12,804 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2021-08-27 04:26:12,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-27 04:26:12,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-27 04:26:12,805 INFO L130 BoogieDeclarations]: Found specification of procedure merge_pair [2021-08-27 04:26:12,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-27 04:26:12,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 04:26:12,806 INFO L130 BoogieDeclarations]: Found specification of procedure seq_sort_core [2021-08-27 04:26:12,806 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_before [2021-08-27 04:26:12,808 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_after [2021-08-27 04:26:12,808 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-08-27 04:26:12,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-27 04:26:12,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-27 04:26:12,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-08-27 04:26:12,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 04:26:12,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 04:26:13,800 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 04:26:13,800 INFO L299 CfgBuilder]: Removed 33 assume(true) statements. [2021-08-27 04:26:13,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 04:26:13 BoogieIcfgContainer [2021-08-27 04:26:13,802 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 04:26:13,803 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-27 04:26:13,803 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-27 04:26:13,805 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-27 04:26:13,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 04:26:12" (1/3) ... [2021-08-27 04:26:13,806 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f9dd83e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 04:26:13, skipping insertion in model container [2021-08-27 04:26:13,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:12" (2/3) ... [2021-08-27 04:26:13,806 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f9dd83e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 04:26:13, skipping insertion in model container [2021-08-27 04:26:13,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 04:26:13" (3/3) ... [2021-08-27 04:26:13,807 INFO L111 eAbstractionObserver]: Analyzing ICFG merge_sort-1.i [2021-08-27 04:26:13,811 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-27 04:26:13,811 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 105 error locations. [2021-08-27 04:26:13,837 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-27 04:26:13,841 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-27 04:26:13,842 INFO L340 AbstractCegarLoop]: Starting to check reachability of 105 error locations. [2021-08-27 04:26:13,854 INFO L276 IsEmpty]: Start isEmpty. Operand has 279 states, 144 states have (on average 2.1527777777777777) internal successors, (310), 265 states have internal predecessors, (310), 21 states have call successors, (21), 8 states have call predecessors, (21), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2021-08-27 04:26:13,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-08-27 04:26:13,859 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:13,860 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:13,860 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr20ENSURES_VIOLATIONMEMORY_LEAK === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-08-27 04:26:13,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:13,864 INFO L82 PathProgramCache]: Analyzing trace with hash -774541734, now seen corresponding path program 1 times [2021-08-27 04:26:13,869 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:13,870 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473848539] [2021-08-27 04:26:13,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:13,870 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:13,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:14,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:14,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:14,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:14,015 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:14,015 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473848539] [2021-08-27 04:26:14,016 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473848539] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:14,016 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:14,016 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 04:26:14,017 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934254978] [2021-08-27 04:26:14,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 04:26:14,025 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:14,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 04:26:14,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 04:26:14,035 INFO L87 Difference]: Start difference. First operand has 279 states, 144 states have (on average 2.1527777777777777) internal successors, (310), 265 states have internal predecessors, (310), 21 states have call successors, (21), 8 states have call predecessors, (21), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:14,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:14,549 INFO L93 Difference]: Finished difference Result 320 states and 355 transitions. [2021-08-27 04:26:14,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 04:26:14,550 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2021-08-27 04:26:14,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:14,562 INFO L225 Difference]: With dead ends: 320 [2021-08-27 04:26:14,562 INFO L226 Difference]: Without dead ends: 315 [2021-08-27 04:26:14,563 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 25.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 04:26:14,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2021-08-27 04:26:14,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 277. [2021-08-27 04:26:14,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 145 states have (on average 1.896551724137931) internal successors, (275), 264 states have internal predecessors, (275), 21 states have call successors, (21), 8 states have call predecessors, (21), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2021-08-27 04:26:14,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 303 transitions. [2021-08-27 04:26:14,607 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 303 transitions. Word has length 9 [2021-08-27 04:26:14,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:14,607 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 303 transitions. [2021-08-27 04:26:14,607 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:14,607 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 303 transitions. [2021-08-27 04:26:14,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-27 04:26:14,608 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:14,608 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:14,608 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-27 04:26:14,608 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0REQUIRES_VIOLATION === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-08-27 04:26:14,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:14,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1757963271, now seen corresponding path program 1 times [2021-08-27 04:26:14,609 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:14,609 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634663137] [2021-08-27 04:26:14,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:14,609 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:14,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:14,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:14,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:14,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:14,721 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:14,722 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634663137] [2021-08-27 04:26:14,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634663137] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:14,722 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:14,722 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 04:26:14,722 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992002273] [2021-08-27 04:26:14,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 04:26:14,723 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:14,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 04:26:14,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:14,726 INFO L87 Difference]: Start difference. First operand 277 states and 303 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:15,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:15,229 INFO L93 Difference]: Finished difference Result 332 states and 369 transitions. [2021-08-27 04:26:15,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 04:26:15,230 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2021-08-27 04:26:15,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:15,231 INFO L225 Difference]: With dead ends: 332 [2021-08-27 04:26:15,231 INFO L226 Difference]: Without dead ends: 332 [2021-08-27 04:26:15,231 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 31.4ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:15,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2021-08-27 04:26:15,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 275. [2021-08-27 04:26:15,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 145 states have (on average 1.8827586206896552) internal successors, (273), 262 states have internal predecessors, (273), 21 states have call successors, (21), 8 states have call predecessors, (21), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2021-08-27 04:26:15,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 301 transitions. [2021-08-27 04:26:15,257 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 301 transitions. Word has length 10 [2021-08-27 04:26:15,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:15,257 INFO L470 AbstractCegarLoop]: Abstraction has 275 states and 301 transitions. [2021-08-27 04:26:15,258 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:15,258 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 301 transitions. [2021-08-27 04:26:15,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-27 04:26:15,258 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:15,258 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:15,258 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-27 04:26:15,259 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr1REQUIRES_VIOLATION === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-08-27 04:26:15,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:15,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1757963272, now seen corresponding path program 1 times [2021-08-27 04:26:15,259 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:15,259 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997460847] [2021-08-27 04:26:15,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:15,260 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:15,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:15,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:15,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:15,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:15,331 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:15,332 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997460847] [2021-08-27 04:26:15,332 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997460847] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:15,332 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:15,332 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 04:26:15,332 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159444757] [2021-08-27 04:26:15,332 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 04:26:15,333 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:15,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 04:26:15,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:15,333 INFO L87 Difference]: Start difference. First operand 275 states and 301 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:15,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:15,790 INFO L93 Difference]: Finished difference Result 342 states and 380 transitions. [2021-08-27 04:26:15,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 04:26:15,790 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2021-08-27 04:26:15,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:15,791 INFO L225 Difference]: With dead ends: 342 [2021-08-27 04:26:15,791 INFO L226 Difference]: Without dead ends: 342 [2021-08-27 04:26:15,792 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.0ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:15,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2021-08-27 04:26:15,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 273. [2021-08-27 04:26:15,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 145 states have (on average 1.8689655172413793) internal successors, (271), 260 states have internal predecessors, (271), 21 states have call successors, (21), 8 states have call predecessors, (21), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2021-08-27 04:26:15,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 299 transitions. [2021-08-27 04:26:15,797 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 299 transitions. Word has length 10 [2021-08-27 04:26:15,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:15,798 INFO L470 AbstractCegarLoop]: Abstraction has 273 states and 299 transitions. [2021-08-27 04:26:15,798 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:15,798 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 299 transitions. [2021-08-27 04:26:15,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-08-27 04:26:15,798 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:15,798 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:15,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-27 04:26:15,799 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-08-27 04:26:15,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:15,799 INFO L82 PathProgramCache]: Analyzing trace with hash 389021379, now seen corresponding path program 1 times [2021-08-27 04:26:15,799 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:15,800 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403693251] [2021-08-27 04:26:15,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:15,800 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:15,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:15,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:15,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:15,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:15,842 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:15,842 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403693251] [2021-08-27 04:26:15,842 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403693251] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:15,843 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:15,843 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 04:26:15,843 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782538529] [2021-08-27 04:26:15,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 04:26:15,843 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:15,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 04:26:15,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:15,844 INFO L87 Difference]: Start difference. First operand 273 states and 299 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:16,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:16,224 INFO L93 Difference]: Finished difference Result 308 states and 335 transitions. [2021-08-27 04:26:16,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 04:26:16,225 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2021-08-27 04:26:16,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:16,226 INFO L225 Difference]: With dead ends: 308 [2021-08-27 04:26:16,226 INFO L226 Difference]: Without dead ends: 307 [2021-08-27 04:26:16,226 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 32.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 04:26:16,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2021-08-27 04:26:16,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 272. [2021-08-27 04:26:16,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 144 states have (on average 1.8680555555555556) internal successors, (269), 259 states have internal predecessors, (269), 21 states have call successors, (21), 8 states have call predecessors, (21), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2021-08-27 04:26:16,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 297 transitions. [2021-08-27 04:26:16,231 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 297 transitions. Word has length 14 [2021-08-27 04:26:16,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:16,231 INFO L470 AbstractCegarLoop]: Abstraction has 272 states and 297 transitions. [2021-08-27 04:26:16,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:16,232 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 297 transitions. [2021-08-27 04:26:16,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-27 04:26:16,232 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:16,232 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:16,232 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-27 04:26:16,233 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr4REQUIRES_VIOLATION === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-08-27 04:26:16,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:16,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1684555217, now seen corresponding path program 1 times [2021-08-27 04:26:16,233 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:16,233 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622251734] [2021-08-27 04:26:16,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:16,234 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:16,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:16,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:16,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:16,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:16,277 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:16,277 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622251734] [2021-08-27 04:26:16,277 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622251734] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:16,277 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:16,277 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 04:26:16,277 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337885038] [2021-08-27 04:26:16,278 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 04:26:16,278 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:16,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 04:26:16,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:16,278 INFO L87 Difference]: Start difference. First operand 272 states and 297 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:16,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:16,700 INFO L93 Difference]: Finished difference Result 314 states and 345 transitions. [2021-08-27 04:26:16,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 04:26:16,700 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2021-08-27 04:26:16,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:16,701 INFO L225 Difference]: With dead ends: 314 [2021-08-27 04:26:16,701 INFO L226 Difference]: Without dead ends: 314 [2021-08-27 04:26:16,702 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.8ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:16,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2021-08-27 04:26:16,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 270. [2021-08-27 04:26:16,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 144 states have (on average 1.8541666666666667) internal successors, (267), 257 states have internal predecessors, (267), 21 states have call successors, (21), 8 states have call predecessors, (21), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2021-08-27 04:26:16,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 295 transitions. [2021-08-27 04:26:16,718 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 295 transitions. Word has length 15 [2021-08-27 04:26:16,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:16,718 INFO L470 AbstractCegarLoop]: Abstraction has 270 states and 295 transitions. [2021-08-27 04:26:16,718 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:16,718 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 295 transitions. [2021-08-27 04:26:16,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-27 04:26:16,719 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:16,719 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:16,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-27 04:26:16,719 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr5REQUIRES_VIOLATION === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-08-27 04:26:16,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:16,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1684555216, now seen corresponding path program 1 times [2021-08-27 04:26:16,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:16,720 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566775930] [2021-08-27 04:26:16,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:16,720 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:16,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:16,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:16,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:16,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:16,761 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:16,761 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566775930] [2021-08-27 04:26:16,762 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566775930] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:16,762 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:16,762 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 04:26:16,762 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306780413] [2021-08-27 04:26:16,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 04:26:16,763 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:16,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 04:26:16,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:16,763 INFO L87 Difference]: Start difference. First operand 270 states and 295 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:17,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:17,182 INFO L93 Difference]: Finished difference Result 324 states and 356 transitions. [2021-08-27 04:26:17,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 04:26:17,183 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2021-08-27 04:26:17,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:17,184 INFO L225 Difference]: With dead ends: 324 [2021-08-27 04:26:17,184 INFO L226 Difference]: Without dead ends: 324 [2021-08-27 04:26:17,184 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.1ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:17,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2021-08-27 04:26:17,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 268. [2021-08-27 04:26:17,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 144 states have (on average 1.8402777777777777) internal successors, (265), 255 states have internal predecessors, (265), 21 states have call successors, (21), 8 states have call predecessors, (21), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2021-08-27 04:26:17,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 293 transitions. [2021-08-27 04:26:17,189 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 293 transitions. Word has length 15 [2021-08-27 04:26:17,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:17,190 INFO L470 AbstractCegarLoop]: Abstraction has 268 states and 293 transitions. [2021-08-27 04:26:17,190 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:17,190 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 293 transitions. [2021-08-27 04:26:17,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-27 04:26:17,190 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:17,191 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:17,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-27 04:26:17,191 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr20ENSURES_VIOLATIONMEMORY_LEAK === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-08-27 04:26:17,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:17,191 INFO L82 PathProgramCache]: Analyzing trace with hash 663488011, now seen corresponding path program 1 times [2021-08-27 04:26:17,191 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:17,192 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524879257] [2021-08-27 04:26:17,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:17,192 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:17,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:17,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:17,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:17,234 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:17,234 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:17,234 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524879257] [2021-08-27 04:26:17,235 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524879257] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:17,235 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:17,235 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 04:26:17,235 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826141246] [2021-08-27 04:26:17,235 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 04:26:17,235 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:17,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 04:26:17,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 04:26:17,236 INFO L87 Difference]: Start difference. First operand 268 states and 293 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:17,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:17,691 INFO L93 Difference]: Finished difference Result 327 states and 359 transitions. [2021-08-27 04:26:17,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 04:26:17,691 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2021-08-27 04:26:17,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:17,693 INFO L225 Difference]: With dead ends: 327 [2021-08-27 04:26:17,693 INFO L226 Difference]: Without dead ends: 327 [2021-08-27 04:26:17,693 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.9ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-27 04:26:17,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2021-08-27 04:26:17,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 268. [2021-08-27 04:26:17,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 144 states have (on average 1.8333333333333333) internal successors, (264), 255 states have internal predecessors, (264), 21 states have call successors, (21), 8 states have call predecessors, (21), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2021-08-27 04:26:17,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 292 transitions. [2021-08-27 04:26:17,698 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 292 transitions. Word has length 21 [2021-08-27 04:26:17,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:17,698 INFO L470 AbstractCegarLoop]: Abstraction has 268 states and 292 transitions. [2021-08-27 04:26:17,698 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:17,698 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 292 transitions. [2021-08-27 04:26:17,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-27 04:26:17,699 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:17,699 INFO L512 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] [2021-08-27 04:26:17,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-27 04:26:17,699 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-08-27 04:26:17,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:17,699 INFO L82 PathProgramCache]: Analyzing trace with hash -584553579, now seen corresponding path program 1 times [2021-08-27 04:26:17,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:17,700 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614585984] [2021-08-27 04:26:17,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:17,700 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:17,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:17,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:17,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:17,756 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:17,756 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:17,756 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614585984] [2021-08-27 04:26:17,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614585984] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:17,757 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:17,757 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 04:26:17,757 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333594328] [2021-08-27 04:26:17,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 04:26:17,757 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:17,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 04:26:17,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-27 04:26:17,758 INFO L87 Difference]: Start difference. First operand 268 states and 292 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:18,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:18,405 INFO L93 Difference]: Finished difference Result 382 states and 420 transitions. [2021-08-27 04:26:18,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 04:26:18,406 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2021-08-27 04:26:18,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:18,407 INFO L225 Difference]: With dead ends: 382 [2021-08-27 04:26:18,407 INFO L226 Difference]: Without dead ends: 382 [2021-08-27 04:26:18,408 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 59.2ms TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-08-27 04:26:18,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2021-08-27 04:26:18,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 271. [2021-08-27 04:26:18,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 148 states have (on average 1.8243243243243243) internal successors, (270), 258 states have internal predecessors, (270), 20 states have call successors, (20), 8 states have call predecessors, (20), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2021-08-27 04:26:18,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 297 transitions. [2021-08-27 04:26:18,412 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 297 transitions. Word has length 25 [2021-08-27 04:26:18,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:18,413 INFO L470 AbstractCegarLoop]: Abstraction has 271 states and 297 transitions. [2021-08-27 04:26:18,413 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:18,413 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 297 transitions. [2021-08-27 04:26:18,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-27 04:26:18,413 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:18,413 INFO L512 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] [2021-08-27 04:26:18,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-27 04:26:18,413 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting inspect_beforeErr0REQUIRES_VIOLATION === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-08-27 04:26:18,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:18,414 INFO L82 PathProgramCache]: Analyzing trace with hash -584567887, now seen corresponding path program 1 times [2021-08-27 04:26:18,414 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:18,414 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812883942] [2021-08-27 04:26:18,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:18,414 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:18,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:18,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:18,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:18,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:18,486 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:18,486 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812883942] [2021-08-27 04:26:18,486 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812883942] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:18,487 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:18,487 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 04:26:18,487 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415969244] [2021-08-27 04:26:18,487 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 04:26:18,487 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:18,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 04:26:18,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-27 04:26:18,487 INFO L87 Difference]: Start difference. First operand 271 states and 297 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:19,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:19,117 INFO L93 Difference]: Finished difference Result 310 states and 341 transitions. [2021-08-27 04:26:19,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 04:26:19,117 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2021-08-27 04:26:19,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:19,124 INFO L225 Difference]: With dead ends: 310 [2021-08-27 04:26:19,124 INFO L226 Difference]: Without dead ends: 310 [2021-08-27 04:26:19,124 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 56.7ms TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-08-27 04:26:19,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2021-08-27 04:26:19,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 263. [2021-08-27 04:26:19,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 149 states have (on average 1.7583892617449663) internal successors, (262), 249 states have internal predecessors, (262), 20 states have call successors, (20), 8 states have call predecessors, (20), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2021-08-27 04:26:19,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 289 transitions. [2021-08-27 04:26:19,132 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 289 transitions. Word has length 25 [2021-08-27 04:26:19,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:19,134 INFO L470 AbstractCegarLoop]: Abstraction has 263 states and 289 transitions. [2021-08-27 04:26:19,135 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:19,135 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 289 transitions. [2021-08-27 04:26:19,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-27 04:26:19,135 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:19,135 INFO L512 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] [2021-08-27 04:26:19,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-27 04:26:19,135 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting inspect_beforeErr1REQUIRES_VIOLATION === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-08-27 04:26:19,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:19,137 INFO L82 PathProgramCache]: Analyzing trace with hash -584567886, now seen corresponding path program 1 times [2021-08-27 04:26:19,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:19,138 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886035289] [2021-08-27 04:26:19,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:19,138 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:19,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:19,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:19,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:19,231 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:19,231 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:19,231 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886035289] [2021-08-27 04:26:19,231 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886035289] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:19,232 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:19,232 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 04:26:19,232 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049754721] [2021-08-27 04:26:19,232 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 04:26:19,232 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:19,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 04:26:19,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-27 04:26:19,233 INFO L87 Difference]: Start difference. First operand 263 states and 289 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:19,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:19,945 INFO L93 Difference]: Finished difference Result 381 states and 422 transitions. [2021-08-27 04:26:19,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 04:26:19,945 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2021-08-27 04:26:19,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:19,947 INFO L225 Difference]: With dead ends: 381 [2021-08-27 04:26:19,947 INFO L226 Difference]: Without dead ends: 381 [2021-08-27 04:26:19,947 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 73.4ms TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-08-27 04:26:19,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2021-08-27 04:26:19,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 288. [2021-08-27 04:26:19,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 173 states have (on average 1.6878612716763006) internal successors, (292), 273 states have internal predecessors, (292), 21 states have call successors, (21), 8 states have call predecessors, (21), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2021-08-27 04:26:19,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 321 transitions. [2021-08-27 04:26:19,952 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 321 transitions. Word has length 25 [2021-08-27 04:26:19,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:19,953 INFO L470 AbstractCegarLoop]: Abstraction has 288 states and 321 transitions. [2021-08-27 04:26:19,953 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:19,953 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 321 transitions. [2021-08-27 04:26:19,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-08-27 04:26:19,953 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:19,953 INFO L512 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] [2021-08-27 04:26:19,954 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-27 04:26:19,954 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-08-27 04:26:19,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:19,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1204412220, now seen corresponding path program 1 times [2021-08-27 04:26:19,954 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:19,954 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220670700] [2021-08-27 04:26:19,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:19,955 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:19,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:20,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:20,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:20,021 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-27 04:26:20,021 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:20,021 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220670700] [2021-08-27 04:26:20,021 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220670700] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:20,021 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:20,021 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 04:26:20,022 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801414760] [2021-08-27 04:26:20,022 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 04:26:20,022 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:20,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 04:26:20,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 04:26:20,023 INFO L87 Difference]: Start difference. First operand 288 states and 321 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:20,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:20,555 INFO L93 Difference]: Finished difference Result 307 states and 341 transitions. [2021-08-27 04:26:20,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 04:26:20,555 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2021-08-27 04:26:20,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:20,556 INFO L225 Difference]: With dead ends: 307 [2021-08-27 04:26:20,556 INFO L226 Difference]: Without dead ends: 307 [2021-08-27 04:26:20,557 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 72.8ms TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-08-27 04:26:20,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2021-08-27 04:26:20,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 287. [2021-08-27 04:26:20,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 173 states have (on average 1.676300578034682) internal successors, (290), 272 states have internal predecessors, (290), 20 states have call successors, (20), 8 states have call predecessors, (20), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2021-08-27 04:26:20,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 318 transitions. [2021-08-27 04:26:20,561 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 318 transitions. Word has length 32 [2021-08-27 04:26:20,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:20,562 INFO L470 AbstractCegarLoop]: Abstraction has 287 states and 318 transitions. [2021-08-27 04:26:20,562 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:20,562 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 318 transitions. [2021-08-27 04:26:20,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-08-27 04:26:20,562 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:20,563 INFO L512 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] [2021-08-27 04:26:20,563 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-27 04:26:20,563 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-08-27 04:26:20,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:20,563 INFO L82 PathProgramCache]: Analyzing trace with hash 523995142, now seen corresponding path program 1 times [2021-08-27 04:26:20,564 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:20,564 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792853678] [2021-08-27 04:26:20,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:20,564 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:20,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:20,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:20,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:20,632 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-27 04:26:20,632 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:20,632 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792853678] [2021-08-27 04:26:20,632 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792853678] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:20,632 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:20,632 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 04:26:20,633 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894326884] [2021-08-27 04:26:20,633 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 04:26:20,633 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:20,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 04:26:20,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 04:26:20,634 INFO L87 Difference]: Start difference. First operand 287 states and 318 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:21,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:21,196 INFO L93 Difference]: Finished difference Result 306 states and 338 transitions. [2021-08-27 04:26:21,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 04:26:21,197 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2021-08-27 04:26:21,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:21,198 INFO L225 Difference]: With dead ends: 306 [2021-08-27 04:26:21,198 INFO L226 Difference]: Without dead ends: 306 [2021-08-27 04:26:21,198 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 83.3ms TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-08-27 04:26:21,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2021-08-27 04:26:21,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 286. [2021-08-27 04:26:21,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 173 states have (on average 1.6647398843930636) internal successors, (288), 271 states have internal predecessors, (288), 19 states have call successors, (19), 8 states have call predecessors, (19), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2021-08-27 04:26:21,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 315 transitions. [2021-08-27 04:26:21,214 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 315 transitions. Word has length 32 [2021-08-27 04:26:21,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:21,214 INFO L470 AbstractCegarLoop]: Abstraction has 286 states and 315 transitions. [2021-08-27 04:26:21,214 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:21,214 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 315 transitions. [2021-08-27 04:26:21,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-08-27 04:26:21,217 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:21,217 INFO L512 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] [2021-08-27 04:26:21,217 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-27 04:26:21,217 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-08-27 04:26:21,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:21,218 INFO L82 PathProgramCache]: Analyzing trace with hash 173443807, now seen corresponding path program 1 times [2021-08-27 04:26:21,218 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:21,218 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317116059] [2021-08-27 04:26:21,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:21,218 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:21,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:21,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:21,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:21,308 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:21,308 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:21,309 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317116059] [2021-08-27 04:26:21,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317116059] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:21,309 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:21,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-27 04:26:21,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903104551] [2021-08-27 04:26:21,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 04:26:21,310 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:21,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 04:26:21,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-08-27 04:26:21,310 INFO L87 Difference]: Start difference. First operand 286 states and 315 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:22,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:22,054 INFO L93 Difference]: Finished difference Result 341 states and 373 transitions. [2021-08-27 04:26:22,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 04:26:22,055 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2021-08-27 04:26:22,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:22,056 INFO L225 Difference]: With dead ends: 341 [2021-08-27 04:26:22,056 INFO L226 Difference]: Without dead ends: 341 [2021-08-27 04:26:22,056 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 92.1ms TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2021-08-27 04:26:22,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2021-08-27 04:26:22,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 286. [2021-08-27 04:26:22,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 173 states have (on average 1.6589595375722543) internal successors, (287), 271 states have internal predecessors, (287), 19 states have call successors, (19), 8 states have call predecessors, (19), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2021-08-27 04:26:22,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 314 transitions. [2021-08-27 04:26:22,060 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 314 transitions. Word has length 35 [2021-08-27 04:26:22,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:22,061 INFO L470 AbstractCegarLoop]: Abstraction has 286 states and 314 transitions. [2021-08-27 04:26:22,061 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:22,061 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 314 transitions. [2021-08-27 04:26:22,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-08-27 04:26:22,061 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:22,061 INFO L512 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] [2021-08-27 04:26:22,061 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-27 04:26:22,061 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-08-27 04:26:22,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:22,062 INFO L82 PathProgramCache]: Analyzing trace with hash 2042093490, now seen corresponding path program 1 times [2021-08-27 04:26:22,062 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:22,062 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781778996] [2021-08-27 04:26:22,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:22,062 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:22,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:22,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:22,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:22,129 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:22,129 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:22,129 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781778996] [2021-08-27 04:26:22,129 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781778996] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:22,129 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:22,129 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-27 04:26:22,129 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119417261] [2021-08-27 04:26:22,130 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 04:26:22,130 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:22,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 04:26:22,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-08-27 04:26:22,130 INFO L87 Difference]: Start difference. First operand 286 states and 314 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:22,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:22,914 INFO L93 Difference]: Finished difference Result 340 states and 371 transitions. [2021-08-27 04:26:22,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 04:26:22,914 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2021-08-27 04:26:22,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:22,915 INFO L225 Difference]: With dead ends: 340 [2021-08-27 04:26:22,915 INFO L226 Difference]: Without dead ends: 340 [2021-08-27 04:26:22,915 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 104.7ms TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2021-08-27 04:26:22,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2021-08-27 04:26:22,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 286. [2021-08-27 04:26:22,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 173 states have (on average 1.653179190751445) internal successors, (286), 271 states have internal predecessors, (286), 19 states have call successors, (19), 8 states have call predecessors, (19), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2021-08-27 04:26:22,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 313 transitions. [2021-08-27 04:26:22,921 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 313 transitions. Word has length 35 [2021-08-27 04:26:22,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:22,921 INFO L470 AbstractCegarLoop]: Abstraction has 286 states and 313 transitions. [2021-08-27 04:26:22,921 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:22,921 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 313 transitions. [2021-08-27 04:26:22,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-27 04:26:22,924 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:22,924 INFO L512 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] [2021-08-27 04:26:22,925 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-27 04:26:22,925 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting inspect_beforeErr18REQUIRES_VIOLATION === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-08-27 04:26:22,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:22,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1081480683, now seen corresponding path program 1 times [2021-08-27 04:26:22,925 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:22,925 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528148492] [2021-08-27 04:26:22,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:22,925 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:22,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:23,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:23,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:23,050 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:23,051 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:23,052 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528148492] [2021-08-27 04:26:23,052 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528148492] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:23,052 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:23,052 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-27 04:26:23,052 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209133161] [2021-08-27 04:26:23,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-27 04:26:23,052 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:23,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 04:26:23,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-08-27 04:26:23,053 INFO L87 Difference]: Start difference. First operand 286 states and 313 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:23,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:24,000 INFO L93 Difference]: Finished difference Result 354 states and 389 transitions. [2021-08-27 04:26:24,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 04:26:24,000 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2021-08-27 04:26:24,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:24,001 INFO L225 Difference]: With dead ends: 354 [2021-08-27 04:26:24,001 INFO L226 Difference]: Without dead ends: 354 [2021-08-27 04:26:24,001 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 174.7ms TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2021-08-27 04:26:24,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2021-08-27 04:26:24,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 287. [2021-08-27 04:26:24,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 174 states have (on average 1.6551724137931034) internal successors, (288), 272 states have internal predecessors, (288), 19 states have call successors, (19), 8 states have call predecessors, (19), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2021-08-27 04:26:24,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 315 transitions. [2021-08-27 04:26:24,006 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 315 transitions. Word has length 36 [2021-08-27 04:26:24,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:24,006 INFO L470 AbstractCegarLoop]: Abstraction has 287 states and 315 transitions. [2021-08-27 04:26:24,006 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:24,006 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 315 transitions. [2021-08-27 04:26:24,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-27 04:26:24,007 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:24,007 INFO L512 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] [2021-08-27 04:26:24,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-27 04:26:24,007 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting inspect_beforeErr19REQUIRES_VIOLATION === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-08-27 04:26:24,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:24,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1081480684, now seen corresponding path program 1 times [2021-08-27 04:26:24,007 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:24,007 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675872049] [2021-08-27 04:26:24,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:24,007 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:24,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:24,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:24,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:24,121 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:24,121 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:24,121 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675872049] [2021-08-27 04:26:24,121 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675872049] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:24,121 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:24,121 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 04:26:24,121 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272329870] [2021-08-27 04:26:24,122 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 04:26:24,122 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:24,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 04:26:24,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-08-27 04:26:24,122 INFO L87 Difference]: Start difference. First operand 287 states and 315 transitions. Second operand has 9 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:24,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:24,990 INFO L93 Difference]: Finished difference Result 367 states and 402 transitions. [2021-08-27 04:26:24,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 04:26:24,990 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2021-08-27 04:26:24,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:24,991 INFO L225 Difference]: With dead ends: 367 [2021-08-27 04:26:24,991 INFO L226 Difference]: Without dead ends: 367 [2021-08-27 04:26:24,992 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 121.3ms TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2021-08-27 04:26:24,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2021-08-27 04:26:24,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 287. [2021-08-27 04:26:24,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 174 states have (on average 1.6494252873563218) internal successors, (287), 272 states have internal predecessors, (287), 19 states have call successors, (19), 8 states have call predecessors, (19), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2021-08-27 04:26:24,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 314 transitions. [2021-08-27 04:26:24,995 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 314 transitions. Word has length 36 [2021-08-27 04:26:24,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:24,996 INFO L470 AbstractCegarLoop]: Abstraction has 287 states and 314 transitions. [2021-08-27 04:26:24,996 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:24,996 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 314 transitions. [2021-08-27 04:26:24,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-27 04:26:24,996 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:24,996 INFO L512 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] [2021-08-27 04:26:24,996 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-27 04:26:24,996 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting inspect_beforeErr8REQUIRES_VIOLATION === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-08-27 04:26:24,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:24,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1119996019, now seen corresponding path program 1 times [2021-08-27 04:26:24,997 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:24,997 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410999506] [2021-08-27 04:26:24,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:24,997 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:25,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:25,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:25,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:25,110 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:25,110 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:25,110 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410999506] [2021-08-27 04:26:25,110 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410999506] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:25,110 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:25,110 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-27 04:26:25,110 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134415361] [2021-08-27 04:26:25,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-27 04:26:25,112 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:25,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 04:26:25,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-08-27 04:26:25,116 INFO L87 Difference]: Start difference. First operand 287 states and 314 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:26,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:26,159 INFO L93 Difference]: Finished difference Result 352 states and 387 transitions. [2021-08-27 04:26:26,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 04:26:26,159 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2021-08-27 04:26:26,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:26,160 INFO L225 Difference]: With dead ends: 352 [2021-08-27 04:26:26,160 INFO L226 Difference]: Without dead ends: 352 [2021-08-27 04:26:26,160 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 185.1ms TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2021-08-27 04:26:26,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2021-08-27 04:26:26,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 287. [2021-08-27 04:26:26,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 174 states have (on average 1.6436781609195403) internal successors, (286), 272 states have internal predecessors, (286), 19 states have call successors, (19), 8 states have call predecessors, (19), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2021-08-27 04:26:26,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 313 transitions. [2021-08-27 04:26:26,164 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 313 transitions. Word has length 36 [2021-08-27 04:26:26,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:26,165 INFO L470 AbstractCegarLoop]: Abstraction has 287 states and 313 transitions. [2021-08-27 04:26:26,165 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:26,165 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 313 transitions. [2021-08-27 04:26:26,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-27 04:26:26,165 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:26,165 INFO L512 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] [2021-08-27 04:26:26,166 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-27 04:26:26,166 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting inspect_beforeErr9REQUIRES_VIOLATION === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-08-27 04:26:26,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:26,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1119996018, now seen corresponding path program 1 times [2021-08-27 04:26:26,166 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:26,166 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020374387] [2021-08-27 04:26:26,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:26,167 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:26,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:26,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:26,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:26,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:26,299 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:26,299 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020374387] [2021-08-27 04:26:26,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020374387] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:26,300 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:26,300 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 04:26:26,300 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847511880] [2021-08-27 04:26:26,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 04:26:26,300 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:26,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 04:26:26,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-08-27 04:26:26,300 INFO L87 Difference]: Start difference. First operand 287 states and 313 transitions. Second operand has 9 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:27,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:27,177 INFO L93 Difference]: Finished difference Result 365 states and 400 transitions. [2021-08-27 04:26:27,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 04:26:27,177 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2021-08-27 04:26:27,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:27,178 INFO L225 Difference]: With dead ends: 365 [2021-08-27 04:26:27,178 INFO L226 Difference]: Without dead ends: 365 [2021-08-27 04:26:27,178 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 131.7ms TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2021-08-27 04:26:27,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2021-08-27 04:26:27,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 287. [2021-08-27 04:26:27,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 174 states have (on average 1.6379310344827587) internal successors, (285), 272 states have internal predecessors, (285), 19 states have call successors, (19), 8 states have call predecessors, (19), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2021-08-27 04:26:27,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 312 transitions. [2021-08-27 04:26:27,182 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 312 transitions. Word has length 36 [2021-08-27 04:26:27,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:27,182 INFO L470 AbstractCegarLoop]: Abstraction has 287 states and 312 transitions. [2021-08-27 04:26:27,183 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:27,183 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 312 transitions. [2021-08-27 04:26:27,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-08-27 04:26:27,183 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:27,183 INFO L512 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] [2021-08-27 04:26:27,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-27 04:26:27,183 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-08-27 04:26:27,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:27,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1841504364, now seen corresponding path program 1 times [2021-08-27 04:26:27,183 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:27,184 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535517502] [2021-08-27 04:26:27,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:27,184 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:27,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 04:26:27,193 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 04:26:27,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 04:26:27,215 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 04:26:27,216 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-27 04:26:27,216 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location failErr0ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 04:26:27,217 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr0REQUIRES_VIOLATION [2021-08-27 04:26:27,218 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr1REQUIRES_VIOLATION [2021-08-27 04:26:27,218 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr2REQUIRES_VIOLATION [2021-08-27 04:26:27,218 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr3REQUIRES_VIOLATION [2021-08-27 04:26:27,218 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr4REQUIRES_VIOLATION [2021-08-27 04:26:27,218 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr5REQUIRES_VIOLATION [2021-08-27 04:26:27,218 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr6REQUIRES_VIOLATION [2021-08-27 04:26:27,218 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr7REQUIRES_VIOLATION [2021-08-27 04:26:27,218 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr8REQUIRES_VIOLATION [2021-08-27 04:26:27,219 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr9REQUIRES_VIOLATION [2021-08-27 04:26:27,219 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr10REQUIRES_VIOLATION [2021-08-27 04:26:27,219 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr11REQUIRES_VIOLATION [2021-08-27 04:26:27,219 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr12REQUIRES_VIOLATION [2021-08-27 04:26:27,219 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr13REQUIRES_VIOLATION [2021-08-27 04:26:27,219 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr14REQUIRES_VIOLATION [2021-08-27 04:26:27,219 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr15REQUIRES_VIOLATION [2021-08-27 04:26:27,219 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr16REQUIRES_VIOLATION [2021-08-27 04:26:27,219 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr17REQUIRES_VIOLATION [2021-08-27 04:26:27,219 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr18REQUIRES_VIOLATION [2021-08-27 04:26:27,219 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr19REQUIRES_VIOLATION [2021-08-27 04:26:27,219 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_afterErr0REQUIRES_VIOLATION [2021-08-27 04:26:27,220 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_afterErr1REQUIRES_VIOLATION [2021-08-27 04:26:27,220 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_afterErr2REQUIRES_VIOLATION [2021-08-27 04:26:27,220 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_afterErr3REQUIRES_VIOLATION [2021-08-27 04:26:27,220 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_afterErr4REQUIRES_VIOLATION [2021-08-27 04:26:27,220 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_afterErr5REQUIRES_VIOLATION [2021-08-27 04:26:27,220 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_afterErr6REQUIRES_VIOLATION [2021-08-27 04:26:27,220 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_afterErr7REQUIRES_VIOLATION [2021-08-27 04:26:27,220 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_afterErr8REQUIRES_VIOLATION [2021-08-27 04:26:27,220 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_afterErr9REQUIRES_VIOLATION [2021-08-27 04:26:27,220 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_afterErr10REQUIRES_VIOLATION [2021-08-27 04:26:27,220 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_afterErr11REQUIRES_VIOLATION [2021-08-27 04:26:27,220 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr0REQUIRES_VIOLATION [2021-08-27 04:26:27,220 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr1REQUIRES_VIOLATION [2021-08-27 04:26:27,220 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr2REQUIRES_VIOLATION [2021-08-27 04:26:27,220 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr3REQUIRES_VIOLATION [2021-08-27 04:26:27,220 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr4REQUIRES_VIOLATION [2021-08-27 04:26:27,220 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr5REQUIRES_VIOLATION [2021-08-27 04:26:27,221 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr6REQUIRES_VIOLATION [2021-08-27 04:26:27,221 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr7REQUIRES_VIOLATION [2021-08-27 04:26:27,221 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr8REQUIRES_VIOLATION [2021-08-27 04:26:27,221 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr9REQUIRES_VIOLATION [2021-08-27 04:26:27,221 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr10REQUIRES_VIOLATION [2021-08-27 04:26:27,221 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr11REQUIRES_VIOLATION [2021-08-27 04:26:27,221 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr12REQUIRES_VIOLATION [2021-08-27 04:26:27,221 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr13REQUIRES_VIOLATION [2021-08-27 04:26:27,221 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr0REQUIRES_VIOLATION [2021-08-27 04:26:27,221 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr1REQUIRES_VIOLATION [2021-08-27 04:26:27,221 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr2REQUIRES_VIOLATION [2021-08-27 04:26:27,221 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr3REQUIRES_VIOLATION [2021-08-27 04:26:27,221 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr4REQUIRES_VIOLATION [2021-08-27 04:26:27,221 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr5REQUIRES_VIOLATION [2021-08-27 04:26:27,221 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr6REQUIRES_VIOLATION [2021-08-27 04:26:27,221 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr7REQUIRES_VIOLATION [2021-08-27 04:26:27,221 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr8REQUIRES_VIOLATION [2021-08-27 04:26:27,221 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr9REQUIRES_VIOLATION [2021-08-27 04:26:27,221 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr10REQUIRES_VIOLATION [2021-08-27 04:26:27,222 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr11REQUIRES_VIOLATION [2021-08-27 04:26:27,222 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr12REQUIRES_VIOLATION [2021-08-27 04:26:27,222 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr13REQUIRES_VIOLATION [2021-08-27 04:26:27,222 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr14REQUIRES_VIOLATION [2021-08-27 04:26:27,222 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr15REQUIRES_VIOLATION [2021-08-27 04:26:27,222 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr16REQUIRES_VIOLATION [2021-08-27 04:26:27,222 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr17REQUIRES_VIOLATION [2021-08-27 04:26:27,222 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr18REQUIRES_VIOLATION [2021-08-27 04:26:27,222 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr19REQUIRES_VIOLATION [2021-08-27 04:26:27,222 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr20REQUIRES_VIOLATION [2021-08-27 04:26:27,222 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr21REQUIRES_VIOLATION [2021-08-27 04:26:27,222 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr0REQUIRES_VIOLATION [2021-08-27 04:26:27,222 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr1REQUIRES_VIOLATION [2021-08-27 04:26:27,222 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr2REQUIRES_VIOLATION [2021-08-27 04:26:27,222 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr3REQUIRES_VIOLATION [2021-08-27 04:26:27,222 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr4REQUIRES_VIOLATION [2021-08-27 04:26:27,222 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr5REQUIRES_VIOLATION [2021-08-27 04:26:27,222 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr6REQUIRES_VIOLATION [2021-08-27 04:26:27,222 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr7REQUIRES_VIOLATION [2021-08-27 04:26:27,222 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr8REQUIRES_VIOLATION [2021-08-27 04:26:27,223 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr9REQUIRES_VIOLATION [2021-08-27 04:26:27,223 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr10REQUIRES_VIOLATION [2021-08-27 04:26:27,223 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr11REQUIRES_VIOLATION [2021-08-27 04:26:27,223 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr12ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 04:26:27,223 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr13ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 04:26:27,223 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr14ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 04:26:27,223 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr15REQUIRES_VIOLATION [2021-08-27 04:26:27,223 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr16REQUIRES_VIOLATION [2021-08-27 04:26:27,223 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr17ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 04:26:27,223 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr18ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 04:26:27,223 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr19ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 04:26:27,223 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr20ENSURES_VIOLATIONMEMORY_LEAK [2021-08-27 04:26:27,223 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr0REQUIRES_VIOLATION [2021-08-27 04:26:27,223 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr1REQUIRES_VIOLATION [2021-08-27 04:26:27,223 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr2REQUIRES_VIOLATION [2021-08-27 04:26:27,223 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr3REQUIRES_VIOLATION [2021-08-27 04:26:27,223 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr4REQUIRES_VIOLATION [2021-08-27 04:26:27,224 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr5REQUIRES_VIOLATION [2021-08-27 04:26:27,224 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr6REQUIRES_VIOLATION [2021-08-27 04:26:27,224 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr7REQUIRES_VIOLATION [2021-08-27 04:26:27,224 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr8REQUIRES_VIOLATION [2021-08-27 04:26:27,224 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr9REQUIRES_VIOLATION [2021-08-27 04:26:27,224 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr10REQUIRES_VIOLATION [2021-08-27 04:26:27,224 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr11REQUIRES_VIOLATION [2021-08-27 04:26:27,224 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 04:26:27,224 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 04:26:27,224 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 04:26:27,224 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-27 04:26:27,228 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-27 04:26:27,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 04:26:27 BoogieIcfgContainer [2021-08-27 04:26:27,247 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-27 04:26:27,248 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 04:26:27,248 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 04:26:27,248 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 04:26:27,248 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 04:26:13" (3/4) ... [2021-08-27 04:26:27,249 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-08-27 04:26:27,270 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-27 04:26:27,271 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 04:26:27,272 INFO L168 Benchmark]: Toolchain (without parser) took 15005.90 ms. Allocated memory was 54.5 MB in the beginning and 239.1 MB in the end (delta: 184.5 MB). Free memory was 30.2 MB in the beginning and 184.0 MB in the end (delta: -153.8 MB). Peak memory consumption was 31.6 MB. Max. memory is 16.1 GB. [2021-08-27 04:26:27,272 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 54.5 MB. Free memory was 36.9 MB in the beginning and 36.9 MB in the end (delta: 36.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 04:26:27,272 INFO L168 Benchmark]: CACSL2BoogieTranslator took 370.26 ms. Allocated memory is still 54.5 MB. Free memory was 30.0 MB in the beginning and 29.7 MB in the end (delta: 386.1 kB). Peak memory consumption was 7.4 MB. Max. memory is 16.1 GB. [2021-08-27 04:26:27,272 INFO L168 Benchmark]: Boogie Preprocessor took 85.57 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 29.7 MB in the beginning and 48.4 MB in the end (delta: -18.7 MB). Peak memory consumption was 9.1 MB. Max. memory is 16.1 GB. [2021-08-27 04:26:27,272 INFO L168 Benchmark]: RCFGBuilder took 1078.05 ms. Allocated memory was 67.1 MB in the beginning and 81.8 MB in the end (delta: 14.7 MB). Free memory was 48.1 MB in the beginning and 55.7 MB in the end (delta: -7.6 MB). Peak memory consumption was 24.1 MB. Max. memory is 16.1 GB. [2021-08-27 04:26:27,273 INFO L168 Benchmark]: TraceAbstraction took 13444.41 ms. Allocated memory was 81.8 MB in the beginning and 239.1 MB in the end (delta: 157.3 MB). Free memory was 55.3 MB in the beginning and 187.1 MB in the end (delta: -131.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 16.1 GB. [2021-08-27 04:26:27,273 INFO L168 Benchmark]: Witness Printer took 22.97 ms. Allocated memory is still 239.1 MB. Free memory was 186.1 MB in the beginning and 184.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 04:26:27,274 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 54.5 MB. Free memory was 36.9 MB in the beginning and 36.9 MB in the end (delta: 36.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 370.26 ms. Allocated memory is still 54.5 MB. Free memory was 30.0 MB in the beginning and 29.7 MB in the end (delta: 386.1 kB). Peak memory consumption was 7.4 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 85.57 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 29.7 MB in the beginning and 48.4 MB in the end (delta: -18.7 MB). Peak memory consumption was 9.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1078.05 ms. Allocated memory was 67.1 MB in the beginning and 81.8 MB in the end (delta: 14.7 MB). Free memory was 48.1 MB in the beginning and 55.7 MB in the end (delta: -7.6 MB). Peak memory consumption was 24.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 13444.41 ms. Allocated memory was 81.8 MB in the beginning and 239.1 MB in the end (delta: 157.3 MB). Free memory was 55.3 MB in the beginning and 187.1 MB in the end (delta: -131.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 16.1 GB. * Witness Printer took 22.97 ms. Allocated memory is still 239.1 MB. Free memory was 186.1 MB in the beginning and 184.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 565]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L638] struct list *data = ((void *)0); VAL [data={0:0}] [L639] COND TRUE __VERIFIER_nondet_int() [L640] struct node *node = malloc(sizeof *node); [L641] COND FALSE !(!node) VAL [data={0:0}, node={-1:0}] [L643] node->next = node VAL [data={0:0}, node={-1:0}] [L644] node->value = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-2, data={0:0}, node={-1:0}] [L645] struct list *item = malloc(sizeof *item); [L646] COND FALSE !(!item) VAL [data={0:0}, item={-3:0}, node={-1:0}] [L648] item->slist = node VAL [data={0:0}, item={-3:0}, node={-1:0}] [L649] item->next = data VAL [data={0:0}, item={-3:0}, node={-1:0}] [L650] data = item VAL [data={-3:0}, item={-3:0}, node={-1:0}] [L639] COND FALSE !(__VERIFIER_nondet_int()) [L652] COND FALSE !(!data) VAL [data={-3:0}, item={-3:0}, node={-1:0}] [L654] CALL inspect_before(data) VAL [shape={-3:0}] [L615] COND FALSE !(!(shape)) VAL [shape={-3:0}, shape={-3:0}] [L616] shape->next VAL [shape={-3:0}, shape={-3:0}, shape->next={0:0}] [L616] COND FALSE !(shape->next) [L622] COND FALSE !(!(shape)) VAL [shape={-3:0}, shape={-3:0}] [L623] EXPR shape->next VAL [shape={-3:0}, shape={-3:0}, shape->next={0:0}] [L623] COND FALSE !(!(shape->next == ((void *)0))) [L624] EXPR shape->slist VAL [shape={-3:0}, shape={-3:0}, shape->slist={-1:0}] [L624] COND FALSE !(!(shape->slist)) [L625] EXPR shape->slist VAL [shape={-3:0}, shape={-3:0}, shape->slist={-1:0}] [L625] EXPR shape->slist->next VAL [shape={-3:0}, shape={-3:0}, shape->slist={-1:0}, shape->slist->next={-1:0}] [L625] COND TRUE !(shape->slist->next == ((void *)0)) [L625] CALL fail() [L565] reach_error() - UnprovableResult [Line: 616]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 616]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 618]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 618]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 619]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 619]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 620]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 620]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 620]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 620]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 616]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 616]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 623]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 623]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 624]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 624]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 625]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 625]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 625]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 625]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 630]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 630]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 631]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 631]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 633]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 633]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 633]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 633]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 633]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 633]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 634]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 634]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 578]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 578]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 579]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 579]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 579]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 579]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 580]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 580]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 581]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 581]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 581]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 581]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 582]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 582]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 588]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 588]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 588]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 588]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 643]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 643]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 644]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 644]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 648]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 648]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 649]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 649]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 655]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 655]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 658]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 658]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 659]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 659]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 659]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 661]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 661]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 662]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 662]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 662]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 636]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 599]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 599]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 601]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 601]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 605]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 605]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 605]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 605]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 606]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 606]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 608]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 608]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 12 procedures, 288 locations, 105 error locations. Started 1 CEGAR loops. OverallTime: 13390.6ms, OverallIterations: 19, TraceHistogramMax: 2, EmptinessCheckTime: 19.9ms, AutomataDifference: 11569.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 9.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 3487 SDtfs, 5208 SDslu, 5333 SDs, 0 SdLazy, 16207 SolverSat, 644 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8101.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 196 GetRequests, 54 SyntacticMatches, 8 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1305.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=288occurred in iteration=10, InterpolantAutomatonStates: 123, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 160.1ms AutomataMinimizationTime, 18 MinimizatonAttempts, 1048 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 25.4ms SsaConstructionTime, 119.3ms SatisfiabilityAnalysisTime, 1247.0ms InterpolantComputationTime, 486 NumberOfCodeBlocks, 486 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 429 ConstructedInterpolants, 0 QuantifiedInterpolants, 2992 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 24/24 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-08-27 04:26:27,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...