./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/dll-01-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e19ca921 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-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 652acbc8fb2d659424086f7ee4bd5fc2f45ff1d49f46cde68db4fdee1ed0638e --- Real Ultimate output --- This is Ultimate 0.2.2-dev-e19ca92 [2021-12-22 00:11:30,160 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-22 00:11:30,184 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-22 00:11:30,215 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-22 00:11:30,216 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-22 00:11:30,216 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-22 00:11:30,217 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-22 00:11:30,218 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-22 00:11:30,220 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-22 00:11:30,220 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-22 00:11:30,221 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-22 00:11:30,222 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-22 00:11:30,222 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-22 00:11:30,223 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-22 00:11:30,223 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-22 00:11:30,224 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-22 00:11:30,225 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-22 00:11:30,225 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-22 00:11:30,226 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-22 00:11:30,228 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-22 00:11:30,229 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-22 00:11:30,230 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-22 00:11:30,230 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-22 00:11:30,231 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-22 00:11:30,233 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-22 00:11:30,233 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-22 00:11:30,234 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-22 00:11:30,234 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-22 00:11:30,235 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-22 00:11:30,237 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-22 00:11:30,237 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-22 00:11:30,238 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-22 00:11:30,240 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-22 00:11:30,240 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-22 00:11:30,241 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-22 00:11:30,242 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-22 00:11:30,243 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-22 00:11:30,247 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-22 00:11:30,247 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-22 00:11:30,247 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-22 00:11:30,248 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-22 00:11:30,249 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-22 00:11:30,275 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-22 00:11:30,275 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-22 00:11:30,276 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-22 00:11:30,276 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-22 00:11:30,277 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-22 00:11:30,277 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-22 00:11:30,277 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-22 00:11:30,277 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-22 00:11:30,277 INFO L138 SettingsManager]: * Use SBE=true [2021-12-22 00:11:30,278 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-22 00:11:30,278 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-22 00:11:30,279 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-22 00:11:30,279 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-22 00:11:30,279 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-22 00:11:30,279 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-22 00:11:30,279 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-22 00:11:30,279 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-22 00:11:30,280 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-22 00:11:30,280 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-22 00:11:30,280 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-22 00:11:30,280 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-22 00:11:30,281 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-22 00:11:30,281 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-22 00:11:30,281 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-22 00:11:30,281 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-22 00:11:30,281 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 00:11:30,281 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-22 00:11:30,282 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-22 00:11:30,282 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-22 00:11:30,282 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-22 00:11:30,282 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-22 00:11:30,282 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 652acbc8fb2d659424086f7ee4bd5fc2f45ff1d49f46cde68db4fdee1ed0638e [2021-12-22 00:11:30,432 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-22 00:11:30,448 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-22 00:11:30,450 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-22 00:11:30,451 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-22 00:11:30,451 INFO L275 PluginConnector]: CDTParser initialized [2021-12-22 00:11:30,452 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-01-2.i [2021-12-22 00:11:30,501 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/665ea2471/d5e1e46b0e8043598f5938c209da27e3/FLAG8446badd2 [2021-12-22 00:11:30,932 INFO L306 CDTParser]: Found 1 translation units. [2021-12-22 00:11:30,933 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i [2021-12-22 00:11:30,949 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/665ea2471/d5e1e46b0e8043598f5938c209da27e3/FLAG8446badd2 [2021-12-22 00:11:30,961 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/665ea2471/d5e1e46b0e8043598f5938c209da27e3 [2021-12-22 00:11:30,963 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-22 00:11:30,964 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-22 00:11:30,969 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-22 00:11:30,969 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-22 00:11:30,971 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-22 00:11:30,972 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 12:11:30" (1/1) ... [2021-12-22 00:11:30,973 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@476e40e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:11:30, skipping insertion in model container [2021-12-22 00:11:30,973 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 12:11:30" (1/1) ... [2021-12-22 00:11:30,977 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-22 00:11:31,018 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-22 00:11:31,229 WARN L230 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-2.i[22080,22093] [2021-12-22 00:11:31,242 WARN L230 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-2.i[22353,22366] [2021-12-22 00:11:31,244 WARN L230 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-2.i[22587,22600] [2021-12-22 00:11:31,246 WARN L230 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-2.i[22657,22670] [2021-12-22 00:11:31,249 WARN L230 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-2.i[22924,22937] [2021-12-22 00:11:31,250 WARN L230 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-2.i[23032,23045] [2021-12-22 00:11:31,253 WARN L230 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-2.i[23263,23276] [2021-12-22 00:11:31,255 WARN L230 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-2.i[23343,23356] [2021-12-22 00:11:31,256 WARN L230 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-2.i[23422,23435] [2021-12-22 00:11:31,257 WARN L230 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-2.i[23512,23525] [2021-12-22 00:11:31,258 WARN L230 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-2.i[23690,23703] [2021-12-22 00:11:31,259 WARN L230 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-2.i[23768,23781] [2021-12-22 00:11:31,260 WARN L230 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-2.i[23845,23858] [2021-12-22 00:11:31,269 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 00:11:31,276 INFO L203 MainTranslator]: Completed pre-run [2021-12-22 00:11:31,303 WARN L230 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-2.i[22080,22093] [2021-12-22 00:11:31,314 WARN L230 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-2.i[22353,22366] [2021-12-22 00:11:31,317 WARN L230 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-2.i[22587,22600] [2021-12-22 00:11:31,319 WARN L230 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-2.i[22657,22670] [2021-12-22 00:11:31,320 WARN L230 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-2.i[22924,22937] [2021-12-22 00:11:31,322 WARN L230 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-2.i[23032,23045] [2021-12-22 00:11:31,323 WARN L230 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-2.i[23263,23276] [2021-12-22 00:11:31,324 WARN L230 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-2.i[23343,23356] [2021-12-22 00:11:31,324 WARN L230 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-2.i[23422,23435] [2021-12-22 00:11:31,325 WARN L230 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-2.i[23512,23525] [2021-12-22 00:11:31,325 WARN L230 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-2.i[23690,23703] [2021-12-22 00:11:31,326 WARN L230 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-2.i[23768,23781] [2021-12-22 00:11:31,326 WARN L230 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-2.i[23845,23858] [2021-12-22 00:11:31,329 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 00:11:31,348 INFO L208 MainTranslator]: Completed translation [2021-12-22 00:11:31,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:11:31 WrapperNode [2021-12-22 00:11:31,349 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-22 00:11:31,350 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-22 00:11:31,350 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-22 00:11:31,352 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-22 00:11:31,357 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:11:31" (1/1) ... [2021-12-22 00:11:31,372 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:11:31" (1/1) ... [2021-12-22 00:11:31,392 INFO L137 Inliner]: procedures = 119, calls = 45, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 231 [2021-12-22 00:11:31,393 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-22 00:11:31,393 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-22 00:11:31,393 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-22 00:11:31,394 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-22 00:11:31,399 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:11:31" (1/1) ... [2021-12-22 00:11:31,399 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:11:31" (1/1) ... [2021-12-22 00:11:31,402 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:11:31" (1/1) ... [2021-12-22 00:11:31,402 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:11:31" (1/1) ... [2021-12-22 00:11:31,408 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:11:31" (1/1) ... [2021-12-22 00:11:31,412 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:11:31" (1/1) ... [2021-12-22 00:11:31,413 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:11:31" (1/1) ... [2021-12-22 00:11:31,415 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-22 00:11:31,416 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-22 00:11:31,416 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-22 00:11:31,416 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-22 00:11:31,417 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:11:31" (1/1) ... [2021-12-22 00:11:31,426 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 00:11:31,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 00:11:31,443 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-12-22 00:11:31,445 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-12-22 00:11:31,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-22 00:11:31,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-22 00:11:31,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-22 00:11:31,477 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-22 00:11:31,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-22 00:11:31,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-22 00:11:31,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-22 00:11:31,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-22 00:11:31,555 INFO L234 CfgBuilder]: Building ICFG [2021-12-22 00:11:31,557 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-22 00:11:31,984 INFO L275 CfgBuilder]: Performing block encoding [2021-12-22 00:11:31,991 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-22 00:11:31,992 INFO L299 CfgBuilder]: Removed 30 assume(true) statements. [2021-12-22 00:11:31,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 12:11:31 BoogieIcfgContainer [2021-12-22 00:11:31,993 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-22 00:11:31,994 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-22 00:11:31,994 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-22 00:11:31,998 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-22 00:11:31,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 12:11:30" (1/3) ... [2021-12-22 00:11:31,998 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16873fef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 12:11:31, skipping insertion in model container [2021-12-22 00:11:31,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:11:31" (2/3) ... [2021-12-22 00:11:31,999 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16873fef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 12:11:31, skipping insertion in model container [2021-12-22 00:11:31,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 12:11:31" (3/3) ... [2021-12-22 00:11:32,000 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-01-2.i [2021-12-22 00:11:32,004 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-22 00:11:32,004 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 86 error locations. [2021-12-22 00:11:32,035 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-22 00:11:32,041 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, mAutomataTypeConcurrency=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-12-22 00:11:32,041 INFO L340 AbstractCegarLoop]: Starting to check reachability of 86 error locations. [2021-12-22 00:11:32,059 INFO L276 IsEmpty]: Start isEmpty. Operand has 203 states, 116 states have (on average 2.1982758620689653) internal successors, (255), 202 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:32,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-22 00:11:32,063 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:11:32,064 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-22 00:11:32,065 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-22 00:11:32,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:11:32,068 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-22 00:11:32,074 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:11:32,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880442703] [2021-12-22 00:11:32,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:11:32,075 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:11:32,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:11:32,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:11:32,203 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:11:32,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880442703] [2021-12-22 00:11:32,204 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880442703] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:11:32,204 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:11:32,205 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 00:11:32,206 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153535646] [2021-12-22 00:11:32,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:11:32,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 00:11:32,211 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:11:32,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 00:11:32,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 00:11:32,234 INFO L87 Difference]: Start difference. First operand has 203 states, 116 states have (on average 2.1982758620689653) internal successors, (255), 202 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:32,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:11:32,402 INFO L93 Difference]: Finished difference Result 201 states and 210 transitions. [2021-12-22 00:11:32,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 00:11:32,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-22 00:11:32,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:11:32,409 INFO L225 Difference]: With dead ends: 201 [2021-12-22 00:11:32,410 INFO L226 Difference]: Without dead ends: 197 [2021-12-22 00:11:32,411 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 00:11:32,413 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 191 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:11:32,413 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 124 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:11:32,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-12-22 00:11:32,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 193. [2021-12-22 00:11:32,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 117 states have (on average 1.7435897435897436) internal successors, (204), 192 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:32,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 204 transitions. [2021-12-22 00:11:32,467 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 204 transitions. Word has length 3 [2021-12-22 00:11:32,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:11:32,467 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 204 transitions. [2021-12-22 00:11:32,467 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:32,467 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 204 transitions. [2021-12-22 00:11:32,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-22 00:11:32,467 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:11:32,467 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-22 00:11:32,468 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-22 00:11:32,468 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-22 00:11:32,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:11:32,468 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-22 00:11:32,468 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:11:32,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439611476] [2021-12-22 00:11:32,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:11:32,469 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:11:32,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:11:32,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:11:32,500 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:11:32,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439611476] [2021-12-22 00:11:32,500 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439611476] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:11:32,500 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:11:32,501 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 00:11:32,501 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962482153] [2021-12-22 00:11:32,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:11:32,502 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 00:11:32,502 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:11:32,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 00:11:32,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 00:11:32,503 INFO L87 Difference]: Start difference. First operand 193 states and 204 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:32,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:11:32,637 INFO L93 Difference]: Finished difference Result 222 states and 232 transitions. [2021-12-22 00:11:32,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 00:11:32,638 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-22 00:11:32,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:11:32,641 INFO L225 Difference]: With dead ends: 222 [2021-12-22 00:11:32,642 INFO L226 Difference]: Without dead ends: 222 [2021-12-22 00:11:32,642 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 00:11:32,643 INFO L933 BasicCegarLoop]: 123 mSDtfsCounter, 181 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:11:32,643 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 149 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:11:32,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2021-12-22 00:11:32,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 202. [2021-12-22 00:11:32,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 134 states have (on average 1.671641791044776) internal successors, (224), 201 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:32,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 224 transitions. [2021-12-22 00:11:32,649 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 224 transitions. Word has length 3 [2021-12-22 00:11:32,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:11:32,649 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 224 transitions. [2021-12-22 00:11:32,650 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:32,650 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 224 transitions. [2021-12-22 00:11:32,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-22 00:11:32,653 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:11:32,653 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-22 00:11:32,653 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-22 00:11:32,655 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-22 00:11:32,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:11:32,657 INFO L85 PathProgramCache]: Analyzing trace with hash 889446311, now seen corresponding path program 1 times [2021-12-22 00:11:32,657 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:11:32,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903328137] [2021-12-22 00:11:32,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:11:32,657 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:11:32,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:11:32,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:11:32,715 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:11:32,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903328137] [2021-12-22 00:11:32,715 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903328137] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:11:32,715 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:11:32,715 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 00:11:32,715 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937422419] [2021-12-22 00:11:32,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:11:32,716 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 00:11:32,716 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:11:32,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 00:11:32,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 00:11:32,716 INFO L87 Difference]: Start difference. First operand 202 states and 224 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:32,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:11:32,747 INFO L93 Difference]: Finished difference Result 217 states and 227 transitions. [2021-12-22 00:11:32,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 00:11:32,748 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-22 00:11:32,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:11:32,748 INFO L225 Difference]: With dead ends: 217 [2021-12-22 00:11:32,748 INFO L226 Difference]: Without dead ends: 217 [2021-12-22 00:11:32,749 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 00:11:32,751 INFO L933 BasicCegarLoop]: 171 mSDtfsCounter, 177 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 00:11:32,752 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 204 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 00:11:32,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-12-22 00:11:32,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 200. [2021-12-22 00:11:32,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 133 states have (on average 1.6616541353383458) internal successors, (221), 199 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:32,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 221 transitions. [2021-12-22 00:11:32,768 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 221 transitions. Word has length 6 [2021-12-22 00:11:32,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:11:32,768 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 221 transitions. [2021-12-22 00:11:32,769 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:32,769 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 221 transitions. [2021-12-22 00:11:32,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-22 00:11:32,769 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:11:32,769 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:11:32,769 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-22 00:11:32,769 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-22 00:11:32,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:11:32,770 INFO L85 PathProgramCache]: Analyzing trace with hash 2020777177, now seen corresponding path program 1 times [2021-12-22 00:11:32,770 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:11:32,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817314182] [2021-12-22 00:11:32,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:11:32,770 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:11:32,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:11:32,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:11:32,817 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:11:32,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817314182] [2021-12-22 00:11:32,817 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817314182] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:11:32,818 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:11:32,818 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 00:11:32,818 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152490783] [2021-12-22 00:11:32,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:11:32,818 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 00:11:32,818 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:11:32,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 00:11:32,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 00:11:32,819 INFO L87 Difference]: Start difference. First operand 200 states and 221 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:32,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:11:32,958 INFO L93 Difference]: Finished difference Result 199 states and 220 transitions. [2021-12-22 00:11:32,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 00:11:32,959 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-22 00:11:32,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:11:32,960 INFO L225 Difference]: With dead ends: 199 [2021-12-22 00:11:32,960 INFO L226 Difference]: Without dead ends: 199 [2021-12-22 00:11:32,960 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-22 00:11:32,962 INFO L933 BasicCegarLoop]: 185 mSDtfsCounter, 4 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:11:32,964 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 539 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:11:32,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-12-22 00:11:32,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2021-12-22 00:11:32,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 133 states have (on average 1.6541353383458646) internal successors, (220), 198 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:32,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 220 transitions. [2021-12-22 00:11:32,973 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 220 transitions. Word has length 12 [2021-12-22 00:11:32,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:11:32,974 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 220 transitions. [2021-12-22 00:11:32,974 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:32,974 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 220 transitions. [2021-12-22 00:11:32,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-22 00:11:32,974 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:11:32,974 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:11:32,975 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-22 00:11:32,975 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-22 00:11:32,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:11:32,976 INFO L85 PathProgramCache]: Analyzing trace with hash 2020777178, now seen corresponding path program 1 times [2021-12-22 00:11:32,976 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:11:32,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74076833] [2021-12-22 00:11:32,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:11:32,976 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:11:33,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:11:33,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:11:33,065 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:11:33,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74076833] [2021-12-22 00:11:33,065 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74076833] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:11:33,065 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:11:33,066 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 00:11:33,066 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274994742] [2021-12-22 00:11:33,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:11:33,066 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 00:11:33,066 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:11:33,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 00:11:33,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 00:11:33,066 INFO L87 Difference]: Start difference. First operand 199 states and 220 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:33,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:11:33,212 INFO L93 Difference]: Finished difference Result 198 states and 219 transitions. [2021-12-22 00:11:33,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 00:11:33,213 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-22 00:11:33,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:11:33,214 INFO L225 Difference]: With dead ends: 198 [2021-12-22 00:11:33,214 INFO L226 Difference]: Without dead ends: 198 [2021-12-22 00:11:33,214 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-22 00:11:33,214 INFO L933 BasicCegarLoop]: 185 mSDtfsCounter, 2 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:11:33,215 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 548 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:11:33,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-12-22 00:11:33,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2021-12-22 00:11:33,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 133 states have (on average 1.6466165413533835) internal successors, (219), 197 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:33,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 219 transitions. [2021-12-22 00:11:33,217 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 219 transitions. Word has length 12 [2021-12-22 00:11:33,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:11:33,217 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 219 transitions. [2021-12-22 00:11:33,217 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:33,217 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 219 transitions. [2021-12-22 00:11:33,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-22 00:11:33,218 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:11:33,218 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:11:33,218 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-22 00:11:33,218 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-22 00:11:33,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:11:33,218 INFO L85 PathProgramCache]: Analyzing trace with hash 373192235, now seen corresponding path program 1 times [2021-12-22 00:11:33,218 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:11:33,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727831419] [2021-12-22 00:11:33,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:11:33,219 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:11:33,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:11:33,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:11:33,247 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:11:33,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727831419] [2021-12-22 00:11:33,248 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727831419] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:11:33,248 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:11:33,248 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 00:11:33,248 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758561494] [2021-12-22 00:11:33,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:11:33,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 00:11:33,248 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:11:33,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 00:11:33,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 00:11:33,249 INFO L87 Difference]: Start difference. First operand 198 states and 219 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:33,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:11:33,255 INFO L93 Difference]: Finished difference Result 199 states and 220 transitions. [2021-12-22 00:11:33,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 00:11:33,255 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-12-22 00:11:33,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:11:33,256 INFO L225 Difference]: With dead ends: 199 [2021-12-22 00:11:33,256 INFO L226 Difference]: Without dead ends: 199 [2021-12-22 00:11:33,256 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 00:11:33,257 INFO L933 BasicCegarLoop]: 187 mSDtfsCounter, 0 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 00:11:33,257 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 368 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 00:11:33,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-12-22 00:11:33,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2021-12-22 00:11:33,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 134 states have (on average 1.6417910447761195) internal successors, (220), 198 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:33,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 220 transitions. [2021-12-22 00:11:33,261 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 220 transitions. Word has length 14 [2021-12-22 00:11:33,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:11:33,261 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 220 transitions. [2021-12-22 00:11:33,261 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:33,261 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 220 transitions. [2021-12-22 00:11:33,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-22 00:11:33,262 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:11:33,262 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:11:33,262 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-22 00:11:33,262 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-22 00:11:33,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:11:33,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1583692102, now seen corresponding path program 1 times [2021-12-22 00:11:33,262 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:11:33,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259113212] [2021-12-22 00:11:33,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:11:33,263 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:11:33,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:11:33,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:11:33,360 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:11:33,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259113212] [2021-12-22 00:11:33,361 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259113212] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:11:33,361 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:11:33,361 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-22 00:11:33,361 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296829681] [2021-12-22 00:11:33,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:11:33,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-22 00:11:33,362 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:11:33,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-22 00:11:33,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-22 00:11:33,362 INFO L87 Difference]: Start difference. First operand 199 states and 220 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:33,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:11:33,568 INFO L93 Difference]: Finished difference Result 198 states and 219 transitions. [2021-12-22 00:11:33,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-22 00:11:33,569 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-22 00:11:33,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:11:33,569 INFO L225 Difference]: With dead ends: 198 [2021-12-22 00:11:33,569 INFO L226 Difference]: Without dead ends: 198 [2021-12-22 00:11:33,570 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2021-12-22 00:11:33,571 INFO L933 BasicCegarLoop]: 121 mSDtfsCounter, 175 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 00:11:33,571 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 456 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 00:11:33,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-12-22 00:11:33,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2021-12-22 00:11:33,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 134 states have (on average 1.6343283582089552) internal successors, (219), 197 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:33,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 219 transitions. [2021-12-22 00:11:33,574 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 219 transitions. Word has length 15 [2021-12-22 00:11:33,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:11:33,574 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 219 transitions. [2021-12-22 00:11:33,574 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:33,574 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 219 transitions. [2021-12-22 00:11:33,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-22 00:11:33,575 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:11:33,575 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:11:33,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-22 00:11:33,575 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-22 00:11:33,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:11:33,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1583692101, now seen corresponding path program 1 times [2021-12-22 00:11:33,575 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:11:33,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194053027] [2021-12-22 00:11:33,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:11:33,575 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:11:33,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:11:33,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:11:33,743 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:11:33,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194053027] [2021-12-22 00:11:33,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194053027] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:11:33,744 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:11:33,744 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-22 00:11:33,744 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384742766] [2021-12-22 00:11:33,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:11:33,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-22 00:11:33,744 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:11:33,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-22 00:11:33,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-22 00:11:33,745 INFO L87 Difference]: Start difference. First operand 198 states and 219 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:34,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:11:34,068 INFO L93 Difference]: Finished difference Result 197 states and 218 transitions. [2021-12-22 00:11:34,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-22 00:11:34,068 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-22 00:11:34,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:11:34,069 INFO L225 Difference]: With dead ends: 197 [2021-12-22 00:11:34,069 INFO L226 Difference]: Without dead ends: 197 [2021-12-22 00:11:34,069 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2021-12-22 00:11:34,069 INFO L933 BasicCegarLoop]: 121 mSDtfsCounter, 169 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 00:11:34,070 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 577 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 00:11:34,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-12-22 00:11:34,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2021-12-22 00:11:34,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 134 states have (on average 1.626865671641791) internal successors, (218), 196 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:34,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 218 transitions. [2021-12-22 00:11:34,072 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 218 transitions. Word has length 15 [2021-12-22 00:11:34,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:11:34,072 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 218 transitions. [2021-12-22 00:11:34,072 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:34,072 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 218 transitions. [2021-12-22 00:11:34,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-22 00:11:34,072 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:11:34,073 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:11:34,073 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-22 00:11:34,073 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-22 00:11:34,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:11:34,073 INFO L85 PathProgramCache]: Analyzing trace with hash -2137878992, now seen corresponding path program 1 times [2021-12-22 00:11:34,073 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:11:34,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076390595] [2021-12-22 00:11:34,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:11:34,073 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:11:34,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:11:34,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:11:34,152 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:11:34,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076390595] [2021-12-22 00:11:34,152 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076390595] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:11:34,152 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:11:34,152 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-22 00:11:34,153 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565991926] [2021-12-22 00:11:34,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:11:34,153 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-22 00:11:34,154 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:11:34,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-22 00:11:34,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-22 00:11:34,154 INFO L87 Difference]: Start difference. First operand 197 states and 218 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:34,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:11:34,339 INFO L93 Difference]: Finished difference Result 289 states and 316 transitions. [2021-12-22 00:11:34,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-22 00:11:34,339 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-22 00:11:34,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:11:34,341 INFO L225 Difference]: With dead ends: 289 [2021-12-22 00:11:34,341 INFO L226 Difference]: Without dead ends: 289 [2021-12-22 00:11:34,341 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2021-12-22 00:11:34,342 INFO L933 BasicCegarLoop]: 160 mSDtfsCounter, 199 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:11:34,342 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [199 Valid, 651 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:11:34,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2021-12-22 00:11:34,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 194. [2021-12-22 00:11:34,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 132 states have (on average 1.628787878787879) internal successors, (215), 193 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:34,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 215 transitions. [2021-12-22 00:11:34,346 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 215 transitions. Word has length 16 [2021-12-22 00:11:34,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:11:34,346 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 215 transitions. [2021-12-22 00:11:34,346 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:34,347 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 215 transitions. [2021-12-22 00:11:34,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-22 00:11:34,347 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:11:34,347 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:11:34,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-22 00:11:34,348 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-22 00:11:34,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:11:34,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1339025717, now seen corresponding path program 1 times [2021-12-22 00:11:34,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:11:34,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762139270] [2021-12-22 00:11:34,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:11:34,349 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:11:34,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:11:34,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:11:34,391 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:11:34,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762139270] [2021-12-22 00:11:34,391 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762139270] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:11:34,391 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:11:34,392 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 00:11:34,392 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465956408] [2021-12-22 00:11:34,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:11:34,392 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 00:11:34,392 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:11:34,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 00:11:34,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 00:11:34,393 INFO L87 Difference]: Start difference. First operand 194 states and 215 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:34,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:11:34,527 INFO L93 Difference]: Finished difference Result 290 states and 316 transitions. [2021-12-22 00:11:34,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 00:11:34,528 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-22 00:11:34,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:11:34,529 INFO L225 Difference]: With dead ends: 290 [2021-12-22 00:11:34,529 INFO L226 Difference]: Without dead ends: 290 [2021-12-22 00:11:34,529 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-22 00:11:34,529 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 102 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:11:34,529 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 614 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:11:34,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2021-12-22 00:11:34,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 197. [2021-12-22 00:11:34,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 135 states have (on average 1.614814814814815) internal successors, (218), 196 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:34,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 218 transitions. [2021-12-22 00:11:34,534 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 218 transitions. Word has length 18 [2021-12-22 00:11:34,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:11:34,534 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 218 transitions. [2021-12-22 00:11:34,534 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:34,534 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 218 transitions. [2021-12-22 00:11:34,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-22 00:11:34,535 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:11:34,535 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:11:34,535 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-22 00:11:34,535 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-22 00:11:34,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:11:34,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1029802310, now seen corresponding path program 1 times [2021-12-22 00:11:34,536 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:11:34,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812892002] [2021-12-22 00:11:34,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:11:34,537 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:11:34,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:11:34,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:11:34,579 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:11:34,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812892002] [2021-12-22 00:11:34,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812892002] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:11:34,579 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:11:34,580 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 00:11:34,580 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791498134] [2021-12-22 00:11:34,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:11:34,580 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-22 00:11:34,580 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:11:34,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-22 00:11:34,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-22 00:11:34,581 INFO L87 Difference]: Start difference. First operand 197 states and 218 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:34,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:11:34,690 INFO L93 Difference]: Finished difference Result 191 states and 211 transitions. [2021-12-22 00:11:34,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-22 00:11:34,690 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-22 00:11:34,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:11:34,691 INFO L225 Difference]: With dead ends: 191 [2021-12-22 00:11:34,691 INFO L226 Difference]: Without dead ends: 191 [2021-12-22 00:11:34,691 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-22 00:11:34,692 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 257 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:11:34,692 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [257 Valid, 118 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:11:34,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-12-22 00:11:34,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 187. [2021-12-22 00:11:34,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 137 states have (on average 1.5182481751824817) internal successors, (208), 186 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:34,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 208 transitions. [2021-12-22 00:11:34,700 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 208 transitions. Word has length 20 [2021-12-22 00:11:34,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:11:34,701 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 208 transitions. [2021-12-22 00:11:34,701 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:34,701 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 208 transitions. [2021-12-22 00:11:34,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-22 00:11:34,702 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:11:34,702 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:11:34,702 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-22 00:11:34,702 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-22 00:11:34,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:11:34,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1029802309, now seen corresponding path program 1 times [2021-12-22 00:11:34,703 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:11:34,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411380878] [2021-12-22 00:11:34,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:11:34,703 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:11:34,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:11:34,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:11:34,787 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:11:34,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411380878] [2021-12-22 00:11:34,787 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411380878] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:11:34,787 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:11:34,787 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 00:11:34,787 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969375727] [2021-12-22 00:11:34,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:11:34,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 00:11:34,787 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:11:34,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 00:11:34,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-22 00:11:34,788 INFO L87 Difference]: Start difference. First operand 187 states and 208 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:34,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:11:34,976 INFO L93 Difference]: Finished difference Result 248 states and 262 transitions. [2021-12-22 00:11:34,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 00:11:34,976 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-22 00:11:34,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:11:34,977 INFO L225 Difference]: With dead ends: 248 [2021-12-22 00:11:34,977 INFO L226 Difference]: Without dead ends: 248 [2021-12-22 00:11:34,977 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-22 00:11:34,977 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 449 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 00:11:34,978 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [449 Valid, 255 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 00:11:34,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2021-12-22 00:11:34,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 211. [2021-12-22 00:11:34,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 161 states have (on average 1.5279503105590062) internal successors, (246), 210 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:34,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 246 transitions. [2021-12-22 00:11:34,981 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 246 transitions. Word has length 20 [2021-12-22 00:11:34,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:11:34,981 INFO L470 AbstractCegarLoop]: Abstraction has 211 states and 246 transitions. [2021-12-22 00:11:34,981 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:34,981 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 246 transitions. [2021-12-22 00:11:34,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-22 00:11:34,981 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:11:34,981 INFO L514 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-12-22 00:11:34,981 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-22 00:11:34,981 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-22 00:11:34,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:11:34,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1797484881, now seen corresponding path program 1 times [2021-12-22 00:11:34,982 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:11:34,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765239522] [2021-12-22 00:11:34,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:11:34,983 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:11:34,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:11:35,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:11:35,014 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:11:35,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765239522] [2021-12-22 00:11:35,014 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765239522] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:11:35,014 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:11:35,014 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 00:11:35,014 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135301876] [2021-12-22 00:11:35,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:11:35,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-22 00:11:35,014 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:11:35,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-22 00:11:35,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-22 00:11:35,015 INFO L87 Difference]: Start difference. First operand 211 states and 246 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:35,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:11:35,092 INFO L93 Difference]: Finished difference Result 243 states and 256 transitions. [2021-12-22 00:11:35,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-22 00:11:35,093 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-22 00:11:35,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:11:35,094 INFO L225 Difference]: With dead ends: 243 [2021-12-22 00:11:35,094 INFO L226 Difference]: Without dead ends: 243 [2021-12-22 00:11:35,094 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-22 00:11:35,094 INFO L933 BasicCegarLoop]: 143 mSDtfsCounter, 234 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:11:35,095 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [234 Valid, 273 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:11:35,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2021-12-22 00:11:35,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 209. [2021-12-22 00:11:35,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 160 states have (on average 1.51875) internal successors, (243), 208 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:35,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 243 transitions. [2021-12-22 00:11:35,097 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 243 transitions. Word has length 22 [2021-12-22 00:11:35,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:11:35,098 INFO L470 AbstractCegarLoop]: Abstraction has 209 states and 243 transitions. [2021-12-22 00:11:35,098 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:35,098 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 243 transitions. [2021-12-22 00:11:35,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-22 00:11:35,098 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:11:35,098 INFO L514 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] [2021-12-22 00:11:35,098 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-22 00:11:35,098 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-22 00:11:35,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:11:35,099 INFO L85 PathProgramCache]: Analyzing trace with hash 110847663, now seen corresponding path program 1 times [2021-12-22 00:11:35,099 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:11:35,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032792571] [2021-12-22 00:11:35,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:11:35,099 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:11:35,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:11:35,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:11:35,139 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:11:35,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032792571] [2021-12-22 00:11:35,139 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032792571] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:11:35,139 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:11:35,139 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 00:11:35,139 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888902402] [2021-12-22 00:11:35,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:11:35,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 00:11:35,140 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:11:35,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 00:11:35,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 00:11:35,141 INFO L87 Difference]: Start difference. First operand 209 states and 243 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:35,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:11:35,244 INFO L93 Difference]: Finished difference Result 208 states and 241 transitions. [2021-12-22 00:11:35,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 00:11:35,245 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-22 00:11:35,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:11:35,246 INFO L225 Difference]: With dead ends: 208 [2021-12-22 00:11:35,246 INFO L226 Difference]: Without dead ends: 208 [2021-12-22 00:11:35,246 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-22 00:11:35,246 INFO L933 BasicCegarLoop]: 162 mSDtfsCounter, 9 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:11:35,247 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 469 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:11:35,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-12-22 00:11:35,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2021-12-22 00:11:35,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 160 states have (on average 1.50625) internal successors, (241), 207 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:35,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 241 transitions. [2021-12-22 00:11:35,250 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 241 transitions. Word has length 23 [2021-12-22 00:11:35,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:11:35,252 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 241 transitions. [2021-12-22 00:11:35,252 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:35,252 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 241 transitions. [2021-12-22 00:11:35,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-22 00:11:35,254 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:11:35,255 INFO L514 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] [2021-12-22 00:11:35,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-22 00:11:35,255 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-22 00:11:35,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:11:35,255 INFO L85 PathProgramCache]: Analyzing trace with hash 110847664, now seen corresponding path program 1 times [2021-12-22 00:11:35,255 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:11:35,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263891238] [2021-12-22 00:11:35,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:11:35,256 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:11:35,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:11:35,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:11:35,321 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:11:35,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263891238] [2021-12-22 00:11:35,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263891238] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:11:35,322 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:11:35,322 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 00:11:35,322 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264039321] [2021-12-22 00:11:35,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:11:35,322 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 00:11:35,323 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:11:35,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 00:11:35,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 00:11:35,323 INFO L87 Difference]: Start difference. First operand 208 states and 241 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:35,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:11:35,452 INFO L93 Difference]: Finished difference Result 207 states and 239 transitions. [2021-12-22 00:11:35,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 00:11:35,452 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-22 00:11:35,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:11:35,453 INFO L225 Difference]: With dead ends: 207 [2021-12-22 00:11:35,453 INFO L226 Difference]: Without dead ends: 207 [2021-12-22 00:11:35,453 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-22 00:11:35,454 INFO L933 BasicCegarLoop]: 163 mSDtfsCounter, 4 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:11:35,454 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 458 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:11:35,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2021-12-22 00:11:35,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2021-12-22 00:11:35,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 160 states have (on average 1.49375) internal successors, (239), 206 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:35,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 239 transitions. [2021-12-22 00:11:35,457 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 239 transitions. Word has length 23 [2021-12-22 00:11:35,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:11:35,457 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 239 transitions. [2021-12-22 00:11:35,457 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:35,457 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 239 transitions. [2021-12-22 00:11:35,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-22 00:11:35,458 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:11:35,458 INFO L514 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-12-22 00:11:35,458 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-22 00:11:35,458 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-22 00:11:35,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:11:35,459 INFO L85 PathProgramCache]: Analyzing trace with hash -398547279, now seen corresponding path program 1 times [2021-12-22 00:11:35,459 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:11:35,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923042820] [2021-12-22 00:11:35,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:11:35,459 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:11:35,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:11:35,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:11:35,523 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:11:35,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923042820] [2021-12-22 00:11:35,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923042820] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:11:35,525 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:11:35,525 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-22 00:11:35,525 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947098329] [2021-12-22 00:11:35,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:11:35,525 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-22 00:11:35,526 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:11:35,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-22 00:11:35,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-22 00:11:35,526 INFO L87 Difference]: Start difference. First operand 207 states and 239 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:35,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:11:35,773 INFO L93 Difference]: Finished difference Result 206 states and 238 transitions. [2021-12-22 00:11:35,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-22 00:11:35,773 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-22 00:11:35,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:11:35,774 INFO L225 Difference]: With dead ends: 206 [2021-12-22 00:11:35,774 INFO L226 Difference]: Without dead ends: 206 [2021-12-22 00:11:35,774 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2021-12-22 00:11:35,775 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 250 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 00:11:35,775 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [250 Valid, 434 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 00:11:35,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2021-12-22 00:11:35,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2021-12-22 00:11:35,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 160 states have (on average 1.4875) internal successors, (238), 205 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:35,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 238 transitions. [2021-12-22 00:11:35,778 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 238 transitions. Word has length 27 [2021-12-22 00:11:35,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:11:35,778 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 238 transitions. [2021-12-22 00:11:35,778 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:35,778 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 238 transitions. [2021-12-22 00:11:35,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-22 00:11:35,778 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:11:35,778 INFO L514 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-12-22 00:11:35,778 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-22 00:11:35,778 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-22 00:11:35,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:11:35,779 INFO L85 PathProgramCache]: Analyzing trace with hash -398547278, now seen corresponding path program 1 times [2021-12-22 00:11:35,779 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:11:35,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355348353] [2021-12-22 00:11:35,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:11:35,779 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:11:35,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:11:35,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:11:35,894 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:11:35,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355348353] [2021-12-22 00:11:35,894 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355348353] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:11:35,894 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:11:35,895 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-22 00:11:35,895 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082031214] [2021-12-22 00:11:35,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:11:35,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-22 00:11:35,900 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:11:35,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-22 00:11:35,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-12-22 00:11:35,901 INFO L87 Difference]: Start difference. First operand 206 states and 238 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:36,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:11:36,228 INFO L93 Difference]: Finished difference Result 198 states and 230 transitions. [2021-12-22 00:11:36,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-22 00:11:36,229 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-22 00:11:36,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:11:36,229 INFO L225 Difference]: With dead ends: 198 [2021-12-22 00:11:36,229 INFO L226 Difference]: Without dead ends: 198 [2021-12-22 00:11:36,230 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2021-12-22 00:11:36,230 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 265 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 00:11:36,230 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [265 Valid, 413 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 00:11:36,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-12-22 00:11:36,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 188. [2021-12-22 00:11:36,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 152 states have (on average 1.4407894736842106) internal successors, (219), 187 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:36,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 219 transitions. [2021-12-22 00:11:36,233 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 219 transitions. Word has length 27 [2021-12-22 00:11:36,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:11:36,233 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 219 transitions. [2021-12-22 00:11:36,233 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:36,233 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 219 transitions. [2021-12-22 00:11:36,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-22 00:11:36,233 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:11:36,233 INFO L514 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] [2021-12-22 00:11:36,233 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-22 00:11:36,233 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-22 00:11:36,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:11:36,234 INFO L85 PathProgramCache]: Analyzing trace with hash 329779259, now seen corresponding path program 1 times [2021-12-22 00:11:36,234 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:11:36,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867296809] [2021-12-22 00:11:36,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:11:36,234 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:11:36,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:11:36,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:11:36,262 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:11:36,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867296809] [2021-12-22 00:11:36,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867296809] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:11:36,262 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:11:36,262 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 00:11:36,263 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051909585] [2021-12-22 00:11:36,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:11:36,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 00:11:36,263 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:11:36,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 00:11:36,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 00:11:36,264 INFO L87 Difference]: Start difference. First operand 188 states and 219 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:36,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:11:36,271 INFO L93 Difference]: Finished difference Result 262 states and 307 transitions. [2021-12-22 00:11:36,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 00:11:36,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-12-22 00:11:36,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:11:36,272 INFO L225 Difference]: With dead ends: 262 [2021-12-22 00:11:36,273 INFO L226 Difference]: Without dead ends: 262 [2021-12-22 00:11:36,273 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 00:11:36,273 INFO L933 BasicCegarLoop]: 156 mSDtfsCounter, 52 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 00:11:36,273 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 303 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 00:11:36,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2021-12-22 00:11:36,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 194. [2021-12-22 00:11:36,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 158 states have (on average 1.4367088607594938) internal successors, (227), 193 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:36,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 227 transitions. [2021-12-22 00:11:36,277 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 227 transitions. Word has length 28 [2021-12-22 00:11:36,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:11:36,277 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 227 transitions. [2021-12-22 00:11:36,277 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:36,277 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 227 transitions. [2021-12-22 00:11:36,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-22 00:11:36,278 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:11:36,278 INFO L514 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] [2021-12-22 00:11:36,279 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-22 00:11:36,279 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-22 00:11:36,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:11:36,279 INFO L85 PathProgramCache]: Analyzing trace with hash -751842895, now seen corresponding path program 1 times [2021-12-22 00:11:36,279 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:11:36,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383819598] [2021-12-22 00:11:36,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:11:36,280 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:11:36,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:11:36,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:11:36,327 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:11:36,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383819598] [2021-12-22 00:11:36,327 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383819598] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:11:36,327 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:11:36,327 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 00:11:36,327 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380801082] [2021-12-22 00:11:36,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:11:36,328 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 00:11:36,328 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:11:36,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 00:11:36,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-22 00:11:36,328 INFO L87 Difference]: Start difference. First operand 194 states and 227 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:36,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:11:36,421 INFO L93 Difference]: Finished difference Result 199 states and 233 transitions. [2021-12-22 00:11:36,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 00:11:36,422 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-22 00:11:36,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:11:36,422 INFO L225 Difference]: With dead ends: 199 [2021-12-22 00:11:36,422 INFO L226 Difference]: Without dead ends: 199 [2021-12-22 00:11:36,422 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2021-12-22 00:11:36,423 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 357 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:11:36,423 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [357 Valid, 232 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:11:36,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-12-22 00:11:36,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 190. [2021-12-22 00:11:36,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 156 states have (on average 1.4294871794871795) internal successors, (223), 189 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:36,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 223 transitions. [2021-12-22 00:11:36,425 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 223 transitions. Word has length 29 [2021-12-22 00:11:36,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:11:36,425 INFO L470 AbstractCegarLoop]: Abstraction has 190 states and 223 transitions. [2021-12-22 00:11:36,426 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:36,426 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 223 transitions. [2021-12-22 00:11:36,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-22 00:11:36,426 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:11:36,426 INFO L514 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] [2021-12-22 00:11:36,426 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-22 00:11:36,426 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-22 00:11:36,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:11:36,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1633211075, now seen corresponding path program 1 times [2021-12-22 00:11:36,426 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:11:36,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782302383] [2021-12-22 00:11:36,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:11:36,427 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:11:36,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:11:36,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:11:36,460 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:11:36,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782302383] [2021-12-22 00:11:36,461 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782302383] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:11:36,461 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:11:36,461 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 00:11:36,461 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352923489] [2021-12-22 00:11:36,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:11:36,461 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 00:11:36,462 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:11:36,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 00:11:36,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 00:11:36,463 INFO L87 Difference]: Start difference. First operand 190 states and 223 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:36,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:11:36,473 INFO L93 Difference]: Finished difference Result 188 states and 220 transitions. [2021-12-22 00:11:36,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 00:11:36,474 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-22 00:11:36,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:11:36,475 INFO L225 Difference]: With dead ends: 188 [2021-12-22 00:11:36,475 INFO L226 Difference]: Without dead ends: 188 [2021-12-22 00:11:36,475 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 00:11:36,477 INFO L933 BasicCegarLoop]: 141 mSDtfsCounter, 20 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 00:11:36,478 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 266 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 00:11:36,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-12-22 00:11:36,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2021-12-22 00:11:36,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 155 states have (on average 1.4193548387096775) internal successors, (220), 187 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:36,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 220 transitions. [2021-12-22 00:11:36,485 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 220 transitions. Word has length 29 [2021-12-22 00:11:36,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:11:36,485 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 220 transitions. [2021-12-22 00:11:36,486 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:36,486 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 220 transitions. [2021-12-22 00:11:36,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-22 00:11:36,487 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:11:36,487 INFO L514 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] [2021-12-22 00:11:36,488 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-22 00:11:36,488 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-22 00:11:36,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:11:36,488 INFO L85 PathProgramCache]: Analyzing trace with hash -910059888, now seen corresponding path program 1 times [2021-12-22 00:11:36,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:11:36,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352960979] [2021-12-22 00:11:36,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:11:36,489 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:11:36,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:11:36,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:11:36,611 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:11:36,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352960979] [2021-12-22 00:11:36,611 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352960979] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:11:36,611 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:11:36,611 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-22 00:11:36,612 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117732237] [2021-12-22 00:11:36,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:11:36,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-22 00:11:36,614 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:11:36,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-22 00:11:36,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-12-22 00:11:36,615 INFO L87 Difference]: Start difference. First operand 188 states and 220 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:36,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:11:36,892 INFO L93 Difference]: Finished difference Result 291 states and 320 transitions. [2021-12-22 00:11:36,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-22 00:11:36,893 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-12-22 00:11:36,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:11:36,893 INFO L225 Difference]: With dead ends: 291 [2021-12-22 00:11:36,893 INFO L226 Difference]: Without dead ends: 291 [2021-12-22 00:11:36,894 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-12-22 00:11:36,894 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 452 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 00:11:36,894 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [452 Valid, 710 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 00:11:36,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2021-12-22 00:11:36,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 200. [2021-12-22 00:11:36,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 167 states have (on average 1.3952095808383234) internal successors, (233), 199 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:36,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 233 transitions. [2021-12-22 00:11:36,897 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 233 transitions. Word has length 30 [2021-12-22 00:11:36,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:11:36,898 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 233 transitions. [2021-12-22 00:11:36,898 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:36,898 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 233 transitions. [2021-12-22 00:11:36,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-22 00:11:36,898 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:11:36,898 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:11:36,898 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-22 00:11:36,898 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-22 00:11:36,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:11:36,899 INFO L85 PathProgramCache]: Analyzing trace with hash 2071508259, now seen corresponding path program 1 times [2021-12-22 00:11:36,899 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:11:36,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557173263] [2021-12-22 00:11:36,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:11:36,899 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:11:36,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:11:36,951 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:11:36,951 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:11:36,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557173263] [2021-12-22 00:11:36,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557173263] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 00:11:36,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672858170] [2021-12-22 00:11:36,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:11:36,952 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 00:11:36,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 00:11:36,953 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-12-22 00:11:36,984 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-12-22 00:11:37,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:11:37,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-22 00:11:37,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:11:37,165 INFO L387 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-12-22 00:11:37,170 INFO L387 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-12-22 00:11:37,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 00:11:37,208 INFO L387 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-12-22 00:11:37,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 00:11:37,212 INFO L387 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-12-22 00:11:37,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 00:11:37,259 INFO L387 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-12-22 00:11:37,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 00:11:37,266 INFO L387 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-12-22 00:11:37,425 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 00:11:37,426 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-22 00:11:37,433 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 00:11:37,435 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 00:11:37,435 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2021-12-22 00:11:37,446 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:11:37,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 00:11:37,968 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2021-12-22 00:11:37,971 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2021-12-22 00:11:37,975 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2021-12-22 00:11:37,986 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2021-12-22 00:11:38,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:11:38,000 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672858170] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 00:11:38,000 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 00:11:38,000 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2021-12-22 00:11:38,001 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858295764] [2021-12-22 00:11:38,001 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 00:11:38,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-22 00:11:38,002 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:11:38,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-22 00:11:38,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-12-22 00:11:38,003 INFO L87 Difference]: Start difference. First operand 200 states and 233 transitions. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:38,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:11:38,283 INFO L93 Difference]: Finished difference Result 294 states and 323 transitions. [2021-12-22 00:11:38,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-22 00:11:38,284 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-12-22 00:11:38,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:11:38,285 INFO L225 Difference]: With dead ends: 294 [2021-12-22 00:11:38,285 INFO L226 Difference]: Without dead ends: 294 [2021-12-22 00:11:38,285 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2021-12-22 00:11:38,285 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 409 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 00:11:38,286 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [409 Valid, 809 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 371 Invalid, 0 Unknown, 47 Unchecked, 0.2s Time] [2021-12-22 00:11:38,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2021-12-22 00:11:38,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 228. [2021-12-22 00:11:38,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 195 states have (on average 1.405128205128205) internal successors, (274), 227 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:38,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 274 transitions. [2021-12-22 00:11:38,289 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 274 transitions. Word has length 32 [2021-12-22 00:11:38,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:11:38,289 INFO L470 AbstractCegarLoop]: Abstraction has 228 states and 274 transitions. [2021-12-22 00:11:38,289 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:38,289 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 274 transitions. [2021-12-22 00:11:38,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-22 00:11:38,289 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:11:38,289 INFO L514 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] [2021-12-22 00:11:38,310 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-12-22 00:11:38,495 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-12-22 00:11:38,495 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-22 00:11:38,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:11:38,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1393921825, now seen corresponding path program 1 times [2021-12-22 00:11:38,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:11:38,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993461342] [2021-12-22 00:11:38,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:11:38,496 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:11:38,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:11:38,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:11:38,601 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:11:38,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993461342] [2021-12-22 00:11:38,601 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993461342] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:11:38,601 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:11:38,601 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-22 00:11:38,601 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791098041] [2021-12-22 00:11:38,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:11:38,602 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-22 00:11:38,602 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:11:38,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-22 00:11:38,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-12-22 00:11:38,602 INFO L87 Difference]: Start difference. First operand 228 states and 274 transitions. Second operand has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:38,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:11:38,980 INFO L93 Difference]: Finished difference Result 334 states and 372 transitions. [2021-12-22 00:11:38,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-22 00:11:38,981 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-12-22 00:11:38,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:11:38,982 INFO L225 Difference]: With dead ends: 334 [2021-12-22 00:11:38,982 INFO L226 Difference]: Without dead ends: 334 [2021-12-22 00:11:38,982 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2021-12-22 00:11:38,982 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 499 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 00:11:38,982 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [499 Valid, 769 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 00:11:38,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2021-12-22 00:11:38,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 229. [2021-12-22 00:11:38,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 198 states have (on average 1.3737373737373737) internal successors, (272), 228 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:38,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 272 transitions. [2021-12-22 00:11:38,986 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 272 transitions. Word has length 35 [2021-12-22 00:11:38,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:11:38,986 INFO L470 AbstractCegarLoop]: Abstraction has 229 states and 272 transitions. [2021-12-22 00:11:38,986 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:38,986 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 272 transitions. [2021-12-22 00:11:38,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-22 00:11:38,986 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:11:38,986 INFO L514 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] [2021-12-22 00:11:38,986 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-22 00:11:38,986 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-22 00:11:38,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:11:38,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1393921826, now seen corresponding path program 1 times [2021-12-22 00:11:38,987 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:11:38,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921264224] [2021-12-22 00:11:38,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:11:38,987 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:11:39,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:11:39,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:11:39,148 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:11:39,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921264224] [2021-12-22 00:11:39,148 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921264224] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:11:39,148 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:11:39,148 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-22 00:11:39,149 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316189903] [2021-12-22 00:11:39,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:11:39,149 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-22 00:11:39,149 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:11:39,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-22 00:11:39,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-12-22 00:11:39,149 INFO L87 Difference]: Start difference. First operand 229 states and 272 transitions. Second operand has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:39,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:11:39,794 INFO L93 Difference]: Finished difference Result 408 states and 438 transitions. [2021-12-22 00:11:39,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-22 00:11:39,794 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-12-22 00:11:39,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:11:39,795 INFO L225 Difference]: With dead ends: 408 [2021-12-22 00:11:39,795 INFO L226 Difference]: Without dead ends: 408 [2021-12-22 00:11:39,796 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2021-12-22 00:11:39,796 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 454 mSDsluCounter, 877 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 1009 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-22 00:11:39,796 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [454 Valid, 1009 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 863 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-22 00:11:39,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2021-12-22 00:11:39,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 235. [2021-12-22 00:11:39,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 204 states have (on average 1.3676470588235294) internal successors, (279), 234 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:39,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 279 transitions. [2021-12-22 00:11:39,800 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 279 transitions. Word has length 35 [2021-12-22 00:11:39,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:11:39,800 INFO L470 AbstractCegarLoop]: Abstraction has 235 states and 279 transitions. [2021-12-22 00:11:39,800 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:39,800 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 279 transitions. [2021-12-22 00:11:39,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-22 00:11:39,800 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:11:39,800 INFO L514 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] [2021-12-22 00:11:39,800 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-22 00:11:39,800 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-22 00:11:39,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:11:39,801 INFO L85 PathProgramCache]: Analyzing trace with hash -470914463, now seen corresponding path program 1 times [2021-12-22 00:11:39,801 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:11:39,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722794007] [2021-12-22 00:11:39,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:11:39,801 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:11:39,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:11:40,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:11:40,023 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:11:40,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722794007] [2021-12-22 00:11:40,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722794007] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:11:40,023 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:11:40,023 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-22 00:11:40,023 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144527757] [2021-12-22 00:11:40,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:11:40,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-22 00:11:40,023 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:11:40,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-22 00:11:40,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-12-22 00:11:40,024 INFO L87 Difference]: Start difference. First operand 235 states and 279 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:40,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:11:40,875 INFO L93 Difference]: Finished difference Result 338 states and 368 transitions. [2021-12-22 00:11:40,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-22 00:11:40,876 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-12-22 00:11:40,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:11:40,877 INFO L225 Difference]: With dead ends: 338 [2021-12-22 00:11:40,877 INFO L226 Difference]: Without dead ends: 338 [2021-12-22 00:11:40,878 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=259, Invalid=1001, Unknown=0, NotChecked=0, Total=1260 [2021-12-22 00:11:40,878 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 583 mSDsluCounter, 897 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-22 00:11:40,878 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [583 Valid, 1002 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-22 00:11:40,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2021-12-22 00:11:40,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 235. [2021-12-22 00:11:40,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 204 states have (on average 1.3627450980392157) internal successors, (278), 234 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:40,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 278 transitions. [2021-12-22 00:11:40,883 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 278 transitions. Word has length 37 [2021-12-22 00:11:40,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:11:40,883 INFO L470 AbstractCegarLoop]: Abstraction has 235 states and 278 transitions. [2021-12-22 00:11:40,883 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:40,883 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 278 transitions. [2021-12-22 00:11:40,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-22 00:11:40,883 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:11:40,884 INFO L514 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] [2021-12-22 00:11:40,884 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-22 00:11:40,884 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-22 00:11:40,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:11:40,884 INFO L85 PathProgramCache]: Analyzing trace with hash -2012362969, now seen corresponding path program 1 times [2021-12-22 00:11:40,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:11:40,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857218917] [2021-12-22 00:11:40,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:11:40,884 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:11:40,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:11:40,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:11:40,949 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:11:40,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857218917] [2021-12-22 00:11:40,950 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857218917] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:11:40,950 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:11:40,950 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 00:11:40,950 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315185516] [2021-12-22 00:11:40,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:11:40,950 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 00:11:40,950 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:11:40,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 00:11:40,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 00:11:40,952 INFO L87 Difference]: Start difference. First operand 235 states and 278 transitions. Second operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:41,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:11:41,048 INFO L93 Difference]: Finished difference Result 234 states and 277 transitions. [2021-12-22 00:11:41,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 00:11:41,049 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-12-22 00:11:41,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:11:41,049 INFO L225 Difference]: With dead ends: 234 [2021-12-22 00:11:41,049 INFO L226 Difference]: Without dead ends: 234 [2021-12-22 00:11:41,049 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-22 00:11:41,050 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 4 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:11:41,050 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 418 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:11:41,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2021-12-22 00:11:41,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2021-12-22 00:11:41,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 204 states have (on average 1.357843137254902) internal successors, (277), 233 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:41,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 277 transitions. [2021-12-22 00:11:41,053 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 277 transitions. Word has length 37 [2021-12-22 00:11:41,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:11:41,053 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 277 transitions. [2021-12-22 00:11:41,053 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:41,053 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 277 transitions. [2021-12-22 00:11:41,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-22 00:11:41,053 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:11:41,053 INFO L514 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] [2021-12-22 00:11:41,053 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-22 00:11:41,053 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-22 00:11:41,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:11:41,053 INFO L85 PathProgramCache]: Analyzing trace with hash -2012362968, now seen corresponding path program 1 times [2021-12-22 00:11:41,054 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:11:41,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639722545] [2021-12-22 00:11:41,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:11:41,054 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:11:41,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:11:41,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:11:41,098 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:11:41,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639722545] [2021-12-22 00:11:41,098 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639722545] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:11:41,098 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:11:41,098 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 00:11:41,098 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30603525] [2021-12-22 00:11:41,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:11:41,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 00:11:41,099 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:11:41,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 00:11:41,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 00:11:41,099 INFO L87 Difference]: Start difference. First operand 234 states and 277 transitions. Second operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:41,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:11:41,219 INFO L93 Difference]: Finished difference Result 233 states and 276 transitions. [2021-12-22 00:11:41,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 00:11:41,219 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-12-22 00:11:41,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:11:41,220 INFO L225 Difference]: With dead ends: 233 [2021-12-22 00:11:41,220 INFO L226 Difference]: Without dead ends: 233 [2021-12-22 00:11:41,220 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-22 00:11:41,221 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 2 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:11:41,221 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 412 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:11:41,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2021-12-22 00:11:41,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2021-12-22 00:11:41,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 204 states have (on average 1.3529411764705883) internal successors, (276), 232 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:41,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 276 transitions. [2021-12-22 00:11:41,224 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 276 transitions. Word has length 37 [2021-12-22 00:11:41,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:11:41,224 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 276 transitions. [2021-12-22 00:11:41,224 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:41,224 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 276 transitions. [2021-12-22 00:11:41,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-22 00:11:41,224 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:11:41,224 INFO L514 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] [2021-12-22 00:11:41,224 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-12-22 00:11:41,224 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-22 00:11:41,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:11:41,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1939172976, now seen corresponding path program 1 times [2021-12-22 00:11:41,225 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:11:41,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71422760] [2021-12-22 00:11:41,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:11:41,225 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:11:41,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:11:41,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-22 00:11:41,282 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:11:41,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71422760] [2021-12-22 00:11:41,282 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71422760] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:11:41,282 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:11:41,282 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-22 00:11:41,283 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431563482] [2021-12-22 00:11:41,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:11:41,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-22 00:11:41,283 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:11:41,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-22 00:11:41,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-22 00:11:41,283 INFO L87 Difference]: Start difference. First operand 233 states and 276 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:41,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:11:41,427 INFO L93 Difference]: Finished difference Result 256 states and 299 transitions. [2021-12-22 00:11:41,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-22 00:11:41,428 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-12-22 00:11:41,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:11:41,429 INFO L225 Difference]: With dead ends: 256 [2021-12-22 00:11:41,429 INFO L226 Difference]: Without dead ends: 256 [2021-12-22 00:11:41,429 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2021-12-22 00:11:41,429 INFO L933 BasicCegarLoop]: 129 mSDtfsCounter, 65 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:11:41,430 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 535 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:11:41,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-12-22 00:11:41,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 242. [2021-12-22 00:11:41,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 213 states have (on average 1.3380281690140845) internal successors, (285), 241 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:41,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 285 transitions. [2021-12-22 00:11:41,433 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 285 transitions. Word has length 37 [2021-12-22 00:11:41,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:11:41,433 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 285 transitions. [2021-12-22 00:11:41,433 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:41,433 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 285 transitions. [2021-12-22 00:11:41,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-22 00:11:41,433 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:11:41,433 INFO L514 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-12-22 00:11:41,434 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-12-22 00:11:41,434 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-22 00:11:41,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:11:41,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1413983143, now seen corresponding path program 1 times [2021-12-22 00:11:41,434 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:11:41,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766397841] [2021-12-22 00:11:41,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:11:41,435 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:11:41,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:11:41,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:11:41,471 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:11:41,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766397841] [2021-12-22 00:11:41,471 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766397841] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:11:41,471 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:11:41,471 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 00:11:41,471 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002215851] [2021-12-22 00:11:41,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:11:41,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 00:11:41,471 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:11:41,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 00:11:41,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 00:11:41,472 INFO L87 Difference]: Start difference. First operand 242 states and 285 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:41,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:11:41,477 INFO L93 Difference]: Finished difference Result 243 states and 286 transitions. [2021-12-22 00:11:41,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 00:11:41,477 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-12-22 00:11:41,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:11:41,478 INFO L225 Difference]: With dead ends: 243 [2021-12-22 00:11:41,478 INFO L226 Difference]: Without dead ends: 243 [2021-12-22 00:11:41,478 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 00:11:41,478 INFO L933 BasicCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 00:11:41,478 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 286 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 00:11:41,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2021-12-22 00:11:41,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2021-12-22 00:11:41,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 214 states have (on average 1.3364485981308412) internal successors, (286), 242 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:41,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 286 transitions. [2021-12-22 00:11:41,481 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 286 transitions. Word has length 39 [2021-12-22 00:11:41,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:11:41,481 INFO L470 AbstractCegarLoop]: Abstraction has 243 states and 286 transitions. [2021-12-22 00:11:41,481 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:41,481 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 286 transitions. [2021-12-22 00:11:41,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-22 00:11:41,482 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:11:41,482 INFO L514 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-12-22 00:11:41,482 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-12-22 00:11:41,482 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-22 00:11:41,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:11:41,482 INFO L85 PathProgramCache]: Analyzing trace with hash -404838824, now seen corresponding path program 1 times [2021-12-22 00:11:41,482 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:11:41,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337486098] [2021-12-22 00:11:41,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:11:41,482 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:11:41,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:11:41,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-22 00:11:41,510 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:11:41,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337486098] [2021-12-22 00:11:41,510 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337486098] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:11:41,510 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:11:41,510 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 00:11:41,510 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464222713] [2021-12-22 00:11:41,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:11:41,510 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 00:11:41,510 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:11:41,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 00:11:41,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 00:11:41,511 INFO L87 Difference]: Start difference. First operand 243 states and 286 transitions. Second operand has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:41,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:11:41,536 INFO L93 Difference]: Finished difference Result 256 states and 290 transitions. [2021-12-22 00:11:41,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 00:11:41,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-12-22 00:11:41,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:11:41,537 INFO L225 Difference]: With dead ends: 256 [2021-12-22 00:11:41,537 INFO L226 Difference]: Without dead ends: 256 [2021-12-22 00:11:41,538 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 00:11:41,538 INFO L933 BasicCegarLoop]: 124 mSDtfsCounter, 99 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 00:11:41,538 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 152 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 00:11:41,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-12-22 00:11:41,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 244. [2021-12-22 00:11:41,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 215 states have (on average 1.3348837209302327) internal successors, (287), 243 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:41,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 287 transitions. [2021-12-22 00:11:41,541 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 287 transitions. Word has length 39 [2021-12-22 00:11:41,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:11:41,541 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 287 transitions. [2021-12-22 00:11:41,541 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:41,541 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 287 transitions. [2021-12-22 00:11:41,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-22 00:11:41,542 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:11:41,542 INFO L514 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] [2021-12-22 00:11:41,542 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-12-22 00:11:41,542 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-22 00:11:41,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:11:41,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1645380794, now seen corresponding path program 1 times [2021-12-22 00:11:41,542 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:11:41,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217054809] [2021-12-22 00:11:41,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:11:41,542 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:11:41,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:11:41,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:11:41,729 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:11:41,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217054809] [2021-12-22 00:11:41,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217054809] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:11:41,730 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:11:41,730 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-22 00:11:41,730 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677554036] [2021-12-22 00:11:41,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:11:41,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-22 00:11:41,730 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:11:41,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-22 00:11:41,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2021-12-22 00:11:41,731 INFO L87 Difference]: Start difference. First operand 244 states and 287 transitions. Second operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:42,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:11:42,377 INFO L93 Difference]: Finished difference Result 409 states and 439 transitions. [2021-12-22 00:11:42,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-22 00:11:42,378 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-12-22 00:11:42,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:11:42,379 INFO L225 Difference]: With dead ends: 409 [2021-12-22 00:11:42,379 INFO L226 Difference]: Without dead ends: 409 [2021-12-22 00:11:42,379 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=179, Invalid=633, Unknown=0, NotChecked=0, Total=812 [2021-12-22 00:11:42,380 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 468 mSDsluCounter, 1074 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-22 00:11:42,380 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [468 Valid, 1193 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-22 00:11:42,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2021-12-22 00:11:42,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 244. [2021-12-22 00:11:42,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 215 states have (on average 1.330232558139535) internal successors, (286), 243 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:42,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 286 transitions. [2021-12-22 00:11:42,383 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 286 transitions. Word has length 40 [2021-12-22 00:11:42,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:11:42,383 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 286 transitions. [2021-12-22 00:11:42,384 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:42,384 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 286 transitions. [2021-12-22 00:11:42,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-22 00:11:42,384 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:11:42,384 INFO L514 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] [2021-12-22 00:11:42,384 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-12-22 00:11:42,384 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-22 00:11:42,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:11:42,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1151553849, now seen corresponding path program 1 times [2021-12-22 00:11:42,384 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:11:42,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478745609] [2021-12-22 00:11:42,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:11:42,385 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:11:42,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:11:42,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:11:42,513 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:11:42,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478745609] [2021-12-22 00:11:42,513 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478745609] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:11:42,513 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:11:42,513 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-22 00:11:42,513 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18007601] [2021-12-22 00:11:42,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:11:42,514 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-22 00:11:42,514 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:11:42,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-22 00:11:42,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2021-12-22 00:11:42,514 INFO L87 Difference]: Start difference. First operand 244 states and 286 transitions. Second operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:42,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:11:42,919 INFO L93 Difference]: Finished difference Result 243 states and 285 transitions. [2021-12-22 00:11:42,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-22 00:11:42,938 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-12-22 00:11:42,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:11:42,939 INFO L225 Difference]: With dead ends: 243 [2021-12-22 00:11:42,939 INFO L226 Difference]: Without dead ends: 243 [2021-12-22 00:11:42,941 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2021-12-22 00:11:42,941 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 198 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 00:11:42,941 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [198 Valid, 766 Invalid, 758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 00:11:42,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2021-12-22 00:11:42,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2021-12-22 00:11:42,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 215 states have (on average 1.3255813953488371) internal successors, (285), 242 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:42,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 285 transitions. [2021-12-22 00:11:42,946 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 285 transitions. Word has length 40 [2021-12-22 00:11:42,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:11:42,946 INFO L470 AbstractCegarLoop]: Abstraction has 243 states and 285 transitions. [2021-12-22 00:11:42,947 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:42,947 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 285 transitions. [2021-12-22 00:11:42,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-22 00:11:42,947 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:11:42,947 INFO L514 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] [2021-12-22 00:11:42,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-12-22 00:11:42,948 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-22 00:11:42,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:11:42,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1151553848, now seen corresponding path program 1 times [2021-12-22 00:11:42,948 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:11:42,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919163772] [2021-12-22 00:11:42,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:11:42,948 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:11:42,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:11:43,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:11:43,097 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:11:43,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919163772] [2021-12-22 00:11:43,097 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919163772] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:11:43,097 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:11:43,097 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-22 00:11:43,097 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892213768] [2021-12-22 00:11:43,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:11:43,097 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-22 00:11:43,098 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:11:43,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-22 00:11:43,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2021-12-22 00:11:43,098 INFO L87 Difference]: Start difference. First operand 243 states and 285 transitions. Second operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:43,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:11:43,527 INFO L93 Difference]: Finished difference Result 242 states and 284 transitions. [2021-12-22 00:11:43,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-22 00:11:43,527 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-12-22 00:11:43,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:11:43,532 INFO L225 Difference]: With dead ends: 242 [2021-12-22 00:11:43,532 INFO L226 Difference]: Without dead ends: 242 [2021-12-22 00:11:43,533 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2021-12-22 00:11:43,533 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 196 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 00:11:43,533 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [196 Valid, 618 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 00:11:43,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-12-22 00:11:43,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2021-12-22 00:11:43,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 215 states have (on average 1.3209302325581396) internal successors, (284), 241 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:43,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 284 transitions. [2021-12-22 00:11:43,537 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 284 transitions. Word has length 40 [2021-12-22 00:11:43,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:11:43,537 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 284 transitions. [2021-12-22 00:11:43,537 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:43,537 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 284 transitions. [2021-12-22 00:11:43,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-22 00:11:43,537 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:11:43,537 INFO L514 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-12-22 00:11:43,537 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-12-22 00:11:43,538 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-22 00:11:43,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:11:43,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1626494914, now seen corresponding path program 1 times [2021-12-22 00:11:43,538 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:11:43,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126852600] [2021-12-22 00:11:43,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:11:43,538 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:11:43,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:11:43,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:11:43,593 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:11:43,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126852600] [2021-12-22 00:11:43,594 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126852600] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:11:43,594 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:11:43,594 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-22 00:11:43,594 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129539693] [2021-12-22 00:11:43,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:11:43,594 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-22 00:11:43,594 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:11:43,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-22 00:11:43,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-22 00:11:43,595 INFO L87 Difference]: Start difference. First operand 242 states and 284 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:43,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:11:43,735 INFO L93 Difference]: Finished difference Result 252 states and 296 transitions. [2021-12-22 00:11:43,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-22 00:11:43,735 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-12-22 00:11:43,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:11:43,736 INFO L225 Difference]: With dead ends: 252 [2021-12-22 00:11:43,736 INFO L226 Difference]: Without dead ends: 252 [2021-12-22 00:11:43,736 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2021-12-22 00:11:43,737 INFO L933 BasicCegarLoop]: 143 mSDtfsCounter, 33 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:11:43,737 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 449 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:11:43,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2021-12-22 00:11:43,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 239. [2021-12-22 00:11:43,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 213 states have (on average 1.3192488262910798) internal successors, (281), 238 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:43,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 281 transitions. [2021-12-22 00:11:43,740 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 281 transitions. Word has length 41 [2021-12-22 00:11:43,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:11:43,740 INFO L470 AbstractCegarLoop]: Abstraction has 239 states and 281 transitions. [2021-12-22 00:11:43,741 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:43,741 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 281 transitions. [2021-12-22 00:11:43,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-22 00:11:43,741 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:11:43,741 INFO L514 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] [2021-12-22 00:11:43,741 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-12-22 00:11:43,741 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-22 00:11:43,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:11:43,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1357177023, now seen corresponding path program 1 times [2021-12-22 00:11:43,742 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:11:43,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559255547] [2021-12-22 00:11:43,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:11:43,742 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:11:43,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:11:43,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-22 00:11:43,766 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:11:43,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559255547] [2021-12-22 00:11:43,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559255547] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:11:43,766 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:11:43,766 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 00:11:43,766 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922583521] [2021-12-22 00:11:43,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:11:43,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 00:11:43,766 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:11:43,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 00:11:43,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 00:11:43,767 INFO L87 Difference]: Start difference. First operand 239 states and 281 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:43,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:11:43,799 INFO L93 Difference]: Finished difference Result 249 states and 290 transitions. [2021-12-22 00:11:43,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 00:11:43,800 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-12-22 00:11:43,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:11:43,800 INFO L225 Difference]: With dead ends: 249 [2021-12-22 00:11:43,800 INFO L226 Difference]: Without dead ends: 249 [2021-12-22 00:11:43,801 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 00:11:43,802 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 91 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 00:11:43,803 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 170 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 00:11:43,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2021-12-22 00:11:43,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 237. [2021-12-22 00:11:43,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 212 states have (on average 1.3113207547169812) internal successors, (278), 236 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:43,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 278 transitions. [2021-12-22 00:11:43,806 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 278 transitions. Word has length 42 [2021-12-22 00:11:43,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:11:43,806 INFO L470 AbstractCegarLoop]: Abstraction has 237 states and 278 transitions. [2021-12-22 00:11:43,806 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:43,806 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 278 transitions. [2021-12-22 00:11:43,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-22 00:11:43,806 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:11:43,807 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:11:43,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-12-22 00:11:43,807 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-22 00:11:43,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:11:43,807 INFO L85 PathProgramCache]: Analyzing trace with hash -284774687, now seen corresponding path program 1 times [2021-12-22 00:11:43,807 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:11:43,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480701905] [2021-12-22 00:11:43,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:11:43,807 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:11:43,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:11:43,950 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:11:43,951 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:11:43,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480701905] [2021-12-22 00:11:43,951 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480701905] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 00:11:43,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734565363] [2021-12-22 00:11:43,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:11:43,951 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 00:11:43,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 00:11:43,952 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 00:11:43,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-22 00:11:44,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:11:44,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 29 conjunts are in the unsatisfiable core [2021-12-22 00:11:44,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:11:44,063 INFO L387 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-12-22 00:11:44,066 INFO L387 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-12-22 00:11:44,083 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-22 00:11:44,084 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2021-12-22 00:11:44,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 00:11:44,087 INFO L387 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-12-22 00:11:44,112 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-22 00:11:44,112 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2021-12-22 00:11:44,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 00:11:44,116 INFO L387 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-12-22 00:11:44,208 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-22 00:11:44,210 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-22 00:11:44,227 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-22 00:11:44,227 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 00:11:44,393 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-22 00:11:44,394 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734565363] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 00:11:44,394 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 00:11:44,394 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2021-12-22 00:11:44,394 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925343436] [2021-12-22 00:11:44,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 00:11:44,394 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-22 00:11:44,394 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:11:44,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-22 00:11:44,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-22 00:11:44,395 INFO L87 Difference]: Start difference. First operand 237 states and 278 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:44,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:11:44,567 INFO L93 Difference]: Finished difference Result 290 states and 324 transitions. [2021-12-22 00:11:44,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-22 00:11:44,568 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-12-22 00:11:44,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:11:44,568 INFO L225 Difference]: With dead ends: 290 [2021-12-22 00:11:44,568 INFO L226 Difference]: Without dead ends: 290 [2021-12-22 00:11:44,569 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 84 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-12-22 00:11:44,569 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 75 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:11:44,569 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 547 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:11:44,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2021-12-22 00:11:44,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 259. [2021-12-22 00:11:44,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 234 states have (on average 1.3205128205128205) internal successors, (309), 258 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:44,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 309 transitions. [2021-12-22 00:11:44,572 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 309 transitions. Word has length 42 [2021-12-22 00:11:44,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:11:44,572 INFO L470 AbstractCegarLoop]: Abstraction has 259 states and 309 transitions. [2021-12-22 00:11:44,572 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:44,572 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 309 transitions. [2021-12-22 00:11:44,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-22 00:11:44,572 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:11:44,572 INFO L514 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-12-22 00:11:44,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-22 00:11:44,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2021-12-22 00:11:44,799 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr69REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-22 00:11:44,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:11:44,800 INFO L85 PathProgramCache]: Analyzing trace with hash -877180804, now seen corresponding path program 1 times [2021-12-22 00:11:44,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:11:44,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862544037] [2021-12-22 00:11:44,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:11:44,800 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:11:44,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:11:44,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-22 00:11:44,869 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:11:44,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862544037] [2021-12-22 00:11:44,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862544037] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:11:44,869 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:11:44,869 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-22 00:11:44,869 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979723732] [2021-12-22 00:11:44,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:11:44,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-22 00:11:44,870 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:11:44,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-22 00:11:44,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-22 00:11:44,870 INFO L87 Difference]: Start difference. First operand 259 states and 309 transitions. Second operand has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:45,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:11:45,202 INFO L93 Difference]: Finished difference Result 306 states and 343 transitions. [2021-12-22 00:11:45,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-22 00:11:45,203 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-12-22 00:11:45,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:11:45,204 INFO L225 Difference]: With dead ends: 306 [2021-12-22 00:11:45,204 INFO L226 Difference]: Without dead ends: 306 [2021-12-22 00:11:45,204 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2021-12-22 00:11:45,204 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 358 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 00:11:45,204 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [358 Valid, 578 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 00:11:45,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2021-12-22 00:11:45,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 259. [2021-12-22 00:11:45,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 234 states have (on average 1.3162393162393162) internal successors, (308), 258 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:45,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 308 transitions. [2021-12-22 00:11:45,207 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 308 transitions. Word has length 43 [2021-12-22 00:11:45,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:11:45,207 INFO L470 AbstractCegarLoop]: Abstraction has 259 states and 308 transitions. [2021-12-22 00:11:45,207 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:45,208 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 308 transitions. [2021-12-22 00:11:45,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-22 00:11:45,208 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:11:45,208 INFO L514 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-12-22 00:11:45,208 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-12-22 00:11:45,208 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-22 00:11:45,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:11:45,208 INFO L85 PathProgramCache]: Analyzing trace with hash -877180803, now seen corresponding path program 1 times [2021-12-22 00:11:45,208 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:11:45,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648781181] [2021-12-22 00:11:45,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:11:45,209 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:11:45,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:11:45,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-22 00:11:45,344 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:11:45,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648781181] [2021-12-22 00:11:45,344 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648781181] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:11:45,344 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:11:45,344 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-22 00:11:45,345 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570456450] [2021-12-22 00:11:45,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:11:45,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-22 00:11:45,345 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:11:45,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-22 00:11:45,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-22 00:11:45,346 INFO L87 Difference]: Start difference. First operand 259 states and 308 transitions. Second operand has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:45,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:11:45,703 INFO L93 Difference]: Finished difference Result 306 states and 342 transitions. [2021-12-22 00:11:45,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-22 00:11:45,703 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-12-22 00:11:45,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:11:45,704 INFO L225 Difference]: With dead ends: 306 [2021-12-22 00:11:45,704 INFO L226 Difference]: Without dead ends: 306 [2021-12-22 00:11:45,705 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2021-12-22 00:11:45,705 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 251 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 00:11:45,705 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [251 Valid, 600 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 00:11:45,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2021-12-22 00:11:45,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 259. [2021-12-22 00:11:45,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 234 states have (on average 1.3034188034188035) internal successors, (305), 258 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:45,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 305 transitions. [2021-12-22 00:11:45,708 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 305 transitions. Word has length 43 [2021-12-22 00:11:45,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:11:45,708 INFO L470 AbstractCegarLoop]: Abstraction has 259 states and 305 transitions. [2021-12-22 00:11:45,709 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:45,709 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 305 transitions. [2021-12-22 00:11:45,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-22 00:11:45,709 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:11:45,709 INFO L514 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-12-22 00:11:45,709 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-12-22 00:11:45,709 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-22 00:11:45,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:11:45,710 INFO L85 PathProgramCache]: Analyzing trace with hash -238079422, now seen corresponding path program 1 times [2021-12-22 00:11:45,710 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:11:45,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886919933] [2021-12-22 00:11:45,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:11:45,710 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:11:45,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:11:45,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-22 00:11:45,743 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:11:45,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886919933] [2021-12-22 00:11:45,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886919933] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 00:11:45,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961241170] [2021-12-22 00:11:45,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:11:45,743 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 00:11:45,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 00:11:45,744 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 00:11:45,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-22 00:11:45,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:11:45,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-22 00:11:45,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:11:45,905 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 13 treesize of output 9 [2021-12-22 00:11:45,919 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-22 00:11:45,919 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 00:11:45,982 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-22 00:11:45,983 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1961241170] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 00:11:45,983 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 00:11:45,983 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2021-12-22 00:11:45,983 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847020846] [2021-12-22 00:11:45,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 00:11:45,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 00:11:45,984 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:11:45,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 00:11:45,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-22 00:11:45,984 INFO L87 Difference]: Start difference. First operand 259 states and 305 transitions. Second operand has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:46,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:11:46,058 INFO L93 Difference]: Finished difference Result 290 states and 336 transitions. [2021-12-22 00:11:46,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-22 00:11:46,059 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-12-22 00:11:46,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:11:46,059 INFO L225 Difference]: With dead ends: 290 [2021-12-22 00:11:46,059 INFO L226 Difference]: Without dead ends: 266 [2021-12-22 00:11:46,060 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-22 00:11:46,060 INFO L933 BasicCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:11:46,060 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 296 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 1 Unchecked, 0.1s Time] [2021-12-22 00:11:46,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2021-12-22 00:11:46,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2021-12-22 00:11:46,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 241 states have (on average 1.2946058091286308) internal successors, (312), 265 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:46,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 312 transitions. [2021-12-22 00:11:46,063 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 312 transitions. Word has length 43 [2021-12-22 00:11:46,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:11:46,063 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 312 transitions. [2021-12-22 00:11:46,064 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:46,064 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 312 transitions. [2021-12-22 00:11:46,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-22 00:11:46,064 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:11:46,064 INFO L514 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, 1] [2021-12-22 00:11:46,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-22 00:11:46,279 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 00:11:46,279 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-22 00:11:46,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:11:46,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1157151236, now seen corresponding path program 1 times [2021-12-22 00:11:46,280 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:11:46,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662466189] [2021-12-22 00:11:46,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:11:46,280 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:11:46,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:11:46,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:11:46,422 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:11:46,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662466189] [2021-12-22 00:11:46,423 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662466189] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:11:46,423 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:11:46,423 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-22 00:11:46,423 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267087666] [2021-12-22 00:11:46,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:11:46,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-22 00:11:46,423 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:11:46,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-22 00:11:46,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-22 00:11:46,424 INFO L87 Difference]: Start difference. First operand 266 states and 312 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:46,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:11:46,701 INFO L93 Difference]: Finished difference Result 291 states and 325 transitions. [2021-12-22 00:11:46,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-22 00:11:46,702 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-12-22 00:11:46,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:11:46,702 INFO L225 Difference]: With dead ends: 291 [2021-12-22 00:11:46,702 INFO L226 Difference]: Without dead ends: 291 [2021-12-22 00:11:46,703 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2021-12-22 00:11:46,703 INFO L933 BasicCegarLoop]: 136 mSDtfsCounter, 173 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 00:11:46,703 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 464 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 00:11:46,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2021-12-22 00:11:46,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 265. [2021-12-22 00:11:46,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 240 states have (on average 1.2916666666666667) internal successors, (310), 264 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:46,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 310 transitions. [2021-12-22 00:11:46,707 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 310 transitions. Word has length 45 [2021-12-22 00:11:46,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:11:46,707 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 310 transitions. [2021-12-22 00:11:46,707 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:46,707 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 310 transitions. [2021-12-22 00:11:46,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-22 00:11:46,707 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:11:46,707 INFO L514 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, 1] [2021-12-22 00:11:46,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-12-22 00:11:46,707 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-22 00:11:46,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:11:46,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1529922318, now seen corresponding path program 1 times [2021-12-22 00:11:46,708 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:11:46,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136083627] [2021-12-22 00:11:46,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:11:46,708 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:11:46,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:11:46,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:11:46,731 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:11:46,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136083627] [2021-12-22 00:11:46,731 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136083627] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:11:46,731 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:11:46,731 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 00:11:46,731 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271190476] [2021-12-22 00:11:46,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:11:46,732 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 00:11:46,732 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:11:46,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 00:11:46,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 00:11:46,733 INFO L87 Difference]: Start difference. First operand 265 states and 310 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:46,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:11:46,739 INFO L93 Difference]: Finished difference Result 405 states and 481 transitions. [2021-12-22 00:11:46,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 00:11:46,740 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-12-22 00:11:46,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:11:46,741 INFO L225 Difference]: With dead ends: 405 [2021-12-22 00:11:46,741 INFO L226 Difference]: Without dead ends: 405 [2021-12-22 00:11:46,741 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 00:11:46,742 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 56 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 00:11:46,742 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 313 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 00:11:46,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2021-12-22 00:11:46,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 302. [2021-12-22 00:11:46,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 277 states have (on average 1.3285198555956679) internal successors, (368), 301 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:46,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 368 transitions. [2021-12-22 00:11:46,746 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 368 transitions. Word has length 45 [2021-12-22 00:11:46,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:11:46,747 INFO L470 AbstractCegarLoop]: Abstraction has 302 states and 368 transitions. [2021-12-22 00:11:46,747 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:46,751 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 368 transitions. [2021-12-22 00:11:46,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-12-22 00:11:46,751 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:11:46,752 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:11:46,752 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-12-22 00:11:46,752 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-22 00:11:46,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:11:46,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1376244065, now seen corresponding path program 1 times [2021-12-22 00:11:46,752 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:11:46,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882170001] [2021-12-22 00:11:46,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:11:46,753 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:11:46,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:11:46,806 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:11:46,806 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:11:46,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882170001] [2021-12-22 00:11:46,806 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882170001] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:11:46,806 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:11:46,806 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 00:11:46,807 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766129441] [2021-12-22 00:11:46,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:11:46,807 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 00:11:46,807 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:11:46,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 00:11:46,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 00:11:46,808 INFO L87 Difference]: Start difference. First operand 302 states and 368 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:46,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:11:46,898 INFO L93 Difference]: Finished difference Result 249 states and 280 transitions. [2021-12-22 00:11:46,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 00:11:46,898 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-12-22 00:11:46,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:11:46,899 INFO L225 Difference]: With dead ends: 249 [2021-12-22 00:11:46,899 INFO L226 Difference]: Without dead ends: 249 [2021-12-22 00:11:46,899 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-22 00:11:46,900 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 56 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:11:46,900 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 524 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:11:46,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2021-12-22 00:11:46,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2021-12-22 00:11:46,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 225 states have (on average 1.2444444444444445) internal successors, (280), 248 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:46,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 280 transitions. [2021-12-22 00:11:46,903 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 280 transitions. Word has length 47 [2021-12-22 00:11:46,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:11:46,903 INFO L470 AbstractCegarLoop]: Abstraction has 249 states and 280 transitions. [2021-12-22 00:11:46,903 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:46,903 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 280 transitions. [2021-12-22 00:11:46,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-12-22 00:11:46,903 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:11:46,903 INFO L514 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, 1, 1, 1, 1, 1, 1] [2021-12-22 00:11:46,903 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-12-22 00:11:46,903 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-22 00:11:46,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:11:46,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1538447444, now seen corresponding path program 1 times [2021-12-22 00:11:46,904 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:11:46,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539084905] [2021-12-22 00:11:46,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:11:46,904 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:11:46,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:11:47,003 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-22 00:11:47,003 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:11:47,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539084905] [2021-12-22 00:11:47,003 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539084905] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:11:47,003 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:11:47,004 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-22 00:11:47,004 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838238592] [2021-12-22 00:11:47,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:11:47,005 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-22 00:11:47,005 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:11:47,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-22 00:11:47,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-12-22 00:11:47,006 INFO L87 Difference]: Start difference. First operand 249 states and 280 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:47,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:11:47,288 INFO L93 Difference]: Finished difference Result 238 states and 263 transitions. [2021-12-22 00:11:47,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-22 00:11:47,288 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2021-12-22 00:11:47,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:11:47,289 INFO L225 Difference]: With dead ends: 238 [2021-12-22 00:11:47,289 INFO L226 Difference]: Without dead ends: 238 [2021-12-22 00:11:47,290 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2021-12-22 00:11:47,291 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 469 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 00:11:47,291 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [469 Valid, 573 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 00:11:47,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2021-12-22 00:11:47,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 226. [2021-12-22 00:11:47,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 202 states have (on average 1.2623762376237624) internal successors, (255), 225 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:47,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 255 transitions. [2021-12-22 00:11:47,294 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 255 transitions. Word has length 50 [2021-12-22 00:11:47,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:11:47,294 INFO L470 AbstractCegarLoop]: Abstraction has 226 states and 255 transitions. [2021-12-22 00:11:47,294 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:47,294 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 255 transitions. [2021-12-22 00:11:47,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-12-22 00:11:47,295 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:11:47,295 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:11:47,295 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-12-22 00:11:47,295 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-22 00:11:47,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:11:47,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1188819543, now seen corresponding path program 1 times [2021-12-22 00:11:47,295 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:11:47,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202023730] [2021-12-22 00:11:47,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:11:47,296 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:11:47,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:11:47,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:11:47,326 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:11:47,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202023730] [2021-12-22 00:11:47,327 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202023730] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:11:47,327 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:11:47,327 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 00:11:47,327 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610972261] [2021-12-22 00:11:47,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:11:47,327 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 00:11:47,327 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:11:47,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 00:11:47,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 00:11:47,328 INFO L87 Difference]: Start difference. First operand 226 states and 255 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:47,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:11:47,402 INFO L93 Difference]: Finished difference Result 240 states and 270 transitions. [2021-12-22 00:11:47,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 00:11:47,402 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2021-12-22 00:11:47,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:11:47,403 INFO L225 Difference]: With dead ends: 240 [2021-12-22 00:11:47,403 INFO L226 Difference]: Without dead ends: 240 [2021-12-22 00:11:47,403 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-22 00:11:47,403 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 19 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:11:47,404 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 491 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:11:47,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2021-12-22 00:11:47,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 229. [2021-12-22 00:11:47,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 205 states have (on average 1.2585365853658537) internal successors, (258), 228 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:47,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 258 transitions. [2021-12-22 00:11:47,406 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 258 transitions. Word has length 52 [2021-12-22 00:11:47,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:11:47,406 INFO L470 AbstractCegarLoop]: Abstraction has 229 states and 258 transitions. [2021-12-22 00:11:47,407 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:11:47,407 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 258 transitions. [2021-12-22 00:11:47,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-12-22 00:11:47,407 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:11:47,407 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:11:47,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-12-22 00:11:47,407 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-22 00:11:47,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:11:47,408 INFO L85 PathProgramCache]: Analyzing trace with hash 426433170, now seen corresponding path program 1 times [2021-12-22 00:11:47,408 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:11:47,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969594300] [2021-12-22 00:11:47,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:11:47,408 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:11:47,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:11:47,672 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:11:47,673 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:11:47,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969594300] [2021-12-22 00:11:47,673 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969594300] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 00:11:47,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269981169] [2021-12-22 00:11:47,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:11:47,673 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 00:11:47,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 00:11:47,674 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 00:11:47,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-22 00:11:47,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:11:47,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 56 conjunts are in the unsatisfiable core [2021-12-22 00:11:47,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:11:47,815 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-12-22 00:11:47,842 INFO L387 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 13 treesize of output 9 [2021-12-22 00:11:47,845 INFO L387 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 13 treesize of output 9 [2021-12-22 00:11:47,945 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-22 00:11:47,945 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-22 00:11:48,002 INFO L353 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-12-22 00:11:48,003 INFO L387 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 1 case distinctions, treesize of input 21 treesize of output 26 [2021-12-22 00:11:48,021 INFO L353 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2021-12-22 00:11:48,021 INFO L387 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 1 case distinctions, treesize of input 21 treesize of output 20 [2021-12-22 00:11:48,147 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 00:11:48,147 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 50 [2021-12-22 00:11:48,153 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2021-12-22 00:11:48,374 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 00:11:48,382 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 42 [2021-12-22 00:11:48,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 00:11:48,386 INFO L387 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 23 treesize of output 23 [2021-12-22 00:11:48,656 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 00:11:48,657 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 50 [2021-12-22 00:11:48,669 INFO L387 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 27 treesize of output 27 [2021-12-22 00:11:49,121 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 00:11:49,122 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 28 [2021-12-22 00:11:49,127 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-22 00:11:49,127 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2021-12-22 00:11:49,320 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:11:49,320 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 00:11:49,528 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1482 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1482) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) (or (= (select |c_#valid| .cse0) 1) (and (forall ((v_ArrVal_1483 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1483) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 0)) (= .cse0 0))))) is different from false [2021-12-22 00:11:49,639 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1482 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_1482) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) (or (and (= .cse0 0) (forall ((v_ArrVal_1483 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_1483) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 0))) (= (select |c_#valid| .cse0) 1)))) is different from false [2021-12-22 00:11:49,671 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1482 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1482) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) (or (= (select |c_#valid| .cse0) 1) (and (= .cse0 0) (forall ((v_ArrVal_1483 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1483) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 0)))))) is different from false [2021-12-22 00:11:49,707 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1478 (Array Int Int)) (v_ArrVal_1482 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1478))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1482)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) (or (and (= .cse0 0) (forall ((v_ArrVal_1479 (Array Int Int)) (v_ArrVal_1483 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1479) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1478) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1483) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 0))) (= (select |c_#valid| .cse0) 1)))) is different from false [2021-12-22 00:11:49,729 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1478 (Array Int Int)) (v_ArrVal_1482 (Array Int Int))) (let ((.cse1 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1478))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1482)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) (or (and (forall ((v_ArrVal_1479 (Array Int Int)) (v_ArrVal_1483 (Array Int Int))) (= (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1479) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1478) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1483)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 0)) (= .cse1 0)) (= (select |c_#valid| .cse1) 1)))) is different from false [2021-12-22 00:11:49,771 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1478 (Array Int Int)) (v_ArrVal_1482 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_#t~malloc10#1.base|)) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1478))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1482)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) (or (= (select |c_#valid| .cse0) 1) (and (= .cse0 0) (forall ((v_ArrVal_1479 (Array Int Int)) (v_ArrVal_1483 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_#t~malloc10#1.offset|)) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1479) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_#t~malloc10#1.base|)) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1478) |c_ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1483) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 0)))))) is different from false [2021-12-22 00:11:49,832 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1478 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc10#1.base_8| Int) (v_ArrVal_1482 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| |v_ULTIMATE.start_main_#t~malloc10#1.base_8|)) |v_ULTIMATE.start_main_#t~malloc10#1.base_8| v_ArrVal_1478))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1482)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_8|) 0)) (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_8| 1) .cse0) 1) (and (= .cse0 0) (forall ((v_ArrVal_1479 (Array Int Int)) (v_ArrVal_1483 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| 0)) |v_ULTIMATE.start_main_#t~malloc10#1.base_8| v_ArrVal_1479) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| |v_ULTIMATE.start_main_#t~malloc10#1.base_8|)) |v_ULTIMATE.start_main_#t~malloc10#1.base_8| v_ArrVal_1478) |c_ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1483) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 0)))))) is different from false [2021-12-22 00:11:49,967 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1478 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc10#1.base_8| Int) (v_ArrVal_1482 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| |v_ULTIMATE.start_main_#t~malloc10#1.base_8|)) |v_ULTIMATE.start_main_#t~malloc10#1.base_8| v_ArrVal_1478))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1482)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_8|) 0)) (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_8| 1) .cse0) 1) (and (forall ((v_ArrVal_1479 (Array Int Int)) (v_ArrVal_1483 (Array Int Int))) (= 0 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| 0)) |v_ULTIMATE.start_main_#t~malloc10#1.base_8| v_ArrVal_1479) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| |v_ULTIMATE.start_main_#t~malloc10#1.base_8|)) |v_ULTIMATE.start_main_#t~malloc10#1.base_8| v_ArrVal_1478) |c_ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1483) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) (= .cse0 0))))) is different from false [2021-12-22 00:11:50,468 INFO L353 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2021-12-22 00:11:50,469 INFO L387 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 103 [2021-12-22 00:11:50,483 INFO L353 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2021-12-22 00:11:50,484 INFO L387 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 156 treesize of output 116 [2021-12-22 00:11:50,491 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 00:11:50,492 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 382 treesize of output 334 [2021-12-22 00:11:50,510 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-22 00:11:50,510 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 574 treesize of output 540 [2021-12-22 00:11:50,519 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 00:11:50,520 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 540 treesize of output 514 [2021-12-22 00:11:50,526 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 514 treesize of output 498 [2021-12-22 00:11:50,544 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 165 treesize of output 149 [2021-12-22 00:11:50,550 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 141 [2021-12-22 00:11:56,689 WARN L227 SmtUtils]: Spent 6.03s on a formula simplification. DAG size of input: 18 DAG size of output: 13 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-22 00:11:56,722 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-22 00:11:56,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269981169] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 00:11:56,723 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 00:11:56,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 15] total 40 [2021-12-22 00:11:56,724 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258265121] [2021-12-22 00:11:56,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 00:11:56,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-12-22 00:11:56,724 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:11:56,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-12-22 00:11:56,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=860, Unknown=8, NotChecked=536, Total=1560 [2021-12-22 00:11:56,725 INFO L87 Difference]: Start difference. First operand 229 states and 258 transitions. Second operand has 40 states, 40 states have (on average 3.675) internal successors, (147), 40 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:23,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:12:23,698 INFO L93 Difference]: Finished difference Result 352 states and 386 transitions. [2021-12-22 00:12:23,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-22 00:12:23,698 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 3.675) internal successors, (147), 40 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-12-22 00:12:23,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:12:23,699 INFO L225 Difference]: With dead ends: 352 [2021-12-22 00:12:23,699 INFO L226 Difference]: Without dead ends: 352 [2021-12-22 00:12:23,700 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 87 SyntacticMatches, 4 SemanticMatches, 54 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 33.1s TimeCoverageRelationStatistics Valid=345, Invalid=1921, Unknown=22, NotChecked=792, Total=3080 [2021-12-22 00:12:23,700 INFO L933 BasicCegarLoop]: 117 mSDtfsCounter, 418 mSDsluCounter, 1347 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 1464 SdHoareTripleChecker+Invalid, 2681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1960 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-22 00:12:23,701 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [418 Valid, 1464 Invalid, 2681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 691 Invalid, 0 Unknown, 1960 Unchecked, 0.4s Time] [2021-12-22 00:12:23,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2021-12-22 00:12:23,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 259. [2021-12-22 00:12:23,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 235 states have (on average 1.2340425531914894) internal successors, (290), 258 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:23,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 290 transitions. [2021-12-22 00:12:23,704 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 290 transitions. Word has length 54 [2021-12-22 00:12:23,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:12:23,704 INFO L470 AbstractCegarLoop]: Abstraction has 259 states and 290 transitions. [2021-12-22 00:12:23,704 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 3.675) internal successors, (147), 40 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:23,704 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 290 transitions. [2021-12-22 00:12:23,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-12-22 00:12:23,705 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:12:23,705 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:12:23,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-22 00:12:23,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 00:12:23,923 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-22 00:12:23,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:12:23,923 INFO L85 PathProgramCache]: Analyzing trace with hash -2048851803, now seen corresponding path program 1 times [2021-12-22 00:12:23,923 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:12:23,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715383691] [2021-12-22 00:12:23,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:23,923 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:12:23,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:24,179 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:12:24,181 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:12:24,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715383691] [2021-12-22 00:12:24,181 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715383691] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 00:12:24,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931204789] [2021-12-22 00:12:24,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:24,181 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 00:12:24,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 00:12:24,182 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 00:12:24,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-22 00:12:24,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:24,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 36 conjunts are in the unsatisfiable core [2021-12-22 00:12:24,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:12:24,318 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-12-22 00:12:24,407 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-22 00:12:24,408 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-22 00:12:24,439 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-12-22 00:12:24,520 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 00:12:24,520 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2021-12-22 00:12:24,607 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 00:12:24,607 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-22 00:12:24,688 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 00:12:24,688 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2021-12-22 00:12:24,871 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 00:12:24,872 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-22 00:12:24,922 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:12:24,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 00:12:25,405 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 00:12:25,406 INFO L387 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 31 [2021-12-22 00:12:25,414 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 00:12:25,414 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 252 treesize of output 227 [2021-12-22 00:12:25,420 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 212 treesize of output 204 [2021-12-22 00:12:25,430 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 00:12:25,430 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 204 treesize of output 196 [2021-12-22 00:12:35,895 WARN L227 SmtUtils]: Spent 8.08s on a formula simplification. DAG size of input: 75 DAG size of output: 60 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)