./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/forester-heap/dll-01-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/forester-heap/dll-01-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 cdf63a831807312c569006a76efbe1414243703d ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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,067 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 04:26:11,069 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 04:26:11,100 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 04:26:11,100 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 04:26:11,103 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 04:26:11,104 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 04:26:11,113 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 04:26:11,115 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 04:26:11,118 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 04:26:11,119 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 04:26:11,123 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 04:26:11,123 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 04:26:11,125 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 04:26:11,126 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 04:26:11,129 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 04:26:11,130 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 04:26:11,131 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 04:26:11,133 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 04:26:11,138 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 04:26:11,139 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 04:26:11,140 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 04:26:11,141 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 04:26:11,142 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 04:26:11,146 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 04:26:11,147 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 04:26:11,147 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 04:26:11,148 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 04:26:11,148 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 04:26:11,149 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 04:26:11,149 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 04:26:11,149 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 04:26:11,151 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 04:26:11,151 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 04:26:11,152 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 04:26:11,152 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 04:26:11,153 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 04:26:11,153 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 04:26:11,153 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 04:26:11,154 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 04:26:11,155 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 04:26:11,158 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,181 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 04:26:11,181 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 04:26:11,182 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 04:26:11,182 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 04:26:11,183 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 04:26:11,183 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 04:26:11,183 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 04:26:11,184 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 04:26:11,184 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 04:26:11,184 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 04:26:11,185 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 04:26:11,185 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 04:26:11,185 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 04:26:11,185 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-08-27 04:26:11,185 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-08-27 04:26:11,185 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-27 04:26:11,186 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-08-27 04:26:11,186 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 04:26:11,186 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 04:26:11,186 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 04:26:11,186 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 04:26:11,186 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-27 04:26:11,186 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 04:26:11,187 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 04:26:11,187 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-27 04:26:11,187 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 04:26:11,187 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-27 04:26:11,187 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 04:26:11,187 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 -> cdf63a831807312c569006a76efbe1414243703d [2021-08-27 04:26:11,438 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 04:26:11,451 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 04:26:11,452 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 04:26:11,453 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 04:26:11,454 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 04:26:11,455 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-01-1.i [2021-08-27 04:26:11,501 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f2423180/096d2cc0b1e34a2285568f48e85f7d0d/FLAG930bbe83b [2021-08-27 04:26:11,899 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 04:26:11,899 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i [2021-08-27 04:26:11,909 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f2423180/096d2cc0b1e34a2285568f48e85f7d0d/FLAG930bbe83b [2021-08-27 04:26:11,928 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f2423180/096d2cc0b1e34a2285568f48e85f7d0d [2021-08-27 04:26:11,932 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 04:26:11,933 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-27 04:26:11,940 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 04:26:11,941 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 04:26:11,943 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 04:26:11,944 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 04:26:11" (1/1) ... [2021-08-27 04:26:11,944 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@153502db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:11, skipping insertion in model container [2021-08-27 04:26:11,945 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 04:26:11" (1/1) ... [2021-08-27 04:26:11,949 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 04:26:11,997 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 04:26:12,222 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/forester-heap/dll-01-1.i[22080,22093] [2021-08-27 04:26:12,233 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/forester-heap/dll-01-1.i[22353,22366] [2021-08-27 04:26:12,236 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/forester-heap/dll-01-1.i[22587,22600] [2021-08-27 04:26:12,237 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/forester-heap/dll-01-1.i[22657,22670] [2021-08-27 04:26:12,239 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/forester-heap/dll-01-1.i[22924,22937] [2021-08-27 04:26:12,239 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/forester-heap/dll-01-1.i[23032,23045] [2021-08-27 04:26:12,244 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/forester-heap/dll-01-1.i[23263,23276] [2021-08-27 04:26:12,246 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/forester-heap/dll-01-1.i[23343,23356] [2021-08-27 04:26:12,247 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/forester-heap/dll-01-1.i[23422,23435] [2021-08-27 04:26:12,248 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/forester-heap/dll-01-1.i[23512,23525] [2021-08-27 04:26:12,250 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/forester-heap/dll-01-1.i[23690,23703] [2021-08-27 04:26:12,250 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/forester-heap/dll-01-1.i[23768,23781] [2021-08-27 04:26:12,252 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/forester-heap/dll-01-1.i[23845,23858] [2021-08-27 04:26:12,265 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 04:26:12,271 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 04:26:12,298 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/forester-heap/dll-01-1.i[22080,22093] [2021-08-27 04:26:12,299 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/forester-heap/dll-01-1.i[22353,22366] [2021-08-27 04:26:12,300 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/forester-heap/dll-01-1.i[22587,22600] [2021-08-27 04:26:12,301 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/forester-heap/dll-01-1.i[22657,22670] [2021-08-27 04:26:12,302 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/forester-heap/dll-01-1.i[22924,22937] [2021-08-27 04:26:12,303 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/forester-heap/dll-01-1.i[23032,23045] [2021-08-27 04:26:12,304 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/forester-heap/dll-01-1.i[23263,23276] [2021-08-27 04:26:12,304 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/forester-heap/dll-01-1.i[23343,23356] [2021-08-27 04:26:12,304 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/forester-heap/dll-01-1.i[23422,23435] [2021-08-27 04:26:12,305 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/forester-heap/dll-01-1.i[23512,23525] [2021-08-27 04:26:12,306 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/forester-heap/dll-01-1.i[23690,23703] [2021-08-27 04:26:12,306 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/forester-heap/dll-01-1.i[23768,23781] [2021-08-27 04:26:12,307 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/forester-heap/dll-01-1.i[23845,23858] [2021-08-27 04:26:12,308 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 04:26:12,330 INFO L208 MainTranslator]: Completed translation [2021-08-27 04:26:12,331 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,331 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 04:26:12,332 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 04:26:12,332 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 04:26:12,332 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 04:26:12,340 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,340 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,361 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,367 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,379 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,389 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,393 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,402 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 04:26:12,403 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 04:26:12,407 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 04:26:12,407 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 04:26:12,408 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,413 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 04:26:12,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 04:26:12,434 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,440 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,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-08-27 04:26:12,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 04:26:12,463 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-08-27 04:26:12,463 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-08-27 04:26:12,464 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-08-27 04:26:12,464 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-08-27 04:26:12,464 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-08-27 04:26:12,464 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-08-27 04:26:12,464 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-08-27 04:26:12,464 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-08-27 04:26:12,464 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-08-27 04:26:12,464 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-08-27 04:26:12,464 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-08-27 04:26:12,468 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-08-27 04:26:12,468 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-08-27 04:26:12,468 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-08-27 04:26:12,468 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-08-27 04:26:12,468 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-08-27 04:26:12,468 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-08-27 04:26:12,474 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-08-27 04:26:12,474 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-08-27 04:26:12,474 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-08-27 04:26:12,474 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-08-27 04:26:12,475 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-08-27 04:26:12,475 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-08-27 04:26:12,476 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-08-27 04:26:12,476 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-08-27 04:26:12,476 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-08-27 04:26:12,476 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-08-27 04:26:12,476 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-08-27 04:26:12,476 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-08-27 04:26:12,476 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-08-27 04:26:12,477 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-08-27 04:26:12,477 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-08-27 04:26:12,477 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-08-27 04:26:12,477 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-08-27 04:26:12,477 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-08-27 04:26:12,477 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-08-27 04:26:12,477 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-08-27 04:26:12,477 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-08-27 04:26:12,478 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-08-27 04:26:12,478 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-08-27 04:26:12,478 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-08-27 04:26:12,479 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-08-27 04:26:12,479 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-08-27 04:26:12,479 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-08-27 04:26:12,479 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-08-27 04:26:12,479 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-08-27 04:26:12,480 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-08-27 04:26:12,480 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-08-27 04:26:12,480 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-08-27 04:26:12,480 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-08-27 04:26:12,480 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-08-27 04:26:12,480 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-08-27 04:26:12,481 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-08-27 04:26:12,481 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-08-27 04:26:12,481 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-08-27 04:26:12,481 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-08-27 04:26:12,481 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2021-08-27 04:26:12,481 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-08-27 04:26:12,481 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-08-27 04:26:12,481 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-08-27 04:26:12,481 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2021-08-27 04:26:12,482 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-08-27 04:26:12,482 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-08-27 04:26:12,482 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2021-08-27 04:26:12,482 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-08-27 04:26:12,482 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-08-27 04:26:12,482 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2021-08-27 04:26:12,482 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-08-27 04:26:12,482 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-08-27 04:26:12,482 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-08-27 04:26:12,482 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-08-27 04:26:12,483 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-08-27 04:26:12,483 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-08-27 04:26:12,483 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-08-27 04:26:12,483 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-08-27 04:26:12,483 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-08-27 04:26:12,483 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-08-27 04:26:12,483 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-08-27 04:26:12,483 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-08-27 04:26:12,484 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-08-27 04:26:12,484 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-08-27 04:26:12,484 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-08-27 04:26:12,484 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-08-27 04:26:12,484 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-08-27 04:26:12,484 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-08-27 04:26:12,484 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-08-27 04:26:12,484 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-08-27 04:26:12,484 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-08-27 04:26:12,485 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-08-27 04:26:12,485 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-08-27 04:26:12,485 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-08-27 04:26:12,485 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-08-27 04:26:12,485 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-08-27 04:26:12,485 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-08-27 04:26:12,485 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-08-27 04:26:12,485 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-08-27 04:26:12,485 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-08-27 04:26:12,485 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-08-27 04:26:12,486 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-08-27 04:26:12,486 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-08-27 04:26:12,486 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-08-27 04:26:12,486 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-08-27 04:26:12,487 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-08-27 04:26:12,488 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-08-27 04:26:12,488 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-08-27 04:26:12,488 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-08-27 04:26:12,489 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-08-27 04:26:12,489 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-08-27 04:26:12,489 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-08-27 04:26:12,489 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-08-27 04:26:12,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 04:26:12,490 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-08-27 04:26:12,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-27 04:26:12,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-27 04:26:12,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-27 04:26:12,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 04:26:12,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-08-27 04:26:12,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 04:26:12,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 04:26:12,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-27 04:26:12,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-27 04:26:13,319 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 04:26:13,319 INFO L299 CfgBuilder]: Removed 30 assume(true) statements. [2021-08-27 04:26:13,320 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,321 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 04:26:13,322 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-27 04:26:13,322 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-27 04:26:13,324 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-27 04:26:13,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 04:26:11" (1/3) ... [2021-08-27 04:26:13,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29926f17 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,325 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,326 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29926f17 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,326 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,327 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-01-1.i [2021-08-27 04:26:13,331 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-27 04:26:13,331 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 84 error locations. [2021-08-27 04:26:13,367 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-27 04:26:13,371 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,371 INFO L340 AbstractCegarLoop]: Starting to check reachability of 84 error locations. [2021-08-27 04:26:13,384 INFO L276 IsEmpty]: Start isEmpty. Operand has 205 states, 116 states have (on average 2.1810344827586206) internal successors, (253), 200 states have internal predecessors, (253), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 04:26:13,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-08-27 04:26:13,388 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:13,388 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:13,389 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-08-27 04:26:13,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:13,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1164341321, now seen corresponding path program 1 times [2021-08-27 04:26:13,397 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:13,398 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854337652] [2021-08-27 04:26:13,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:13,399 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:13,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:13,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:13,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:13,605 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:13,605 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:13,606 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854337652] [2021-08-27 04:26:13,607 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854337652] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:13,607 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:13,607 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 04:26:13,611 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093678777] [2021-08-27 04:26:13,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 04:26:13,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:13,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 04:26:13,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:13,629 INFO L87 Difference]: Start difference. First operand has 205 states, 116 states have (on average 2.1810344827586206) internal successors, (253), 200 states have internal predecessors, (253), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:14,120 INFO L93 Difference]: Finished difference Result 205 states and 215 transitions. [2021-08-27 04:26:14,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 04:26:14,122 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 7 [2021-08-27 04:26:14,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:14,128 INFO L225 Difference]: With dead ends: 205 [2021-08-27 04:26:14,128 INFO L226 Difference]: Without dead ends: 201 [2021-08-27 04:26:14,129 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 32.4ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:14,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-08-27 04:26:14,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 196. [2021-08-27 04:26:14,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 118 states have (on average 1.7372881355932204) internal successors, (205), 192 states have internal predecessors, (205), 2 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,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 208 transitions. [2021-08-27 04:26:14,159 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 208 transitions. Word has length 7 [2021-08-27 04:26:14,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:14,159 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 208 transitions. [2021-08-27 04:26:14,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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,159 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 208 transitions. [2021-08-27 04:26:14,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-08-27 04:26:14,160 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:14,160 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:14,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-27 04:26:14,160 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-08-27 04:26:14,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:14,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1164341322, now seen corresponding path program 1 times [2021-08-27 04:26:14,161 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:14,161 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870753449] [2021-08-27 04:26:14,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:14,162 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:14,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:14,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:14,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:14,229 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,230 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:14,230 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870753449] [2021-08-27 04:26:14,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870753449] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:14,237 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:14,237 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 04:26:14,237 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857352092] [2021-08-27 04:26:14,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 04:26:14,238 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:14,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 04:26:14,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:14,239 INFO L87 Difference]: Start difference. First operand 196 states and 208 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:14,503 INFO L93 Difference]: Finished difference Result 225 states and 236 transitions. [2021-08-27 04:26:14,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 04:26:14,504 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 7 [2021-08-27 04:26:14,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:14,505 INFO L225 Difference]: With dead ends: 225 [2021-08-27 04:26:14,505 INFO L226 Difference]: Without dead ends: 225 [2021-08-27 04:26:14,506 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.9ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:14,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2021-08-27 04:26:14,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 205. [2021-08-27 04:26:14,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 135 states have (on average 1.6666666666666667) internal successors, (225), 201 states have internal predecessors, (225), 2 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,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 228 transitions. [2021-08-27 04:26:14,519 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 228 transitions. Word has length 7 [2021-08-27 04:26:14,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:14,519 INFO L470 AbstractCegarLoop]: Abstraction has 205 states and 228 transitions. [2021-08-27 04:26:14,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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,519 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 228 transitions. [2021-08-27 04:26:14,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-27 04:26:14,520 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:14,520 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:14,520 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-27 04:26:14,520 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr4ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-08-27 04:26:14,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:14,521 INFO L82 PathProgramCache]: Analyzing trace with hash 736394790, now seen corresponding path program 1 times [2021-08-27 04:26:14,521 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:14,521 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140398345] [2021-08-27 04:26:14,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:14,521 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:14,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:14,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:14,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:14,562 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,563 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:14,563 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140398345] [2021-08-27 04:26:14,563 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140398345] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:14,563 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:14,563 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 04:26:14,563 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808926205] [2021-08-27 04:26:14,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 04:26:14,564 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:14,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 04:26:14,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:14,565 INFO L87 Difference]: Start difference. First operand 205 states and 228 transitions. Second operand has 4 states, 4 states have (on average 1.75) 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:14,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:14,791 INFO L93 Difference]: Finished difference Result 220 states and 231 transitions. [2021-08-27 04:26:14,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 04:26:14,791 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) 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:14,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:14,793 INFO L225 Difference]: With dead ends: 220 [2021-08-27 04:26:14,793 INFO L226 Difference]: Without dead ends: 220 [2021-08-27 04:26:14,793 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.3ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:14,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2021-08-27 04:26:14,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 203. [2021-08-27 04:26:14,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 134 states have (on average 1.6567164179104477) internal successors, (222), 199 states have internal predecessors, (222), 2 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,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 225 transitions. [2021-08-27 04:26:14,800 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 225 transitions. Word has length 10 [2021-08-27 04:26:14,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:14,800 INFO L470 AbstractCegarLoop]: Abstraction has 203 states and 225 transitions. [2021-08-27 04:26:14,800 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) 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:14,800 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 225 transitions. [2021-08-27 04:26:14,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-27 04:26:14,801 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:14,801 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:14,801 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-27 04:26:14,801 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr11REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-08-27 04:26:14,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:14,802 INFO L82 PathProgramCache]: Analyzing trace with hash 712243896, now seen corresponding path program 1 times [2021-08-27 04:26:14,802 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:14,802 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257205799] [2021-08-27 04:26:14,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:14,802 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:14,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:14,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:14,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:14,874 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,875 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:14,875 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257205799] [2021-08-27 04:26:14,875 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257205799] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:14,875 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:14,875 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 04:26:14,876 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200215129] [2021-08-27 04:26:14,876 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 04:26:14,876 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:14,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 04:26:14,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 04:26:14,877 INFO L87 Difference]: Start difference. First operand 203 states and 225 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:15,145 INFO L93 Difference]: Finished difference Result 202 states and 224 transitions. [2021-08-27 04:26:15,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 04:26:15,146 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 16 [2021-08-27 04:26:15,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:15,147 INFO L225 Difference]: With dead ends: 202 [2021-08-27 04:26:15,147 INFO L226 Difference]: Without dead ends: 202 [2021-08-27 04:26:15,147 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 30.9ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-27 04:26:15,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-08-27 04:26:15,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2021-08-27 04:26:15,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 134 states have (on average 1.6492537313432836) internal successors, (221), 198 states have internal predecessors, (221), 2 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,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 224 transitions. [2021-08-27 04:26:15,166 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 224 transitions. Word has length 16 [2021-08-27 04:26:15,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:15,166 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 224 transitions. [2021-08-27 04:26:15,166 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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,167 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 224 transitions. [2021-08-27 04:26:15,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-27 04:26:15,167 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:15,167 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:15,168 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-27 04:26:15,168 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr12REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-08-27 04:26:15,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:15,168 INFO L82 PathProgramCache]: Analyzing trace with hash 712243897, now seen corresponding path program 1 times [2021-08-27 04:26:15,169 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:15,169 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523136063] [2021-08-27 04:26:15,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:15,171 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:15,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:15,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:15,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:15,297 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,297 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:15,297 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523136063] [2021-08-27 04:26:15,297 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523136063] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:15,297 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:15,297 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 04:26:15,298 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991938235] [2021-08-27 04:26:15,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 04:26:15,298 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:15,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 04:26:15,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 04:26:15,299 INFO L87 Difference]: Start difference. First operand 202 states and 224 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:15,638 INFO L93 Difference]: Finished difference Result 201 states and 223 transitions. [2021-08-27 04:26:15,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 04:26:15,638 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 16 [2021-08-27 04:26:15,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:15,639 INFO L225 Difference]: With dead ends: 201 [2021-08-27 04:26:15,640 INFO L226 Difference]: Without dead ends: 201 [2021-08-27 04:26:15,640 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 67.3ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-27 04:26:15,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-08-27 04:26:15,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2021-08-27 04:26:15,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 134 states have (on average 1.6417910447761195) internal successors, (220), 197 states have internal predecessors, (220), 2 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,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 223 transitions. [2021-08-27 04:26:15,643 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 223 transitions. Word has length 16 [2021-08-27 04:26:15,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:15,644 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 223 transitions. [2021-08-27 04:26:15,644 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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,644 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 223 transitions. [2021-08-27 04:26:15,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-08-27 04:26:15,644 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:15,644 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:15,645 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-27 04:26:15,645 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr21ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-08-27 04:26:15,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:15,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1298127146, now seen corresponding path program 1 times [2021-08-27 04:26:15,645 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:15,646 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096001658] [2021-08-27 04:26:15,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:15,646 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:15,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:15,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:15,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:15,695 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,695 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:15,696 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096001658] [2021-08-27 04:26:15,696 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096001658] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:15,696 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:15,696 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 04:26:15,696 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489057535] [2021-08-27 04:26:15,697 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 04:26:15,697 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:15,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 04:26:15,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:15,698 INFO L87 Difference]: Start difference. First operand 201 states and 223 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:15,876 INFO L93 Difference]: Finished difference Result 202 states and 224 transitions. [2021-08-27 04:26:15,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 04:26:15,877 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 18 [2021-08-27 04:26:15,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:15,877 INFO L225 Difference]: With dead ends: 202 [2021-08-27 04:26:15,878 INFO L226 Difference]: Without dead ends: 202 [2021-08-27 04:26:15,878 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.5ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:15,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-08-27 04:26:15,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2021-08-27 04:26:15,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 135 states have (on average 1.637037037037037) internal successors, (221), 198 states have internal predecessors, (221), 2 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,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 224 transitions. [2021-08-27 04:26:15,881 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 224 transitions. Word has length 18 [2021-08-27 04:26:15,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:15,881 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 224 transitions. [2021-08-27 04:26:15,882 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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,882 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 224 transitions. [2021-08-27 04:26:15,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-08-27 04:26:15,882 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:15,882 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:15,882 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-27 04:26:15,882 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr15REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-08-27 04:26:15,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:15,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1319486370, now seen corresponding path program 1 times [2021-08-27 04:26:15,883 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:15,883 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35744832] [2021-08-27 04:26:15,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:15,883 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:15,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:15,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:15,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:15,979 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,980 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:15,980 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35744832] [2021-08-27 04:26:15,980 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35744832] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:15,980 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:15,980 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 04:26:15,980 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253086068] [2021-08-27 04:26:15,981 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 04:26:15,981 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:15,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 04:26:15,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-08-27 04:26:15,981 INFO L87 Difference]: Start difference. First operand 202 states and 224 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 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,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:16,325 INFO L93 Difference]: Finished difference Result 202 states and 223 transitions. [2021-08-27 04:26:16,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 04:26:16,325 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 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 19 [2021-08-27 04:26:16,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:16,326 INFO L225 Difference]: With dead ends: 202 [2021-08-27 04:26:16,326 INFO L226 Difference]: Without dead ends: 202 [2021-08-27 04:26:16,326 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 101.7ms TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-08-27 04:26:16,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-08-27 04:26:16,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2021-08-27 04:26:16,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 135 states have (on average 1.6296296296296295) internal successors, (220), 197 states have internal predecessors, (220), 2 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,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 223 transitions. [2021-08-27 04:26:16,330 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 223 transitions. Word has length 19 [2021-08-27 04:26:16,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:16,330 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 223 transitions. [2021-08-27 04:26:16,330 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 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,330 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 223 transitions. [2021-08-27 04:26:16,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-08-27 04:26:16,331 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:16,331 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:16,331 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-27 04:26:16,331 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr16REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-08-27 04:26:16,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:16,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1319486371, now seen corresponding path program 1 times [2021-08-27 04:26:16,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:16,332 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60729297] [2021-08-27 04:26:16,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:16,332 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:16,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:16,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:16,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:16,468 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,469 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:16,469 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60729297] [2021-08-27 04:26:16,469 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60729297] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:16,469 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:16,469 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 04:26:16,469 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585215970] [2021-08-27 04:26:16,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 04:26:16,470 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:16,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 04:26:16,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-08-27 04:26:16,471 INFO L87 Difference]: Start difference. First operand 201 states and 223 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 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,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:16,960 INFO L93 Difference]: Finished difference Result 201 states and 222 transitions. [2021-08-27 04:26:16,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 04:26:16,961 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 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 19 [2021-08-27 04:26:16,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:16,961 INFO L225 Difference]: With dead ends: 201 [2021-08-27 04:26:16,962 INFO L226 Difference]: Without dead ends: 201 [2021-08-27 04:26:16,965 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 154.3ms TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-08-27 04:26:16,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-08-27 04:26:16,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 200. [2021-08-27 04:26:16,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 135 states have (on average 1.6222222222222222) internal successors, (219), 196 states have internal predecessors, (219), 2 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,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 222 transitions. [2021-08-27 04:26:16,968 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 222 transitions. Word has length 19 [2021-08-27 04:26:16,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:16,968 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 222 transitions. [2021-08-27 04:26:16,968 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 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,968 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 222 transitions. [2021-08-27 04:26:16,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-27 04:26:16,969 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:16,969 INFO L512 BasicCegarLoop]: trace histogram [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:16,969 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-27 04:26:16,969 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr21ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-08-27 04:26:16,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:16,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1961307727, now seen corresponding path program 1 times [2021-08-27 04:26:16,972 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:16,973 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684832423] [2021-08-27 04:26:16,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:16,973 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:16,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:17,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:17,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:17,066 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:17,066 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:17,066 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684832423] [2021-08-27 04:26:17,066 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684832423] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:17,066 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:17,066 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 04:26:17,066 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004546574] [2021-08-27 04:26:17,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 04:26:17,067 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:17,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 04:26:17,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-08-27 04:26:17,068 INFO L87 Difference]: Start difference. First operand 200 states and 222 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 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,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:17,374 INFO L93 Difference]: Finished difference Result 287 states and 315 transitions. [2021-08-27 04:26:17,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 04:26:17,375 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 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 20 [2021-08-27 04:26:17,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:17,376 INFO L225 Difference]: With dead ends: 287 [2021-08-27 04:26:17,376 INFO L226 Difference]: Without dead ends: 287 [2021-08-27 04:26:17,376 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 102.1ms TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-08-27 04:26:17,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2021-08-27 04:26:17,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 197. [2021-08-27 04:26:17,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 133 states have (on average 1.6240601503759398) internal successors, (216), 193 states have internal predecessors, (216), 2 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,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 219 transitions. [2021-08-27 04:26:17,380 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 219 transitions. Word has length 20 [2021-08-27 04:26:17,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:17,382 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 219 transitions. [2021-08-27 04:26:17,382 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 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,382 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 219 transitions. [2021-08-27 04:26:17,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-08-27 04:26:17,384 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:17,384 INFO L512 BasicCegarLoop]: trace histogram [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,384 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-27 04:26:17,385 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr22REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-08-27 04:26:17,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:17,385 INFO L82 PathProgramCache]: Analyzing trace with hash -2122514828, now seen corresponding path program 1 times [2021-08-27 04:26:17,387 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:17,387 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912756266] [2021-08-27 04:26:17,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:17,387 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:17,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:17,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:17,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:17,453 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:17,453 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:17,454 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912756266] [2021-08-27 04:26:17,454 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912756266] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:17,454 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:17,454 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 04:26:17,454 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605091497] [2021-08-27 04:26:17,455 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 04:26:17,455 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:17,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 04:26:17,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 04:26:17,456 INFO L87 Difference]: Start difference. First operand 197 states and 219 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:17,696 INFO L93 Difference]: Finished difference Result 288 states and 315 transitions. [2021-08-27 04:26:17,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 04:26:17,696 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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 22 [2021-08-27 04:26:17,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:17,697 INFO L225 Difference]: With dead ends: 288 [2021-08-27 04:26:17,698 INFO L226 Difference]: Without dead ends: 288 [2021-08-27 04:26:17,698 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 36.1ms TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-08-27 04:26:17,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2021-08-27 04:26:17,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 200. [2021-08-27 04:26:17,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 136 states have (on average 1.6102941176470589) internal successors, (219), 196 states have internal predecessors, (219), 2 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,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 222 transitions. [2021-08-27 04:26:17,701 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 222 transitions. Word has length 22 [2021-08-27 04:26:17,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:17,702 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 222 transitions. [2021-08-27 04:26:17,702 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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,702 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 222 transitions. [2021-08-27 04:26:17,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-27 04:26:17,702 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:17,703 INFO L512 BasicCegarLoop]: trace histogram [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:17,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-27 04:26:17,703 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr22REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-08-27 04:26:17,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:17,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1029388569, now seen corresponding path program 1 times [2021-08-27 04:26:17,704 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:17,704 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863140528] [2021-08-27 04:26:17,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:17,704 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:17,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:17,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:17,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:17,747 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:17,748 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:17,748 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863140528] [2021-08-27 04:26:17,748 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863140528] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:17,748 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:17,748 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 04:26:17,749 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947825033] [2021-08-27 04:26:17,749 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 04:26:17,749 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:17,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 04:26:17,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 04:26:17,750 INFO L87 Difference]: Start difference. First operand 200 states and 222 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:17,979 INFO L93 Difference]: Finished difference Result 195 states and 215 transitions. [2021-08-27 04:26:17,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 04:26:17,979 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 24 [2021-08-27 04:26:17,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:17,980 INFO L225 Difference]: With dead ends: 195 [2021-08-27 04:26:17,980 INFO L226 Difference]: Without dead ends: 195 [2021-08-27 04:26:17,981 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.6ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-27 04:26:17,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-08-27 04:26:17,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 190. [2021-08-27 04:26:17,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 138 states have (on average 1.5144927536231885) internal successors, (209), 186 states have internal predecessors, (209), 2 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,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 212 transitions. [2021-08-27 04:26:17,984 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 212 transitions. Word has length 24 [2021-08-27 04:26:17,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:17,984 INFO L470 AbstractCegarLoop]: Abstraction has 190 states and 212 transitions. [2021-08-27 04:26:17,984 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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,984 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 212 transitions. [2021-08-27 04:26:17,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-27 04:26:17,985 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:17,985 INFO L512 BasicCegarLoop]: trace histogram [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:17,985 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-27 04:26:17,985 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr23REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-08-27 04:26:17,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:17,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1029388570, now seen corresponding path program 1 times [2021-08-27 04:26:17,986 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:17,986 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956082533] [2021-08-27 04:26:17,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:17,986 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:17,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:18,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:18,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:18,041 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:18,041 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:18,041 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956082533] [2021-08-27 04:26:18,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956082533] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:18,041 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:18,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 04:26:18,042 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864079540] [2021-08-27 04:26:18,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 04:26:18,042 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:18,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 04:26:18,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 04:26:18,043 INFO L87 Difference]: Start difference. First operand 190 states and 212 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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:18,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:18,292 INFO L93 Difference]: Finished difference Result 251 states and 266 transitions. [2021-08-27 04:26:18,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 04:26:18,293 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 24 [2021-08-27 04:26:18,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:18,294 INFO L225 Difference]: With dead ends: 251 [2021-08-27 04:26:18,294 INFO L226 Difference]: Without dead ends: 251 [2021-08-27 04:26:18,294 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 24.1ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-27 04:26:18,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2021-08-27 04:26:18,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 214. [2021-08-27 04:26:18,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 162 states have (on average 1.5246913580246915) internal successors, (247), 210 states have internal predecessors, (247), 2 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:18,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 250 transitions. [2021-08-27 04:26:18,298 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 250 transitions. Word has length 24 [2021-08-27 04:26:18,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:18,298 INFO L470 AbstractCegarLoop]: Abstraction has 214 states and 250 transitions. [2021-08-27 04:26:18,298 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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:18,298 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 250 transitions. [2021-08-27 04:26:18,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-27 04:26:18,299 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:18,299 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 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:18,299 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-27 04:26:18,299 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr51ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-08-27 04:26:18,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:18,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1399993902, now seen corresponding path program 1 times [2021-08-27 04:26:18,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:18,300 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622251734] [2021-08-27 04:26:18,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:18,300 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:18,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:18,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:18,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:18,335 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:18,335 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:18,335 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622251734] [2021-08-27 04:26:18,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622251734] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:18,336 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:18,336 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 04:26:18,336 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393498711] [2021-08-27 04:26:18,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 04:26:18,336 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:18,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 04:26:18,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 04:26:18,337 INFO L87 Difference]: Start difference. First operand 214 states and 250 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 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:18,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:18,532 INFO L93 Difference]: Finished difference Result 246 states and 260 transitions. [2021-08-27 04:26:18,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 04:26:18,532 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 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 26 [2021-08-27 04:26:18,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:18,533 INFO L225 Difference]: With dead ends: 246 [2021-08-27 04:26:18,533 INFO L226 Difference]: Without dead ends: 246 [2021-08-27 04:26:18,533 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.0ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-27 04:26:18,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2021-08-27 04:26:18,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 212. [2021-08-27 04:26:18,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 161 states have (on average 1.515527950310559) internal successors, (244), 208 states have internal predecessors, (244), 2 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:18,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 247 transitions. [2021-08-27 04:26:18,537 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 247 transitions. Word has length 26 [2021-08-27 04:26:18,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:18,537 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 247 transitions. [2021-08-27 04:26:18,537 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 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:18,538 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 247 transitions. [2021-08-27 04:26:18,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-27 04:26:18,538 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:18,538 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 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:18,538 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-27 04:26:18,538 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr26REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-08-27 04:26:18,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:18,539 INFO L82 PathProgramCache]: Analyzing trace with hash 448442135, now seen corresponding path program 1 times [2021-08-27 04:26:18,539 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:18,539 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13541444] [2021-08-27 04:26:18,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:18,539 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:18,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:18,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:18,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:18,580 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:18,580 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:18,580 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13541444] [2021-08-27 04:26:18,580 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13541444] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:18,580 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:18,580 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 04:26:18,581 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112243035] [2021-08-27 04:26:18,581 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 04:26:18,581 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:18,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 04:26:18,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 04:26:18,582 INFO L87 Difference]: Start difference. First operand 212 states and 247 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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:18,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:18,800 INFO L93 Difference]: Finished difference Result 211 states and 245 transitions. [2021-08-27 04:26:18,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 04:26:18,800 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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 27 [2021-08-27 04:26:18,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:18,801 INFO L225 Difference]: With dead ends: 211 [2021-08-27 04:26:18,801 INFO L226 Difference]: Without dead ends: 211 [2021-08-27 04:26:18,802 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 27.9ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-27 04:26:18,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-08-27 04:26:18,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2021-08-27 04:26:18,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 161 states have (on average 1.5031055900621118) internal successors, (242), 207 states have internal predecessors, (242), 2 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:18,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 245 transitions. [2021-08-27 04:26:18,805 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 245 transitions. Word has length 27 [2021-08-27 04:26:18,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:18,805 INFO L470 AbstractCegarLoop]: Abstraction has 211 states and 245 transitions. [2021-08-27 04:26:18,805 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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:18,805 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 245 transitions. [2021-08-27 04:26:18,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-27 04:26:18,806 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:18,806 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 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:18,806 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-27 04:26:18,806 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr27REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-08-27 04:26:18,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:18,807 INFO L82 PathProgramCache]: Analyzing trace with hash 448442136, now seen corresponding path program 1 times [2021-08-27 04:26:18,807 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:18,807 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740079484] [2021-08-27 04:26:18,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:18,807 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:18,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:18,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:18,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:18,866 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:18,866 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:18,866 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740079484] [2021-08-27 04:26:18,866 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740079484] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:18,867 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:18,867 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 04:26:18,867 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11296485] [2021-08-27 04:26:18,867 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 04:26:18,867 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:18,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 04:26:18,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 04:26:18,868 INFO L87 Difference]: Start difference. First operand 211 states and 245 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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:19,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:19,105 INFO L93 Difference]: Finished difference Result 210 states and 243 transitions. [2021-08-27 04:26:19,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 04:26:19,106 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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 27 [2021-08-27 04:26:19,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:19,106 INFO L225 Difference]: With dead ends: 210 [2021-08-27 04:26:19,107 INFO L226 Difference]: Without dead ends: 210 [2021-08-27 04:26:19,107 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 41.8ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-27 04:26:19,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2021-08-27 04:26:19,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2021-08-27 04:26:19,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 161 states have (on average 1.4906832298136645) internal successors, (240), 206 states have internal predecessors, (240), 2 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:19,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 243 transitions. [2021-08-27 04:26:19,110 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 243 transitions. Word has length 27 [2021-08-27 04:26:19,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:19,110 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 243 transitions. [2021-08-27 04:26:19,110 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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:19,111 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 243 transitions. [2021-08-27 04:26:19,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-27 04:26:19,111 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:19,111 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 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,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-27 04:26:19,111 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr30REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-08-27 04:26:19,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:19,112 INFO L82 PathProgramCache]: Analyzing trace with hash -784939815, now seen corresponding path program 1 times [2021-08-27 04:26:19,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:19,112 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491048085] [2021-08-27 04:26:19,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:19,112 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:19,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:19,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:19,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:19,204 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:19,204 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:19,204 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491048085] [2021-08-27 04:26:19,206 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491048085] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:19,206 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:19,206 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-27 04:26:19,207 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482057306] [2021-08-27 04:26:19,207 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 04:26:19,207 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:19,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 04:26:19,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-08-27 04:26:19,208 INFO L87 Difference]: Start difference. First operand 210 states and 243 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 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:19,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:19,635 INFO L93 Difference]: Finished difference Result 210 states and 242 transitions. [2021-08-27 04:26:19,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 04:26:19,636 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 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 31 [2021-08-27 04:26:19,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:19,637 INFO L225 Difference]: With dead ends: 210 [2021-08-27 04:26:19,637 INFO L226 Difference]: Without dead ends: 210 [2021-08-27 04:26:19,637 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 109.1ms TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2021-08-27 04:26:19,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2021-08-27 04:26:19,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2021-08-27 04:26:19,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 161 states have (on average 1.484472049689441) internal successors, (239), 205 states have internal predecessors, (239), 2 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:19,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 242 transitions. [2021-08-27 04:26:19,641 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 242 transitions. Word has length 31 [2021-08-27 04:26:19,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:19,641 INFO L470 AbstractCegarLoop]: Abstraction has 209 states and 242 transitions. [2021-08-27 04:26:19,642 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 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:19,642 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 242 transitions. [2021-08-27 04:26:19,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-27 04:26:19,642 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:19,642 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 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,642 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-27 04:26:19,642 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr31REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-08-27 04:26:19,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:19,643 INFO L82 PathProgramCache]: Analyzing trace with hash -784939814, now seen corresponding path program 1 times [2021-08-27 04:26:19,644 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:19,644 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510557384] [2021-08-27 04:26:19,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:19,644 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:19,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:19,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:19,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:19,779 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:19,779 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:19,779 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510557384] [2021-08-27 04:26:19,779 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510557384] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:19,780 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:19,780 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-27 04:26:19,780 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230597335] [2021-08-27 04:26:19,780 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-27 04:26:19,780 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:19,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 04:26:19,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-08-27 04:26:19,783 INFO L87 Difference]: Start difference. First operand 209 states and 242 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 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:20,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:20,438 INFO L93 Difference]: Finished difference Result 202 states and 234 transitions. [2021-08-27 04:26:20,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-27 04:26:20,438 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 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 31 [2021-08-27 04:26:20,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:20,439 INFO L225 Difference]: With dead ends: 202 [2021-08-27 04:26:20,439 INFO L226 Difference]: Without dead ends: 202 [2021-08-27 04:26:20,440 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 274.2ms TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2021-08-27 04:26:20,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-08-27 04:26:20,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 191. [2021-08-27 04:26:20,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 153 states have (on average 1.4379084967320261) internal successors, (220), 187 states have internal predecessors, (220), 2 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:20,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 223 transitions. [2021-08-27 04:26:20,443 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 223 transitions. Word has length 31 [2021-08-27 04:26:20,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:20,443 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 223 transitions. [2021-08-27 04:26:20,443 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 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:20,443 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 223 transitions. [2021-08-27 04:26:20,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-08-27 04:26:20,444 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:20,444 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 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,444 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-27 04:26:20,444 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr63ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-08-27 04:26:20,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:20,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1236512538, now seen corresponding path program 1 times [2021-08-27 04:26:20,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:20,445 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246467125] [2021-08-27 04:26:20,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:20,445 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:20,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:20,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:20,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:20,478 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:20,478 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:20,478 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246467125] [2021-08-27 04:26:20,478 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246467125] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:20,478 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:20,479 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 04:26:20,479 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734430811] [2021-08-27 04:26:20,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 04:26:20,480 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:20,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 04:26:20,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:20,481 INFO L87 Difference]: Start difference. First operand 191 states and 223 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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:20,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:20,618 INFO L93 Difference]: Finished difference Result 264 states and 311 transitions. [2021-08-27 04:26:20,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 04:26:20,619 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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 32 [2021-08-27 04:26:20,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:20,620 INFO L225 Difference]: With dead ends: 264 [2021-08-27 04:26:20,621 INFO L226 Difference]: Without dead ends: 264 [2021-08-27 04:26:20,621 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.8ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:20,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2021-08-27 04:26:20,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 197. [2021-08-27 04:26:20,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 159 states have (on average 1.4339622641509433) internal successors, (228), 193 states have internal predecessors, (228), 2 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:20,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 231 transitions. [2021-08-27 04:26:20,624 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 231 transitions. Word has length 32 [2021-08-27 04:26:20,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:20,625 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 231 transitions. [2021-08-27 04:26:20,625 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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:20,625 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 231 transitions. [2021-08-27 04:26:20,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-08-27 04:26:20,625 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:20,625 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 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,626 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-27 04:26:20,626 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr54ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-08-27 04:26:20,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:20,626 INFO L82 PathProgramCache]: Analyzing trace with hash -322828341, now seen corresponding path program 1 times [2021-08-27 04:26:20,626 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:20,626 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145757049] [2021-08-27 04:26:20,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:20,627 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:20,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:20,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:20,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:20,666 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:20,666 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:20,666 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145757049] [2021-08-27 04:26:20,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145757049] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:20,666 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:20,666 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 04:26:20,667 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743765494] [2021-08-27 04:26:20,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 04:26:20,668 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:20,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 04:26:20,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:20,668 INFO L87 Difference]: Start difference. First operand 197 states and 231 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 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:20,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:20,796 INFO L93 Difference]: Finished difference Result 195 states and 228 transitions. [2021-08-27 04:26:20,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 04:26:20,797 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 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 33 [2021-08-27 04:26:20,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:20,797 INFO L225 Difference]: With dead ends: 195 [2021-08-27 04:26:20,797 INFO L226 Difference]: Without dead ends: 195 [2021-08-27 04:26:20,798 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.2ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:20,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-08-27 04:26:20,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2021-08-27 04:26:20,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 158 states have (on average 1.4240506329113924) internal successors, (225), 191 states have internal predecessors, (225), 2 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:20,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 228 transitions. [2021-08-27 04:26:20,801 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 228 transitions. Word has length 33 [2021-08-27 04:26:20,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:20,801 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 228 transitions. [2021-08-27 04:26:20,801 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 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:20,801 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 228 transitions. [2021-08-27 04:26:20,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-08-27 04:26:20,801 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:20,802 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 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,802 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-27 04:26:20,802 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr32ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-08-27 04:26:20,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:20,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1587084985, now seen corresponding path program 1 times [2021-08-27 04:26:20,802 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:20,802 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529425527] [2021-08-27 04:26:20,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:20,803 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:20,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:20,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:20,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:20,891 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:20,892 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:20,892 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529425527] [2021-08-27 04:26:20,892 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529425527] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:20,892 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:20,892 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-27 04:26:20,892 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369769657] [2021-08-27 04:26:20,893 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-27 04:26:20,893 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:20,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 04:26:20,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-08-27 04:26:20,893 INFO L87 Difference]: Start difference. First operand 195 states and 228 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 10 states have internal predecessors, (30), 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:21,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:21,380 INFO L93 Difference]: Finished difference Result 202 states and 235 transitions. [2021-08-27 04:26:21,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-27 04:26:21,380 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 10 states have internal predecessors, (30), 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 33 [2021-08-27 04:26:21,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:21,387 INFO L225 Difference]: With dead ends: 202 [2021-08-27 04:26:21,387 INFO L226 Difference]: Without dead ends: 202 [2021-08-27 04:26:21,387 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 176.3ms TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2021-08-27 04:26:21,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-08-27 04:26:21,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 191. [2021-08-27 04:26:21,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 156 states have (on average 1.4166666666666667) internal successors, (221), 187 states have internal predecessors, (221), 2 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:21,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 224 transitions. [2021-08-27 04:26:21,390 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 224 transitions. Word has length 33 [2021-08-27 04:26:21,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:21,390 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 224 transitions. [2021-08-27 04:26:21,390 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 10 states have internal predecessors, (30), 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:21,390 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 224 transitions. [2021-08-27 04:26:21,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-08-27 04:26:21,391 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:21,391 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-27 04:26:21,391 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr55REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-08-27 04:26:21,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:21,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1417739633, now seen corresponding path program 1 times [2021-08-27 04:26:21,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:21,392 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653406405] [2021-08-27 04:26:21,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:21,392 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:21,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:21,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:21,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:21,481 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:21,481 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:21,481 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653406405] [2021-08-27 04:26:21,481 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653406405] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:21,481 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:21,481 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-27 04:26:21,482 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943670546] [2021-08-27 04:26:21,482 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 04:26:21,482 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:21,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 04:26:21,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-08-27 04:26:21,483 INFO L87 Difference]: Start difference. First operand 191 states and 224 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 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:21,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:21,865 INFO L93 Difference]: Finished difference Result 295 states and 336 transitions. [2021-08-27 04:26:21,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 04:26:21,865 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 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 34 [2021-08-27 04:26:21,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:21,866 INFO L225 Difference]: With dead ends: 295 [2021-08-27 04:26:21,866 INFO L226 Difference]: Without dead ends: 295 [2021-08-27 04:26:21,866 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 105.6ms TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2021-08-27 04:26:21,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2021-08-27 04:26:21,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 203. [2021-08-27 04:26:21,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 168 states have (on average 1.3928571428571428) internal successors, (234), 199 states have internal predecessors, (234), 2 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:21,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 237 transitions. [2021-08-27 04:26:21,870 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 237 transitions. Word has length 34 [2021-08-27 04:26:21,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:21,870 INFO L470 AbstractCegarLoop]: Abstraction has 203 states and 237 transitions. [2021-08-27 04:26:21,870 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 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:21,871 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 237 transitions. [2021-08-27 04:26:21,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-27 04:26:21,871 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:21,871 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:21,871 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-27 04:26:21,871 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr52REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-08-27 04:26:21,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:21,872 INFO L82 PathProgramCache]: Analyzing trace with hash -477422014, now seen corresponding path program 1 times [2021-08-27 04:26:21,872 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:21,872 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113315540] [2021-08-27 04:26:21,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:21,872 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:21,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:21,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:21,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:21,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:21,965 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:21,965 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113315540] [2021-08-27 04:26:21,966 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113315540] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 04:26:21,966 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220644139] [2021-08-27 04:26:21,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:21,966 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 04:26:21,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 04:26:21,967 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 04:26:21,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-08-27 04:26:22,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:22,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 21 conjunts are in the unsatisfiable core [2021-08-27 04:26:22,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:26:22,206 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 04:26:22,211 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 04:26:22,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 04:26:22,240 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-08-27 04:26:22,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 04:26:22,247 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-08-27 04:26:22,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 04:26:22,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 04:26:22,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 04:26:22,380 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-27 04:26:22,382 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2021-08-27 04:26:22,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 04:26:22,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 04:26:22,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 04:26:22,394 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-08-27 04:26:22,899 INFO L354 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2021-08-27 04:26:22,899 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 50 [2021-08-27 04:26:22,913 INFO L354 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2021-08-27 04:26:22,914 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 25 [2021-08-27 04:26:22,929 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:22,930 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220644139] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 04:26:22,930 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 04:26:22,930 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 12 [2021-08-27 04:26:22,931 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707470797] [2021-08-27 04:26:22,931 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 04:26:22,932 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:22,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 04:26:22,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-08-27 04:26:22,932 INFO L87 Difference]: Start difference. First operand 203 states and 237 transitions. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 1 states have call successors, (3), 2 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,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:23,491 INFO L93 Difference]: Finished difference Result 344 states and 376 transitions. [2021-08-27 04:26:23,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-27 04:26:23,493 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 1 states have call successors, (3), 2 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:23,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:23,494 INFO L225 Difference]: With dead ends: 344 [2021-08-27 04:26:23,494 INFO L226 Difference]: Without dead ends: 344 [2021-08-27 04:26:23,494 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 245.9ms TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2021-08-27 04:26:23,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2021-08-27 04:26:23,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 231. [2021-08-27 04:26:23,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 196 states have (on average 1.403061224489796) internal successors, (275), 227 states have internal predecessors, (275), 2 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:23,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 278 transitions. [2021-08-27 04:26:23,498 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 278 transitions. Word has length 36 [2021-08-27 04:26:23,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:23,498 INFO L470 AbstractCegarLoop]: Abstraction has 231 states and 278 transitions. [2021-08-27 04:26:23,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 1 states have call successors, (3), 2 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,498 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 278 transitions. [2021-08-27 04:26:23,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-08-27 04:26:23,499 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:23,499 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-08-27 04:26:23,712 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-08-27 04:26:23,713 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr55REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-08-27 04:26:23,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:23,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1233959113, now seen corresponding path program 1 times [2021-08-27 04:26:23,713 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:23,713 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55139782] [2021-08-27 04:26:23,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:23,714 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:23,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:23,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:23,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:23,852 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:23,852 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:23,853 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55139782] [2021-08-27 04:26:23,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55139782] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:23,853 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:23,853 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-27 04:26:23,853 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862278427] [2021-08-27 04:26:23,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 04:26:23,854 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:23,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 04:26:23,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-08-27 04:26:23,854 INFO L87 Difference]: Start difference. First operand 231 states and 278 transitions. Second operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 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:24,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:24,504 INFO L93 Difference]: Finished difference Result 338 states and 376 transitions. [2021-08-27 04:26:24,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-27 04:26:24,505 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 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 39 [2021-08-27 04:26:24,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:24,506 INFO L225 Difference]: With dead ends: 338 [2021-08-27 04:26:24,506 INFO L226 Difference]: Without dead ends: 338 [2021-08-27 04:26:24,506 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 180.3ms TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2021-08-27 04:26:24,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2021-08-27 04:26:24,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 232. [2021-08-27 04:26:24,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 199 states have (on average 1.3718592964824121) internal successors, (273), 228 states have internal predecessors, (273), 2 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:24,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 276 transitions. [2021-08-27 04:26:24,510 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 276 transitions. Word has length 39 [2021-08-27 04:26:24,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:24,511 INFO L470 AbstractCegarLoop]: Abstraction has 232 states and 276 transitions. [2021-08-27 04:26:24,511 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 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:24,511 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 276 transitions. [2021-08-27 04:26:24,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-08-27 04:26:24,511 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:24,511 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-08-27 04:26:24,512 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr56REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-08-27 04:26:24,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:24,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1233959114, now seen corresponding path program 1 times [2021-08-27 04:26:24,512 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:24,512 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367450162] [2021-08-27 04:26:24,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:24,513 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:24,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:24,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:24,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:24,726 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:24,726 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:24,726 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367450162] [2021-08-27 04:26:24,727 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367450162] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:24,727 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:24,727 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-27 04:26:24,727 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173818561] [2021-08-27 04:26:24,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-27 04:26:24,727 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:24,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-27 04:26:24,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2021-08-27 04:26:24,728 INFO L87 Difference]: Start difference. First operand 232 states and 276 transitions. Second operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 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:25,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:25,545 INFO L93 Difference]: Finished difference Result 404 states and 436 transitions. [2021-08-27 04:26:25,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-27 04:26:25,545 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 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 39 [2021-08-27 04:26:25,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:25,546 INFO L225 Difference]: With dead ends: 404 [2021-08-27 04:26:25,546 INFO L226 Difference]: Without dead ends: 404 [2021-08-27 04:26:25,547 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 291.9ms TimeCoverageRelationStatistics Valid=133, Invalid=517, Unknown=0, NotChecked=0, Total=650 [2021-08-27 04:26:25,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2021-08-27 04:26:25,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 238. [2021-08-27 04:26:25,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 205 states have (on average 1.3658536585365855) internal successors, (280), 234 states have internal predecessors, (280), 2 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:25,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 283 transitions. [2021-08-27 04:26:25,550 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 283 transitions. Word has length 39 [2021-08-27 04:26:25,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:25,551 INFO L470 AbstractCegarLoop]: Abstraction has 238 states and 283 transitions. [2021-08-27 04:26:25,551 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 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:25,551 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 283 transitions. [2021-08-27 04:26:25,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-08-27 04:26:25,551 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:25,551 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25,552 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-08-27 04:26:25,552 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr68ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-08-27 04:26:25,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:25,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1461137672, now seen corresponding path program 1 times [2021-08-27 04:26:25,552 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:25,552 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15458698] [2021-08-27 04:26:25,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:25,553 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:25,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:25,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:25,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:25,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 04:26:25,629 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:25,629 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15458698] [2021-08-27 04:26:25,629 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15458698] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:25,629 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:25,629 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 04:26:25,629 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586746740] [2021-08-27 04:26:25,630 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 04:26:25,630 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:25,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 04:26:25,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-08-27 04:26:25,630 INFO L87 Difference]: Start difference. First operand 238 states and 283 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 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:25,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:25,897 INFO L93 Difference]: Finished difference Result 254 states and 299 transitions. [2021-08-27 04:26:25,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 04:26:25,897 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 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 41 [2021-08-27 04:26:25,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:25,899 INFO L225 Difference]: With dead ends: 254 [2021-08-27 04:26:25,899 INFO L226 Difference]: Without dead ends: 254 [2021-08-27 04:26:25,899 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 74.9ms TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-08-27 04:26:25,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2021-08-27 04:26:25,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 247. [2021-08-27 04:26:25,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 214 states have (on average 1.3504672897196262) internal successors, (289), 243 states have internal predecessors, (289), 2 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:25,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 292 transitions. [2021-08-27 04:26:25,903 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 292 transitions. Word has length 41 [2021-08-27 04:26:25,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:25,903 INFO L470 AbstractCegarLoop]: Abstraction has 247 states and 292 transitions. [2021-08-27 04:26:25,903 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 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:25,903 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 292 transitions. [2021-08-27 04:26:25,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-08-27 04:26:25,904 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:25,904 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25,904 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-08-27 04:26:25,904 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr40REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-08-27 04:26:25,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:25,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1117706321, now seen corresponding path program 1 times [2021-08-27 04:26:25,905 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:25,905 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152640755] [2021-08-27 04:26:25,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:25,905 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:25,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:25,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:25,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:25,955 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:25,955 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:25,956 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152640755] [2021-08-27 04:26:25,956 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152640755] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:25,956 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:25,956 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 04:26:25,956 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193140206] [2021-08-27 04:26:25,956 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 04:26:25,957 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:25,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 04:26:25,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 04:26:25,958 INFO L87 Difference]: Start difference. First operand 247 states and 292 transitions. Second operand has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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:26,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:26,165 INFO L93 Difference]: Finished difference Result 246 states and 291 transitions. [2021-08-27 04:26:26,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 04:26:26,166 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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 41 [2021-08-27 04:26:26,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:26,167 INFO L225 Difference]: With dead ends: 246 [2021-08-27 04:26:26,167 INFO L226 Difference]: Without dead ends: 246 [2021-08-27 04:26:26,167 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 32.4ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-27 04:26:26,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2021-08-27 04:26:26,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2021-08-27 04:26:26,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 214 states have (on average 1.3457943925233644) internal successors, (288), 242 states have internal predecessors, (288), 2 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:26,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 291 transitions. [2021-08-27 04:26:26,170 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 291 transitions. Word has length 41 [2021-08-27 04:26:26,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:26,171 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 291 transitions. [2021-08-27 04:26:26,171 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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:26,171 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 291 transitions. [2021-08-27 04:26:26,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-08-27 04:26:26,171 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:26,171 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,172 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-08-27 04:26:26,172 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr41REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-08-27 04:26:26,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:26,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1117706320, now seen corresponding path program 1 times [2021-08-27 04:26:26,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:26,172 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923211275] [2021-08-27 04:26:26,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:26,173 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:26,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:26,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:26,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:26,226 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:26,227 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:26,227 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923211275] [2021-08-27 04:26:26,227 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923211275] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:26,227 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:26,227 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 04:26:26,227 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784677521] [2021-08-27 04:26:26,228 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 04:26:26,228 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:26,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 04:26:26,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 04:26:26,228 INFO L87 Difference]: Start difference. First operand 246 states and 291 transitions. Second operand has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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:26,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:26,453 INFO L93 Difference]: Finished difference Result 245 states and 290 transitions. [2021-08-27 04:26:26,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 04:26:26,454 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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 41 [2021-08-27 04:26:26,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:26,454 INFO L225 Difference]: With dead ends: 245 [2021-08-27 04:26:26,454 INFO L226 Difference]: Without dead ends: 245 [2021-08-27 04:26:26,455 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 39.5ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-27 04:26:26,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2021-08-27 04:26:26,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2021-08-27 04:26:26,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 214 states have (on average 1.341121495327103) internal successors, (287), 241 states have internal predecessors, (287), 2 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:26,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 290 transitions. [2021-08-27 04:26:26,458 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 290 transitions. Word has length 41 [2021-08-27 04:26:26,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:26,458 INFO L470 AbstractCegarLoop]: Abstraction has 245 states and 290 transitions. [2021-08-27 04:26:26,458 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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:26,458 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 290 transitions. [2021-08-27 04:26:26,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-08-27 04:26:26,458 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:26,458 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,458 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-08-27 04:26:26,458 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr57ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-08-27 04:26:26,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:26,459 INFO L82 PathProgramCache]: Analyzing trace with hash 423742185, now seen corresponding path program 1 times [2021-08-27 04:26:26,459 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:26,459 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650505010] [2021-08-27 04:26:26,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:26,459 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:26,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:26,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:26,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:26,717 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:26,718 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:26,718 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650505010] [2021-08-27 04:26:26,718 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650505010] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:26,718 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:26,718 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-08-27 04:26:26,718 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948482296] [2021-08-27 04:26:26,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-27 04:26:26,719 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:26,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-27 04:26:26,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-08-27 04:26:26,719 INFO L87 Difference]: Start difference. First operand 245 states and 290 transitions. Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 14 states have internal predecessors, (38), 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:27,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:27,612 INFO L93 Difference]: Finished difference Result 413 states and 445 transitions. [2021-08-27 04:26:27,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-08-27 04:26:27,612 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 14 states have internal predecessors, (38), 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 41 [2021-08-27 04:26:27,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:27,613 INFO L225 Difference]: With dead ends: 413 [2021-08-27 04:26:27,614 INFO L226 Difference]: Without dead ends: 413 [2021-08-27 04:26:27,614 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 439.8ms TimeCoverageRelationStatistics Valid=181, Invalid=749, Unknown=0, NotChecked=0, Total=930 [2021-08-27 04:26:27,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2021-08-27 04:26:27,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 245. [2021-08-27 04:26:27,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 214 states have (on average 1.3364485981308412) internal successors, (286), 241 states have internal predecessors, (286), 2 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:27,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 289 transitions. [2021-08-27 04:26:27,617 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 289 transitions. Word has length 41 [2021-08-27 04:26:27,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:27,618 INFO L470 AbstractCegarLoop]: Abstraction has 245 states and 289 transitions. [2021-08-27 04:26:27,618 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 14 states have internal predecessors, (38), 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:27,618 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 289 transitions. [2021-08-27 04:26:27,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-08-27 04:26:27,618 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:27,618 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-08-27 04:26:27,619 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting mainErr81ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-08-27 04:26:27,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:27,619 INFO L82 PathProgramCache]: Analyzing trace with hash 363878013, now seen corresponding path program 1 times [2021-08-27 04:26:27,619 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:27,619 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281167203] [2021-08-27 04:26:27,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:27,620 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:27,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:27,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:27,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:27,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 04:26:27,655 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:27,656 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281167203] [2021-08-27 04:26:27,656 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281167203] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:27,656 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:27,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 04:26:27,656 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268243187] [2021-08-27 04:26:27,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 04:26:27,656 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:27,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 04:26:27,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:27,657 INFO L87 Difference]: Start difference. First operand 245 states and 289 transitions. Second operand has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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:27,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:27,822 INFO L93 Difference]: Finished difference Result 258 states and 293 transitions. [2021-08-27 04:26:27,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 04:26:27,823 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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 43 [2021-08-27 04:26:27,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:27,823 INFO L225 Difference]: With dead ends: 258 [2021-08-27 04:26:27,824 INFO L226 Difference]: Without dead ends: 258 [2021-08-27 04:26:27,824 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.2ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:27,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2021-08-27 04:26:27,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 246. [2021-08-27 04:26:27,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 215 states have (on average 1.3348837209302327) internal successors, (287), 242 states have internal predecessors, (287), 2 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:27,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 290 transitions. [2021-08-27 04:26:27,827 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 290 transitions. Word has length 43 [2021-08-27 04:26:27,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:27,827 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 290 transitions. [2021-08-27 04:26:27,827 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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:27,827 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 290 transitions. [2021-08-27 04:26:27,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-08-27 04:26:27,828 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:27,828 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,828 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-08-27 04:26:27,828 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting mainErr50ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-08-27 04:26:27,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:27,828 INFO L82 PathProgramCache]: Analyzing trace with hash -642403391, now seen corresponding path program 1 times [2021-08-27 04:26:27,828 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:27,829 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558527746] [2021-08-27 04:26:27,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:27,829 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:27,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:27,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:27,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:27,859 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:27,859 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:27,859 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558527746] [2021-08-27 04:26:27,859 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558527746] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:27,859 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:27,860 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 04:26:27,860 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622859913] [2021-08-27 04:26:27,860 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 04:26:27,860 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:27,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 04:26:27,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:27,861 INFO L87 Difference]: Start difference. First operand 246 states and 290 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 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:27,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:27,990 INFO L93 Difference]: Finished difference Result 247 states and 291 transitions. [2021-08-27 04:26:27,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 04:26:27,990 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 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 43 [2021-08-27 04:26:27,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:27,991 INFO L225 Difference]: With dead ends: 247 [2021-08-27 04:26:27,991 INFO L226 Difference]: Without dead ends: 247 [2021-08-27 04:26:27,991 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.2ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:27,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2021-08-27 04:26:27,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2021-08-27 04:26:27,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 216 states have (on average 1.3333333333333333) internal successors, (288), 243 states have internal predecessors, (288), 2 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:27,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 291 transitions. [2021-08-27 04:26:27,995 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 291 transitions. Word has length 43 [2021-08-27 04:26:27,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:27,995 INFO L470 AbstractCegarLoop]: Abstraction has 247 states and 291 transitions. [2021-08-27 04:26:27,995 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 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:27,996 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 291 transitions. [2021-08-27 04:26:27,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-08-27 04:26:27,996 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:27,996 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,996 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-08-27 04:26:27,996 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting mainErr44REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-08-27 04:26:27,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:27,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1292581990, now seen corresponding path program 1 times [2021-08-27 04:26:27,997 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:27,997 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960554831] [2021-08-27 04:26:27,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:27,997 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:28,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:28,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:28,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:28,078 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:28,078 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:28,078 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960554831] [2021-08-27 04:26:28,078 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960554831] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:28,078 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:28,078 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 04:26:28,079 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083951976] [2021-08-27 04:26:28,079 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 04:26:28,079 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:28,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 04:26:28,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-08-27 04:26:28,080 INFO L87 Difference]: Start difference. First operand 247 states and 291 transitions. Second operand has 9 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 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:28,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:28,408 INFO L93 Difference]: Finished difference Result 247 states and 291 transitions. [2021-08-27 04:26:28,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 04:26:28,408 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 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 44 [2021-08-27 04:26:28,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:28,409 INFO L225 Difference]: With dead ends: 247 [2021-08-27 04:26:28,409 INFO L226 Difference]: Without dead ends: 247 [2021-08-27 04:26:28,409 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 105.7ms TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-08-27 04:26:28,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2021-08-27 04:26:28,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 246. [2021-08-27 04:26:28,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 216 states have (on average 1.3287037037037037) internal successors, (287), 242 states have internal predecessors, (287), 2 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:28,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 290 transitions. [2021-08-27 04:26:28,413 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 290 transitions. Word has length 44 [2021-08-27 04:26:28,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:28,413 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 290 transitions. [2021-08-27 04:26:28,413 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 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:28,413 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 290 transitions. [2021-08-27 04:26:28,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-08-27 04:26:28,413 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:28,414 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28,414 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-08-27 04:26:28,414 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting mainErr45REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-08-27 04:26:28,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:28,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1292581991, now seen corresponding path program 1 times [2021-08-27 04:26:28,414 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:28,415 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161243850] [2021-08-27 04:26:28,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:28,415 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:28,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:28,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:28,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:28,521 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:28,522 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:28,522 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161243850] [2021-08-27 04:26:28,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161243850] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:28,522 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:28,522 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 04:26:28,522 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47567437] [2021-08-27 04:26:28,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 04:26:28,523 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:28,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 04:26:28,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-08-27 04:26:28,523 INFO L87 Difference]: Start difference. First operand 246 states and 290 transitions. Second operand has 9 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 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:28,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:28,915 INFO L93 Difference]: Finished difference Result 246 states and 290 transitions. [2021-08-27 04:26:28,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 04:26:28,915 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 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 44 [2021-08-27 04:26:28,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:28,916 INFO L225 Difference]: With dead ends: 246 [2021-08-27 04:26:28,916 INFO L226 Difference]: Without dead ends: 246 [2021-08-27 04:26:28,916 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 136.3ms TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-08-27 04:26:28,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2021-08-27 04:26:28,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 245. [2021-08-27 04:26:28,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 216 states have (on average 1.3240740740740742) internal successors, (286), 241 states have internal predecessors, (286), 2 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:28,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 289 transitions. [2021-08-27 04:26:28,919 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 289 transitions. Word has length 44 [2021-08-27 04:26:28,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:28,920 INFO L470 AbstractCegarLoop]: Abstraction has 245 states and 289 transitions. [2021-08-27 04:26:28,920 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 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:28,920 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 289 transitions. [2021-08-27 04:26:28,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-08-27 04:26:28,920 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:28,920 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28,921 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-08-27 04:26:28,921 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting mainErr60ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-08-27 04:26:28,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:28,921 INFO L82 PathProgramCache]: Analyzing trace with hash 798755045, now seen corresponding path program 1 times [2021-08-27 04:26:28,921 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:28,921 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88699874] [2021-08-27 04:26:28,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:28,922 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:28,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 04:26:28,931 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 04:26:28,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 04:26:28,952 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 04:26:28,953 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-27 04:26:28,953 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location mainErr60ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 04:26:28,954 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr0REQUIRES_VIOLATION [2021-08-27 04:26:28,955 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr1REQUIRES_VIOLATION [2021-08-27 04:26:28,955 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr2REQUIRES_VIOLATION [2021-08-27 04:26:28,955 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr3REQUIRES_VIOLATION [2021-08-27 04:26:28,955 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr4ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 04:26:28,955 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr5REQUIRES_VIOLATION [2021-08-27 04:26:28,955 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr6REQUIRES_VIOLATION [2021-08-27 04:26:28,955 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr7REQUIRES_VIOLATION [2021-08-27 04:26:28,955 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr8REQUIRES_VIOLATION [2021-08-27 04:26:28,956 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr9REQUIRES_VIOLATION [2021-08-27 04:26:28,956 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr10REQUIRES_VIOLATION [2021-08-27 04:26:28,956 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr11REQUIRES_VIOLATION [2021-08-27 04:26:28,956 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr12REQUIRES_VIOLATION [2021-08-27 04:26:28,956 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr13REQUIRES_VIOLATION [2021-08-27 04:26:28,956 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr14REQUIRES_VIOLATION [2021-08-27 04:26:28,956 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr15REQUIRES_VIOLATION [2021-08-27 04:26:28,956 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr16REQUIRES_VIOLATION [2021-08-27 04:26:28,957 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr17REQUIRES_VIOLATION [2021-08-27 04:26:28,957 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr18REQUIRES_VIOLATION [2021-08-27 04:26:28,957 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr19REQUIRES_VIOLATION [2021-08-27 04:26:28,957 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr20REQUIRES_VIOLATION [2021-08-27 04:26:28,957 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr21ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 04:26:28,957 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr22REQUIRES_VIOLATION [2021-08-27 04:26:28,957 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr23REQUIRES_VIOLATION [2021-08-27 04:26:28,957 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr24REQUIRES_VIOLATION [2021-08-27 04:26:28,958 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr25REQUIRES_VIOLATION [2021-08-27 04:26:28,958 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr26REQUIRES_VIOLATION [2021-08-27 04:26:28,958 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr27REQUIRES_VIOLATION [2021-08-27 04:26:28,958 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr28REQUIRES_VIOLATION [2021-08-27 04:26:28,958 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr29REQUIRES_VIOLATION [2021-08-27 04:26:28,958 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr30REQUIRES_VIOLATION [2021-08-27 04:26:28,958 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr31REQUIRES_VIOLATION [2021-08-27 04:26:28,958 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr32ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 04:26:28,959 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr33ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 04:26:28,959 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr34REQUIRES_VIOLATION [2021-08-27 04:26:28,959 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr35REQUIRES_VIOLATION [2021-08-27 04:26:28,959 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr36REQUIRES_VIOLATION [2021-08-27 04:26:28,959 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr37REQUIRES_VIOLATION [2021-08-27 04:26:28,959 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr38REQUIRES_VIOLATION [2021-08-27 04:26:28,959 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr39REQUIRES_VIOLATION [2021-08-27 04:26:28,959 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr40REQUIRES_VIOLATION [2021-08-27 04:26:28,960 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr41REQUIRES_VIOLATION [2021-08-27 04:26:28,960 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr42REQUIRES_VIOLATION [2021-08-27 04:26:28,960 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr43REQUIRES_VIOLATION [2021-08-27 04:26:28,960 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr44REQUIRES_VIOLATION [2021-08-27 04:26:28,960 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr45REQUIRES_VIOLATION [2021-08-27 04:26:28,960 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr46REQUIRES_VIOLATION [2021-08-27 04:26:28,960 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr47REQUIRES_VIOLATION [2021-08-27 04:26:28,960 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr48REQUIRES_VIOLATION [2021-08-27 04:26:28,960 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr49REQUIRES_VIOLATION [2021-08-27 04:26:28,961 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr50ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 04:26:28,961 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr51ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 04:26:28,961 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr52REQUIRES_VIOLATION [2021-08-27 04:26:28,961 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr53REQUIRES_VIOLATION [2021-08-27 04:26:28,961 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr54ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 04:26:28,961 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr55REQUIRES_VIOLATION [2021-08-27 04:26:28,961 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr56REQUIRES_VIOLATION [2021-08-27 04:26:28,962 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr57ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 04:26:28,962 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr58REQUIRES_VIOLATION [2021-08-27 04:26:28,962 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr59REQUIRES_VIOLATION [2021-08-27 04:26:28,962 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr61REQUIRES_VIOLATION [2021-08-27 04:26:28,962 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr62REQUIRES_VIOLATION [2021-08-27 04:26:28,962 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr63ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 04:26:28,962 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr64REQUIRES_VIOLATION [2021-08-27 04:26:28,962 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr65REQUIRES_VIOLATION [2021-08-27 04:26:28,963 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr66REQUIRES_VIOLATION [2021-08-27 04:26:28,963 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr67REQUIRES_VIOLATION [2021-08-27 04:26:28,963 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr68ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 04:26:28,963 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr69REQUIRES_VIOLATION [2021-08-27 04:26:28,963 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr70REQUIRES_VIOLATION [2021-08-27 04:26:28,963 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr71ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 04:26:28,963 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr72REQUIRES_VIOLATION [2021-08-27 04:26:28,963 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr73REQUIRES_VIOLATION [2021-08-27 04:26:28,964 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr74ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 04:26:28,964 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr75ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 04:26:28,964 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr76ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 04:26:28,964 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr77ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 04:26:28,964 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr78REQUIRES_VIOLATION [2021-08-27 04:26:28,964 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr79REQUIRES_VIOLATION [2021-08-27 04:26:28,964 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr80ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 04:26:28,964 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr81ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 04:26:28,965 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr82ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 04:26:28,965 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr83ENSURES_VIOLATIONMEMORY_LEAK [2021-08-27 04:26:28,965 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-08-27 04:26:28,969 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-27 04:26:28,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 04:26:28 BoogieIcfgContainer [2021-08-27 04:26:28,996 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-27 04:26:28,996 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 04:26:28,996 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 04:26:28,996 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 04:26:28,997 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:28,998 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-08-27 04:26:29,021 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-27 04:26:29,021 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 04:26:29,024 INFO L168 Benchmark]: Toolchain (without parser) took 17090.35 ms. Allocated memory was 54.5 MB in the beginning and 251.7 MB in the end (delta: 197.1 MB). Free memory was 31.3 MB in the beginning and 222.6 MB in the end (delta: -191.3 MB). Peak memory consumption was 5.8 MB. Max. memory is 16.1 GB. [2021-08-27 04:26:29,024 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 54.5 MB. Free memory was 36.0 MB in the beginning and 35.9 MB in the end (delta: 44.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 04:26:29,024 INFO L168 Benchmark]: CACSL2BoogieTranslator took 390.82 ms. Allocated memory is still 54.5 MB. Free memory was 31.1 MB in the beginning and 28.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-27 04:26:29,025 INFO L168 Benchmark]: Boogie Preprocessor took 70.90 ms. Allocated memory is still 54.5 MB. Free memory was 28.4 MB in the beginning and 25.2 MB in the end (delta: 3.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-27 04:26:29,025 INFO L168 Benchmark]: RCFGBuilder took 917.52 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 25.0 MB in the beginning and 28.4 MB in the end (delta: -3.4 MB). Peak memory consumption was 12.1 MB. Max. memory is 16.1 GB. [2021-08-27 04:26:29,025 INFO L168 Benchmark]: TraceAbstraction took 15673.93 ms. Allocated memory was 67.1 MB in the beginning and 251.7 MB in the end (delta: 184.5 MB). Free memory was 28.0 MB in the beginning and 225.7 MB in the end (delta: -197.7 MB). Peak memory consumption was 134.6 MB. Max. memory is 16.1 GB. [2021-08-27 04:26:29,025 INFO L168 Benchmark]: Witness Printer took 26.92 ms. Allocated memory is still 251.7 MB. Free memory was 224.7 MB in the beginning and 222.6 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:29,027 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.17 ms. Allocated memory is still 54.5 MB. Free memory was 36.0 MB in the beginning and 35.9 MB in the end (delta: 44.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 390.82 ms. Allocated memory is still 54.5 MB. Free memory was 31.1 MB in the beginning and 28.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 70.90 ms. Allocated memory is still 54.5 MB. Free memory was 28.4 MB in the beginning and 25.2 MB in the end (delta: 3.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 917.52 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 25.0 MB in the beginning and 28.4 MB in the end (delta: -3.4 MB). Peak memory consumption was 12.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 15673.93 ms. Allocated memory was 67.1 MB in the beginning and 251.7 MB in the end (delta: 184.5 MB). Free memory was 28.0 MB in the beginning and 225.7 MB in the end (delta: -197.7 MB). Peak memory consumption was 134.6 MB. Max. memory is 16.1 GB. * Witness Printer took 26.92 ms. Allocated memory is still 251.7 MB. Free memory was 224.7 MB in the beginning and 222.6 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: 1040]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1003] SLL* list = malloc(sizeof(SLL)); [L1004] list->next = ((void*)0) VAL [list={-1:0}] [L1005] list->prev = ((void*)0) VAL [list={-1:0}] [L1006] COND FALSE !(!(list != ((void*)0))) VAL [list={-1:0}] [L1006] COND FALSE !(__VERIFIER_nondet_int()) [L1006] list->inner = malloc(sizeof(SLL)) VAL [list={-1:0}, malloc(sizeof(SLL))={-2:0}] [L1006] EXPR list->inner VAL [list={-1:0}, list->inner={-2:0}] [L1006] list->inner->next = ((void*)0) VAL [list={-1:0}, list->inner={-2:0}] [L1006] EXPR list->inner VAL [list={-1:0}, list->inner={-2:0}] [L1006] list->inner->inner = ((void*)0) VAL [list={-1:0}, list->inner={-2:0}] [L1006] EXPR list->inner VAL [list={-1:0}, list->inner={-2:0}] [L1006] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={-1:0}, list->inner={-2:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1] [L1006] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L1008] SLL* end = list; VAL [end={-1:0}, list={-1:0}] [L1011] COND FALSE !(__VERIFIER_nondet_int()) [L1022] end = ((void*)0) [L1023] end = list VAL [end={-1:0}, list={-1:0}] [L1026] COND FALSE !(!(((void*)0) != end)) VAL [end={-1:0}, list={-1:0}] [L1028] COND TRUE ((void*)0) != end [L1030] int len = 0; VAL [end={-1:0}, len=0, list={-1:0}] [L1031] EXPR end->inner VAL [end={-1:0}, end->inner={-2:0}, len=0, list={-1:0}] [L1031] SLL* inner = end->inner; [L1032] COND TRUE ((void*)0) != inner VAL [end={-1:0}, inner={-2:0}, len=0, list={-1:0}] [L1034] COND TRUE len == 0 [L1035] len = 1 VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1038] COND FALSE !(!(((void*)0) != inner)) VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1039] EXPR inner->inner VAL [end={-1:0}, inner={-2:0}, inner->inner={0:0}, len=1, list={-1:0}] [L1039] COND FALSE !(!(((void*)0) == inner->inner)) [L1040] EXPR inner->next VAL [end={-1:0}, inner={-2:0}, inner->next={0:0}, len=1, list={-1:0}] [L1040] COND TRUE !(((void*)0) != inner->next) [L1040] reach_error() VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1005]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1005]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1014]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1014]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1026]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1031]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1031]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1038]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1039]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1039]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1039]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1040]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1040]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1043]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1051]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1051]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1055]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1056]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1056]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1056]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1057]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1057]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1057]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 84 error locations. Started 1 CEGAR loops. OverallTime: 15601.8ms, OverallIterations: 33, TraceHistogramMax: 2, EmptinessCheckTime: 21.3ms, AutomataDifference: 11228.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 9.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 4372 SDtfs, 5643 SDslu, 11318 SDs, 0 SdLazy, 13858 SolverSat, 405 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6920.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 424 GetRequests, 113 SyntacticMatches, 2 SemanticMatches, 309 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 2962.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=247occurred in iteration=25, InterpolantAutomatonStates: 293, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 148.6ms AutomataMinimizationTime, 32 MinimizatonAttempts, 1054 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 50.5ms SsaConstructionTime, 259.9ms SatisfiabilityAnalysisTime, 3218.5ms InterpolantComputationTime, 1008 NumberOfCodeBlocks, 1008 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 931 ConstructedInterpolants, 0 QuantifiedInterpolants, 7749 SizeOfPredicates, 6 NumberOfNonLiveVariables, 173 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 33 InterpolantComputations, 31 PerfectInterpolantSequences, 4/6 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:29,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...