./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/sll-01-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c3fed411 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/sll-01-1.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 ba1a5c8c8cff607fde50280cfe0e0975858a4c6ed38f8443d26bb1773b66a31d --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-18 21:35:39,074 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-18 21:35:39,076 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-18 21:35:39,129 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-18 21:35:39,129 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-18 21:35:39,132 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-18 21:35:39,133 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-18 21:35:39,136 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-18 21:35:39,137 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-18 21:35:39,140 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-18 21:35:39,141 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-18 21:35:39,142 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-18 21:35:39,142 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-18 21:35:39,144 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-18 21:35:39,145 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-18 21:35:39,148 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-18 21:35:39,149 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-18 21:35:39,149 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-18 21:35:39,151 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-18 21:35:39,155 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-18 21:35:39,156 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-18 21:35:39,157 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-18 21:35:39,158 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-18 21:35:39,159 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-18 21:35:39,163 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-18 21:35:39,163 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-18 21:35:39,164 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-18 21:35:39,165 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-18 21:35:39,165 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-18 21:35:39,165 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-18 21:35:39,166 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-18 21:35:39,167 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-18 21:35:39,168 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-18 21:35:39,169 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-18 21:35:39,169 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-18 21:35:39,170 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-18 21:35:39,170 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-18 21:35:39,170 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-18 21:35:39,170 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-18 21:35:39,171 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-18 21:35:39,171 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-18 21:35:39,172 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-18 21:35:39,195 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-18 21:35:39,196 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-18 21:35:39,196 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-18 21:35:39,196 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-18 21:35:39,197 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-18 21:35:39,197 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-18 21:35:39,198 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-18 21:35:39,198 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-18 21:35:39,198 INFO L138 SettingsManager]: * Use SBE=true [2021-12-18 21:35:39,198 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-18 21:35:39,199 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-18 21:35:39,199 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-18 21:35:39,199 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-18 21:35:39,199 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-18 21:35:39,199 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-18 21:35:39,199 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-18 21:35:39,199 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-18 21:35:39,200 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-18 21:35:39,200 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-18 21:35:39,200 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-18 21:35:39,200 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-18 21:35:39,200 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-18 21:35:39,200 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-18 21:35:39,200 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-18 21:35:39,201 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-18 21:35:39,201 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 21:35:39,201 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-18 21:35:39,201 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-18 21:35:39,201 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-18 21:35:39,201 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-18 21:35:39,201 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-18 21:35:39,202 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 -> ba1a5c8c8cff607fde50280cfe0e0975858a4c6ed38f8443d26bb1773b66a31d [2021-12-18 21:35:39,395 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-18 21:35:39,415 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-18 21:35:39,417 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-18 21:35:39,418 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-18 21:35:39,419 INFO L275 PluginConnector]: CDTParser initialized [2021-12-18 21:35:39,420 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-01-1.i [2021-12-18 21:35:39,470 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41e55288a/3ed60e4cefd44dbf88ba2308f36e75bb/FLAG110e5a9e3 [2021-12-18 21:35:39,955 INFO L306 CDTParser]: Found 1 translation units. [2021-12-18 21:35:39,956 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i [2021-12-18 21:35:39,965 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41e55288a/3ed60e4cefd44dbf88ba2308f36e75bb/FLAG110e5a9e3 [2021-12-18 21:35:40,448 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41e55288a/3ed60e4cefd44dbf88ba2308f36e75bb [2021-12-18 21:35:40,458 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-18 21:35:40,459 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-18 21:35:40,460 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-18 21:35:40,460 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-18 21:35:40,463 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-18 21:35:40,463 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:35:40" (1/1) ... [2021-12-18 21:35:40,464 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1980249d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:35:40, skipping insertion in model container [2021-12-18 21:35:40,464 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:35:40" (1/1) ... [2021-12-18 21:35:40,468 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-18 21:35:40,490 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-18 21:35:40,658 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/sll-01-1.i[22034,22047] [2021-12-18 21:35:40,667 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/sll-01-1.i[22307,22320] [2021-12-18 21:35:40,671 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/sll-01-1.i[22516,22529] [2021-12-18 21:35:40,671 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/sll-01-1.i[22586,22599] [2021-12-18 21:35:40,675 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/sll-01-1.i[22853,22866] [2021-12-18 21:35:40,675 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/sll-01-1.i[22961,22974] [2021-12-18 21:35:40,677 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/sll-01-1.i[23192,23205] [2021-12-18 21:35:40,678 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/sll-01-1.i[23272,23285] [2021-12-18 21:35:40,680 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/sll-01-1.i[23351,23364] [2021-12-18 21:35:40,682 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/sll-01-1.i[23441,23454] [2021-12-18 21:35:40,683 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/sll-01-1.i[23619,23632] [2021-12-18 21:35:40,684 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/sll-01-1.i[23697,23710] [2021-12-18 21:35:40,685 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/sll-01-1.i[23774,23787] [2021-12-18 21:35:40,691 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 21:35:40,699 INFO L203 MainTranslator]: Completed pre-run [2021-12-18 21:35:40,724 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/sll-01-1.i[22034,22047] [2021-12-18 21:35:40,726 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/sll-01-1.i[22307,22320] [2021-12-18 21:35:40,727 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/sll-01-1.i[22516,22529] [2021-12-18 21:35:40,727 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/sll-01-1.i[22586,22599] [2021-12-18 21:35:40,728 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/sll-01-1.i[22853,22866] [2021-12-18 21:35:40,729 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/sll-01-1.i[22961,22974] [2021-12-18 21:35:40,730 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/sll-01-1.i[23192,23205] [2021-12-18 21:35:40,730 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/sll-01-1.i[23272,23285] [2021-12-18 21:35:40,731 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/sll-01-1.i[23351,23364] [2021-12-18 21:35:40,731 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/sll-01-1.i[23441,23454] [2021-12-18 21:35:40,732 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/sll-01-1.i[23619,23632] [2021-12-18 21:35:40,733 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/sll-01-1.i[23697,23710] [2021-12-18 21:35:40,733 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/sll-01-1.i[23774,23787] [2021-12-18 21:35:40,734 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 21:35:40,751 INFO L208 MainTranslator]: Completed translation [2021-12-18 21:35:40,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:35:40 WrapperNode [2021-12-18 21:35:40,753 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-18 21:35:40,753 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-18 21:35:40,754 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-18 21:35:40,755 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-18 21:35:40,759 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:35:40" (1/1) ... [2021-12-18 21:35:40,770 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:35:40" (1/1) ... [2021-12-18 21:35:40,785 INFO L137 Inliner]: procedures = 119, calls = 41, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 227 [2021-12-18 21:35:40,786 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-18 21:35:40,786 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-18 21:35:40,786 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-18 21:35:40,787 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-18 21:35:40,792 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:35:40" (1/1) ... [2021-12-18 21:35:40,792 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:35:40" (1/1) ... [2021-12-18 21:35:40,795 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:35:40" (1/1) ... [2021-12-18 21:35:40,795 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:35:40" (1/1) ... [2021-12-18 21:35:40,801 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:35:40" (1/1) ... [2021-12-18 21:35:40,805 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:35:40" (1/1) ... [2021-12-18 21:35:40,806 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:35:40" (1/1) ... [2021-12-18 21:35:40,809 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-18 21:35:40,809 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-18 21:35:40,809 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-18 21:35:40,809 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-18 21:35:40,810 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:35:40" (1/1) ... [2021-12-18 21:35:40,818 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 21:35:40,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:35:40,841 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-18 21:35:40,862 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-18 21:35:40,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-18 21:35:40,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-18 21:35:40,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-18 21:35:40,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-18 21:35:40,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-18 21:35:40,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-18 21:35:40,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-18 21:35:40,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-18 21:35:40,928 INFO L236 CfgBuilder]: Building ICFG [2021-12-18 21:35:40,929 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-18 21:35:41,310 INFO L277 CfgBuilder]: Performing block encoding [2021-12-18 21:35:41,315 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-18 21:35:41,316 INFO L301 CfgBuilder]: Removed 30 assume(true) statements. [2021-12-18 21:35:41,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:35:41 BoogieIcfgContainer [2021-12-18 21:35:41,317 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-18 21:35:41,318 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-18 21:35:41,319 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-18 21:35:41,321 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-18 21:35:41,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:35:40" (1/3) ... [2021-12-18 21:35:41,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76965f44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:35:41, skipping insertion in model container [2021-12-18 21:35:41,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:35:40" (2/3) ... [2021-12-18 21:35:41,334 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76965f44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:35:41, skipping insertion in model container [2021-12-18 21:35:41,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:35:41" (3/3) ... [2021-12-18 21:35:41,336 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-01-1.i [2021-12-18 21:35:41,342 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-18 21:35:41,342 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 78 error locations. [2021-12-18 21:35:41,367 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-18 21:35:41,371 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, 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-18 21:35:41,372 INFO L340 AbstractCegarLoop]: Starting to check reachability of 78 error locations. [2021-12-18 21:35:41,383 INFO L276 IsEmpty]: Start isEmpty. Operand has 190 states, 111 states have (on average 2.18018018018018) internal successors, (242), 189 states have internal predecessors, (242), 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-18 21:35:41,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-18 21:35:41,387 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:35:41,387 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-18 21:35:41,387 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-18 21:35:41,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:35:41,391 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-18 21:35:41,396 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:35:41,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207407003] [2021-12-18 21:35:41,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:35:41,397 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:35:41,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:35:41,505 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-18 21:35:41,505 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:35:41,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207407003] [2021-12-18 21:35:41,506 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207407003] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:35:41,507 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:35:41,507 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 21:35:41,508 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940602503] [2021-12-18 21:35:41,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:35:41,511 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 21:35:41,511 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:35:41,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 21:35:41,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 21:35:41,533 INFO L87 Difference]: Start difference. First operand has 190 states, 111 states have (on average 2.18018018018018) internal successors, (242), 189 states have internal predecessors, (242), 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-18 21:35:41,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:35:41,642 INFO L93 Difference]: Finished difference Result 192 states and 201 transitions. [2021-12-18 21:35:41,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 21:35:41,645 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-18 21:35:41,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:35:41,653 INFO L225 Difference]: With dead ends: 192 [2021-12-18 21:35:41,653 INFO L226 Difference]: Without dead ends: 188 [2021-12-18 21:35:41,655 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-18 21:35:41,657 INFO L933 BasicCegarLoop]: 117 mSDtfsCounter, 182 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:35:41,658 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [182 Valid, 119 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:35:41,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-12-18 21:35:41,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 183. [2021-12-18 21:35:41,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 113 states have (on average 1.7256637168141593) internal successors, (195), 182 states have internal predecessors, (195), 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-18 21:35:41,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 195 transitions. [2021-12-18 21:35:41,693 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 195 transitions. Word has length 3 [2021-12-18 21:35:41,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:35:41,695 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 195 transitions. [2021-12-18 21:35:41,696 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-18 21:35:41,696 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 195 transitions. [2021-12-18 21:35:41,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-18 21:35:41,696 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:35:41,697 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-18 21:35:41,697 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-18 21:35:41,698 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-18 21:35:41,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:35:41,700 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-18 21:35:41,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:35:41,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936204221] [2021-12-18 21:35:41,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:35:41,701 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:35:41,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:35:41,728 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-18 21:35:41,728 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:35:41,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936204221] [2021-12-18 21:35:41,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936204221] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:35:41,729 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:35:41,729 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 21:35:41,729 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415675794] [2021-12-18 21:35:41,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:35:41,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 21:35:41,731 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:35:41,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 21:35:41,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 21:35:41,732 INFO L87 Difference]: Start difference. First operand 183 states and 195 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-18 21:35:41,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:35:41,866 INFO L93 Difference]: Finished difference Result 213 states and 224 transitions. [2021-12-18 21:35:41,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 21:35:41,867 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-18 21:35:41,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:35:41,868 INFO L225 Difference]: With dead ends: 213 [2021-12-18 21:35:41,870 INFO L226 Difference]: Without dead ends: 213 [2021-12-18 21:35:41,870 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-18 21:35:41,871 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 172 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:35:41,872 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [172 Valid, 145 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:35:41,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-12-18 21:35:41,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 193. [2021-12-18 21:35:41,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 130 states have (on average 1.6615384615384616) internal successors, (216), 192 states have internal predecessors, (216), 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-18 21:35:41,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 216 transitions. [2021-12-18 21:35:41,887 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 216 transitions. Word has length 3 [2021-12-18 21:35:41,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:35:41,888 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 216 transitions. [2021-12-18 21:35:41,889 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-18 21:35:41,889 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 216 transitions. [2021-12-18 21:35:41,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-18 21:35:41,889 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:35:41,889 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-18 21:35:41,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-18 21:35:41,890 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-18 21:35:41,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:35:41,892 INFO L85 PathProgramCache]: Analyzing trace with hash 28691969, now seen corresponding path program 1 times [2021-12-18 21:35:41,892 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:35:41,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677826843] [2021-12-18 21:35:41,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:35:41,894 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:35:41,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:35:41,929 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-18 21:35:41,929 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:35:41,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677826843] [2021-12-18 21:35:41,930 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677826843] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:35:41,930 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:35:41,930 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 21:35:41,930 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672897289] [2021-12-18 21:35:41,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:35:41,931 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 21:35:41,931 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:35:41,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 21:35:41,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 21:35:41,932 INFO L87 Difference]: Start difference. First operand 193 states and 216 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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-18 21:35:41,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:35:41,959 INFO L93 Difference]: Finished difference Result 208 states and 219 transitions. [2021-12-18 21:35:41,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 21:35:41,959 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2021-12-18 21:35:41,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:35:41,961 INFO L225 Difference]: With dead ends: 208 [2021-12-18 21:35:41,961 INFO L226 Difference]: Without dead ends: 208 [2021-12-18 21:35:41,961 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-18 21:35:41,963 INFO L933 BasicCegarLoop]: 163 mSDtfsCounter, 169 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 21:35:41,964 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 196 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 21:35:41,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-12-18 21:35:41,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 191. [2021-12-18 21:35:41,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 129 states have (on average 1.6511627906976745) internal successors, (213), 190 states have internal predecessors, (213), 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-18 21:35:41,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 213 transitions. [2021-12-18 21:35:41,985 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 213 transitions. Word has length 5 [2021-12-18 21:35:41,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:35:41,985 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 213 transitions. [2021-12-18 21:35:41,985 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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-18 21:35:41,986 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 213 transitions. [2021-12-18 21:35:41,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-18 21:35:41,986 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:35:41,986 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:35:41,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-18 21:35:41,987 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-18 21:35:41,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:35:41,988 INFO L85 PathProgramCache]: Analyzing trace with hash -618617197, now seen corresponding path program 1 times [2021-12-18 21:35:41,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:35:41,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259647449] [2021-12-18 21:35:41,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:35:41,989 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:35:42,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:35:42,051 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-18 21:35:42,051 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:35:42,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259647449] [2021-12-18 21:35:42,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259647449] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:35:42,051 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:35:42,052 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 21:35:42,052 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227732301] [2021-12-18 21:35:42,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:35:42,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 21:35:42,052 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:35:42,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 21:35:42,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 21:35:42,053 INFO L87 Difference]: Start difference. First operand 191 states and 213 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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-18 21:35:42,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:35:42,168 INFO L93 Difference]: Finished difference Result 190 states and 212 transitions. [2021-12-18 21:35:42,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 21:35:42,168 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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 11 [2021-12-18 21:35:42,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:35:42,169 INFO L225 Difference]: With dead ends: 190 [2021-12-18 21:35:42,169 INFO L226 Difference]: Without dead ends: 190 [2021-12-18 21:35:42,169 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-18 21:35:42,171 INFO L933 BasicCegarLoop]: 175 mSDtfsCounter, 4 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:35:42,173 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 518 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:35:42,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2021-12-18 21:35:42,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2021-12-18 21:35:42,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 129 states have (on average 1.6434108527131783) internal successors, (212), 189 states have internal predecessors, (212), 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-18 21:35:42,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 212 transitions. [2021-12-18 21:35:42,183 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 212 transitions. Word has length 11 [2021-12-18 21:35:42,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:35:42,183 INFO L470 AbstractCegarLoop]: Abstraction has 190 states and 212 transitions. [2021-12-18 21:35:42,183 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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-18 21:35:42,183 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 212 transitions. [2021-12-18 21:35:42,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-18 21:35:42,184 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:35:42,184 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:35:42,184 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-18 21:35:42,184 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-18 21:35:42,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:35:42,185 INFO L85 PathProgramCache]: Analyzing trace with hash -618617196, now seen corresponding path program 1 times [2021-12-18 21:35:42,185 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:35:42,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200561938] [2021-12-18 21:35:42,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:35:42,186 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:35:42,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:35:42,277 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-18 21:35:42,278 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:35:42,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200561938] [2021-12-18 21:35:42,278 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200561938] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:35:42,278 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:35:42,278 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 21:35:42,279 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75568550] [2021-12-18 21:35:42,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:35:42,279 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 21:35:42,279 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:35:42,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 21:35:42,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 21:35:42,280 INFO L87 Difference]: Start difference. First operand 190 states and 212 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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-18 21:35:42,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:35:42,399 INFO L93 Difference]: Finished difference Result 189 states and 211 transitions. [2021-12-18 21:35:42,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 21:35:42,405 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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 11 [2021-12-18 21:35:42,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:35:42,406 INFO L225 Difference]: With dead ends: 189 [2021-12-18 21:35:42,406 INFO L226 Difference]: Without dead ends: 189 [2021-12-18 21:35:42,407 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-18 21:35:42,407 INFO L933 BasicCegarLoop]: 175 mSDtfsCounter, 2 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:35:42,408 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 529 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:35:42,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-12-18 21:35:42,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2021-12-18 21:35:42,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 129 states have (on average 1.6356589147286822) internal successors, (211), 188 states have internal predecessors, (211), 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-18 21:35:42,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 211 transitions. [2021-12-18 21:35:42,411 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 211 transitions. Word has length 11 [2021-12-18 21:35:42,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:35:42,411 INFO L470 AbstractCegarLoop]: Abstraction has 189 states and 211 transitions. [2021-12-18 21:35:42,411 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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-18 21:35:42,411 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 211 transitions. [2021-12-18 21:35:42,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-18 21:35:42,412 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:35:42,412 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:35:42,412 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-18 21:35:42,412 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-18 21:35:42,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:35:42,413 INFO L85 PathProgramCache]: Analyzing trace with hash -2054096635, now seen corresponding path program 1 times [2021-12-18 21:35:42,413 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:35:42,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279312862] [2021-12-18 21:35:42,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:35:42,414 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:35:42,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:35:42,456 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-18 21:35:42,456 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:35:42,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279312862] [2021-12-18 21:35:42,456 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279312862] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:35:42,456 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:35:42,456 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 21:35:42,456 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977793303] [2021-12-18 21:35:42,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:35:42,456 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 21:35:42,457 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:35:42,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 21:35:42,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 21:35:42,457 INFO L87 Difference]: Start difference. First operand 189 states and 211 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-18 21:35:42,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:35:42,463 INFO L93 Difference]: Finished difference Result 190 states and 212 transitions. [2021-12-18 21:35:42,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 21:35:42,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 13 [2021-12-18 21:35:42,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:35:42,464 INFO L225 Difference]: With dead ends: 190 [2021-12-18 21:35:42,464 INFO L226 Difference]: Without dead ends: 190 [2021-12-18 21:35:42,464 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-18 21:35:42,464 INFO L933 BasicCegarLoop]: 177 mSDtfsCounter, 0 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 348 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-18 21:35:42,464 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 348 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 21:35:42,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2021-12-18 21:35:42,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2021-12-18 21:35:42,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 130 states have (on average 1.6307692307692307) internal successors, (212), 189 states have internal predecessors, (212), 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-18 21:35:42,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 212 transitions. [2021-12-18 21:35:42,467 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 212 transitions. Word has length 13 [2021-12-18 21:35:42,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:35:42,467 INFO L470 AbstractCegarLoop]: Abstraction has 190 states and 212 transitions. [2021-12-18 21:35:42,467 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-18 21:35:42,468 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 212 transitions. [2021-12-18 21:35:42,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-18 21:35:42,468 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:35:42,468 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:35:42,468 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-18 21:35:42,468 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-18 21:35:42,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:35:42,469 INFO L85 PathProgramCache]: Analyzing trace with hash 479764253, now seen corresponding path program 1 times [2021-12-18 21:35:42,469 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:35:42,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275946008] [2021-12-18 21:35:42,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:35:42,469 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:35:42,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:35:42,533 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-18 21:35:42,534 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:35:42,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275946008] [2021-12-18 21:35:42,534 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275946008] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:35:42,534 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:35:42,534 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 21:35:42,534 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862844822] [2021-12-18 21:35:42,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:35:42,535 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 21:35:42,535 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:35:42,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 21:35:42,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-18 21:35:42,536 INFO L87 Difference]: Start difference. First operand 190 states and 212 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 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-18 21:35:42,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:35:42,732 INFO L93 Difference]: Finished difference Result 190 states and 211 transitions. [2021-12-18 21:35:42,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-18 21:35:42,732 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 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-18 21:35:42,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:35:42,733 INFO L225 Difference]: With dead ends: 190 [2021-12-18 21:35:42,733 INFO L226 Difference]: Without dead ends: 190 [2021-12-18 21:35:42,734 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-18 21:35:42,735 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 168 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:35:42,735 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 441 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:35:42,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2021-12-18 21:35:42,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2021-12-18 21:35:42,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 130 states have (on average 1.623076923076923) internal successors, (211), 188 states have internal predecessors, (211), 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-18 21:35:42,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 211 transitions. [2021-12-18 21:35:42,739 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 211 transitions. Word has length 14 [2021-12-18 21:35:42,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:35:42,740 INFO L470 AbstractCegarLoop]: Abstraction has 189 states and 211 transitions. [2021-12-18 21:35:42,740 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 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-18 21:35:42,740 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 211 transitions. [2021-12-18 21:35:42,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-18 21:35:42,741 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:35:42,741 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:35:42,741 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-18 21:35:42,741 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-18 21:35:42,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:35:42,742 INFO L85 PathProgramCache]: Analyzing trace with hash 479764254, now seen corresponding path program 1 times [2021-12-18 21:35:42,742 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:35:42,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649503028] [2021-12-18 21:35:42,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:35:42,743 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:35:42,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:35:42,877 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-18 21:35:42,878 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:35:42,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649503028] [2021-12-18 21:35:42,881 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649503028] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:35:42,881 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:35:42,881 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 21:35:42,881 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272566272] [2021-12-18 21:35:42,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:35:42,882 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 21:35:42,882 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:35:42,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 21:35:42,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-18 21:35:42,884 INFO L87 Difference]: Start difference. First operand 189 states and 211 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 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-18 21:35:43,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:35:43,123 INFO L93 Difference]: Finished difference Result 189 states and 210 transitions. [2021-12-18 21:35:43,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-18 21:35:43,124 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 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-18 21:35:43,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:35:43,124 INFO L225 Difference]: With dead ends: 189 [2021-12-18 21:35:43,124 INFO L226 Difference]: Without dead ends: 189 [2021-12-18 21:35:43,125 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-18 21:35:43,125 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 162 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 21:35:43,125 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 479 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 21:35:43,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-12-18 21:35:43,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 188. [2021-12-18 21:35:43,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 130 states have (on average 1.6153846153846154) internal successors, (210), 187 states have internal predecessors, (210), 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-18 21:35:43,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 210 transitions. [2021-12-18 21:35:43,128 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 210 transitions. Word has length 14 [2021-12-18 21:35:43,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:35:43,128 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 210 transitions. [2021-12-18 21:35:43,128 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 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-18 21:35:43,128 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 210 transitions. [2021-12-18 21:35:43,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-18 21:35:43,128 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:35:43,129 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:35:43,129 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-18 21:35:43,129 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-18 21:35:43,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:35:43,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1699725866, now seen corresponding path program 1 times [2021-12-18 21:35:43,129 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:35:43,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079368468] [2021-12-18 21:35:43,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:35:43,129 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:35:43,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:35:43,182 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-18 21:35:43,183 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:35:43,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079368468] [2021-12-18 21:35:43,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079368468] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:35:43,183 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:35:43,183 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 21:35:43,183 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259415792] [2021-12-18 21:35:43,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:35:43,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 21:35:43,184 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:35:43,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 21:35:43,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-18 21:35:43,184 INFO L87 Difference]: Start difference. First operand 188 states and 210 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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-18 21:35:43,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:35:43,331 INFO L93 Difference]: Finished difference Result 275 states and 303 transitions. [2021-12-18 21:35:43,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 21:35:43,332 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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-18 21:35:43,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:35:43,333 INFO L225 Difference]: With dead ends: 275 [2021-12-18 21:35:43,333 INFO L226 Difference]: Without dead ends: 275 [2021-12-18 21:35:43,333 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-18 21:35:43,333 INFO L933 BasicCegarLoop]: 151 mSDtfsCounter, 193 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:35:43,334 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 699 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:35:43,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2021-12-18 21:35:43,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 185. [2021-12-18 21:35:43,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 128 states have (on average 1.6171875) internal successors, (207), 184 states have internal predecessors, (207), 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-18 21:35:43,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 207 transitions. [2021-12-18 21:35:43,337 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 207 transitions. Word has length 15 [2021-12-18 21:35:43,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:35:43,337 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 207 transitions. [2021-12-18 21:35:43,337 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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-18 21:35:43,338 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 207 transitions. [2021-12-18 21:35:43,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-18 21:35:43,338 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:35:43,338 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:35:43,338 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-18 21:35:43,338 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-18 21:35:43,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:35:43,339 INFO L85 PathProgramCache]: Analyzing trace with hash -99613104, now seen corresponding path program 1 times [2021-12-18 21:35:43,339 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:35:43,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487354853] [2021-12-18 21:35:43,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:35:43,339 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:35:43,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:35:43,376 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-18 21:35:43,376 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:35:43,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487354853] [2021-12-18 21:35:43,376 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487354853] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:35:43,376 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:35:43,376 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 21:35:43,376 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616430650] [2021-12-18 21:35:43,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:35:43,377 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 21:35:43,377 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:35:43,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 21:35:43,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 21:35:43,377 INFO L87 Difference]: Start difference. First operand 185 states and 207 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-18 21:35:43,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:35:43,461 INFO L93 Difference]: Finished difference Result 276 states and 303 transitions. [2021-12-18 21:35:43,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 21:35:43,461 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 17 [2021-12-18 21:35:43,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:35:43,462 INFO L225 Difference]: With dead ends: 276 [2021-12-18 21:35:43,462 INFO L226 Difference]: Without dead ends: 276 [2021-12-18 21:35:43,463 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-18 21:35:43,463 INFO L933 BasicCegarLoop]: 152 mSDtfsCounter, 100 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:35:43,463 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 582 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:35:43,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2021-12-18 21:35:43,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 188. [2021-12-18 21:35:43,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 131 states have (on average 1.6030534351145038) internal successors, (210), 187 states have internal predecessors, (210), 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-18 21:35:43,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 210 transitions. [2021-12-18 21:35:43,466 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 210 transitions. Word has length 17 [2021-12-18 21:35:43,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:35:43,466 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 210 transitions. [2021-12-18 21:35:43,466 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-18 21:35:43,466 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 210 transitions. [2021-12-18 21:35:43,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-18 21:35:43,467 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:35:43,467 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:35:43,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-18 21:35:43,467 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-18 21:35:43,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:35:43,467 INFO L85 PathProgramCache]: Analyzing trace with hash -582241035, now seen corresponding path program 1 times [2021-12-18 21:35:43,468 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:35:43,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907458111] [2021-12-18 21:35:43,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:35:43,468 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:35:43,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:35:43,500 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-18 21:35:43,501 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:35:43,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907458111] [2021-12-18 21:35:43,501 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907458111] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:35:43,501 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:35:43,501 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 21:35:43,501 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347690982] [2021-12-18 21:35:43,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:35:43,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 21:35:43,501 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:35:43,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 21:35:43,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 21:35:43,502 INFO L87 Difference]: Start difference. First operand 188 states and 210 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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-18 21:35:43,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:35:43,626 INFO L93 Difference]: Finished difference Result 252 states and 267 transitions. [2021-12-18 21:35:43,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 21:35:43,626 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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 19 [2021-12-18 21:35:43,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:35:43,627 INFO L225 Difference]: With dead ends: 252 [2021-12-18 21:35:43,627 INFO L226 Difference]: Without dead ends: 252 [2021-12-18 21:35:43,627 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-18 21:35:43,628 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 246 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:35:43,628 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [246 Valid, 207 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:35:43,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2021-12-18 21:35:43,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 211. [2021-12-18 21:35:43,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 154 states have (on average 1.62987012987013) internal successors, (251), 210 states have internal predecessors, (251), 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-18 21:35:43,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 251 transitions. [2021-12-18 21:35:43,631 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 251 transitions. Word has length 19 [2021-12-18 21:35:43,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:35:43,631 INFO L470 AbstractCegarLoop]: Abstraction has 211 states and 251 transitions. [2021-12-18 21:35:43,631 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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-18 21:35:43,631 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 251 transitions. [2021-12-18 21:35:43,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-18 21:35:43,632 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:35:43,632 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:35:43,632 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-18 21:35:43,632 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-18 21:35:43,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:35:43,632 INFO L85 PathProgramCache]: Analyzing trace with hash -582241036, now seen corresponding path program 1 times [2021-12-18 21:35:43,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:35:43,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065720030] [2021-12-18 21:35:43,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:35:43,633 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:35:43,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:35:43,684 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-18 21:35:43,684 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:35:43,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065720030] [2021-12-18 21:35:43,684 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065720030] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:35:43,684 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:35:43,685 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 21:35:43,685 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883777321] [2021-12-18 21:35:43,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:35:43,685 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 21:35:43,685 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:35:43,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 21:35:43,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 21:35:43,686 INFO L87 Difference]: Start difference. First operand 211 states and 251 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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-18 21:35:43,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:35:43,771 INFO L93 Difference]: Finished difference Result 204 states and 237 transitions. [2021-12-18 21:35:43,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 21:35:43,772 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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 19 [2021-12-18 21:35:43,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:35:43,773 INFO L225 Difference]: With dead ends: 204 [2021-12-18 21:35:43,774 INFO L226 Difference]: Without dead ends: 204 [2021-12-18 21:35:43,774 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-18 21:35:43,774 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 243 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:35:43,775 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [243 Valid, 114 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:35:43,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2021-12-18 21:35:43,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 200. [2021-12-18 21:35:43,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 154 states have (on average 1.5194805194805194) internal successors, (234), 199 states have internal predecessors, (234), 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-18 21:35:43,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 234 transitions. [2021-12-18 21:35:43,779 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 234 transitions. Word has length 19 [2021-12-18 21:35:43,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:35:43,779 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 234 transitions. [2021-12-18 21:35:43,780 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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-18 21:35:43,780 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 234 transitions. [2021-12-18 21:35:43,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-18 21:35:43,782 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:35:43,782 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] [2021-12-18 21:35:43,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-18 21:35:43,783 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-18 21:35:43,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:35:43,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1187837214, now seen corresponding path program 1 times [2021-12-18 21:35:43,783 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:35:43,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251951621] [2021-12-18 21:35:43,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:35:43,784 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:35:43,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:35:43,809 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-18 21:35:43,810 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:35:43,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251951621] [2021-12-18 21:35:43,810 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251951621] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:35:43,810 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:35:43,810 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 21:35:43,810 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240611506] [2021-12-18 21:35:43,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:35:43,811 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 21:35:43,811 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:35:43,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 21:35:43,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 21:35:43,811 INFO L87 Difference]: Start difference. First operand 200 states and 234 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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-18 21:35:43,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:35:43,874 INFO L93 Difference]: Finished difference Result 230 states and 244 transitions. [2021-12-18 21:35:43,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 21:35:43,875 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 21 [2021-12-18 21:35:43,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:35:43,876 INFO L225 Difference]: With dead ends: 230 [2021-12-18 21:35:43,876 INFO L226 Difference]: Without dead ends: 230 [2021-12-18 21:35:43,876 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-18 21:35:43,877 INFO L933 BasicCegarLoop]: 138 mSDtfsCounter, 217 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:35:43,877 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [217 Valid, 264 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:35:43,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-12-18 21:35:43,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 198. [2021-12-18 21:35:43,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 153 states have (on average 1.5098039215686274) internal successors, (231), 197 states have internal predecessors, (231), 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-18 21:35:43,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 231 transitions. [2021-12-18 21:35:43,882 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 231 transitions. Word has length 21 [2021-12-18 21:35:43,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:35:43,883 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 231 transitions. [2021-12-18 21:35:43,883 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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-18 21:35:43,883 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 231 transitions. [2021-12-18 21:35:43,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-18 21:35:43,883 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:35:43,883 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-18 21:35:43,884 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-18 21:35:43,884 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-18 21:35:43,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:35:43,884 INFO L85 PathProgramCache]: Analyzing trace with hash 903845878, now seen corresponding path program 1 times [2021-12-18 21:35:43,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:35:43,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733834905] [2021-12-18 21:35:43,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:35:43,885 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:35:43,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:35:43,914 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-18 21:35:43,915 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:35:43,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733834905] [2021-12-18 21:35:43,915 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733834905] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:35:43,915 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:35:43,915 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 21:35:43,915 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601302584] [2021-12-18 21:35:43,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:35:43,916 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 21:35:43,916 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:35:43,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 21:35:43,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 21:35:43,917 INFO L87 Difference]: Start difference. First operand 198 states and 231 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 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-18 21:35:44,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:35:44,054 INFO L93 Difference]: Finished difference Result 198 states and 231 transitions. [2021-12-18 21:35:44,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 21:35:44,055 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 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-18 21:35:44,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:35:44,055 INFO L225 Difference]: With dead ends: 198 [2021-12-18 21:35:44,055 INFO L226 Difference]: Without dead ends: 198 [2021-12-18 21:35:44,056 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-18 21:35:44,056 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 98 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:35:44,056 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 427 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:35:44,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-12-18 21:35:44,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2021-12-18 21:35:44,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 153 states have (on average 1.5032679738562091) internal successors, (230), 196 states have internal predecessors, (230), 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-18 21:35:44,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 230 transitions. [2021-12-18 21:35:44,059 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 230 transitions. Word has length 23 [2021-12-18 21:35:44,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:35:44,059 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 230 transitions. [2021-12-18 21:35:44,059 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 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-18 21:35:44,059 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 230 transitions. [2021-12-18 21:35:44,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-18 21:35:44,059 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:35:44,059 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-18 21:35:44,060 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-18 21:35:44,060 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-18 21:35:44,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:35:44,060 INFO L85 PathProgramCache]: Analyzing trace with hash 903845879, now seen corresponding path program 1 times [2021-12-18 21:35:44,060 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:35:44,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902908665] [2021-12-18 21:35:44,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:35:44,060 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:35:44,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:35:44,120 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-18 21:35:44,121 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:35:44,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902908665] [2021-12-18 21:35:44,121 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902908665] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:35:44,121 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:35:44,121 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 21:35:44,121 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551195219] [2021-12-18 21:35:44,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:35:44,122 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 21:35:44,122 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:35:44,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 21:35:44,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 21:35:44,123 INFO L87 Difference]: Start difference. First operand 197 states and 230 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 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-18 21:35:44,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:35:44,286 INFO L93 Difference]: Finished difference Result 190 states and 223 transitions. [2021-12-18 21:35:44,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-18 21:35:44,287 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 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-18 21:35:44,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:35:44,288 INFO L225 Difference]: With dead ends: 190 [2021-12-18 21:35:44,288 INFO L226 Difference]: Without dead ends: 190 [2021-12-18 21:35:44,288 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-12-18 21:35:44,288 INFO L933 BasicCegarLoop]: 136 mSDtfsCounter, 41 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:35:44,288 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 488 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:35:44,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2021-12-18 21:35:44,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 183. [2021-12-18 21:35:44,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 148 states have (on average 1.4527027027027026) internal successors, (215), 182 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-18 21:35:44,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 215 transitions. [2021-12-18 21:35:44,291 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 215 transitions. Word has length 23 [2021-12-18 21:35:44,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:35:44,291 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 215 transitions. [2021-12-18 21:35:44,291 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 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-18 21:35:44,291 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 215 transitions. [2021-12-18 21:35:44,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-18 21:35:44,291 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:35:44,292 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] [2021-12-18 21:35:44,292 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-18 21:35:44,292 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-18 21:35:44,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:35:44,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1012497526, now seen corresponding path program 1 times [2021-12-18 21:35:44,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:35:44,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908678319] [2021-12-18 21:35:44,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:35:44,292 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:35:44,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:35:44,324 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-18 21:35:44,325 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:35:44,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908678319] [2021-12-18 21:35:44,325 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908678319] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:35:44,325 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:35:44,325 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 21:35:44,325 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370118379] [2021-12-18 21:35:44,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:35:44,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 21:35:44,326 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:35:44,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 21:35:44,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 21:35:44,326 INFO L87 Difference]: Start difference. First operand 183 states and 215 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 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-18 21:35:44,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:35:44,419 INFO L93 Difference]: Finished difference Result 186 states and 219 transitions. [2021-12-18 21:35:44,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-18 21:35:44,419 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 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 25 [2021-12-18 21:35:44,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:35:44,420 INFO L225 Difference]: With dead ends: 186 [2021-12-18 21:35:44,420 INFO L226 Difference]: Without dead ends: 186 [2021-12-18 21:35:44,420 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-12-18 21:35:44,421 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 38 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:35:44,421 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 592 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:35:44,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2021-12-18 21:35:44,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 179. [2021-12-18 21:35:44,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 146 states have (on average 1.4452054794520548) internal successors, (211), 178 states have internal predecessors, (211), 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-18 21:35:44,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 211 transitions. [2021-12-18 21:35:44,424 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 211 transitions. Word has length 25 [2021-12-18 21:35:44,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:35:44,424 INFO L470 AbstractCegarLoop]: Abstraction has 179 states and 211 transitions. [2021-12-18 21:35:44,424 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 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-18 21:35:44,424 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 211 transitions. [2021-12-18 21:35:44,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-18 21:35:44,425 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:35:44,425 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-18 21:35:44,425 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-18 21:35:44,425 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-18 21:35:44,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:35:44,426 INFO L85 PathProgramCache]: Analyzing trace with hash 476921454, now seen corresponding path program 1 times [2021-12-18 21:35:44,426 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:35:44,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715655791] [2021-12-18 21:35:44,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:35:44,426 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:35:44,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:35:44,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:35:44,442 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:35:44,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715655791] [2021-12-18 21:35:44,442 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715655791] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:35:44,443 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:35:44,443 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 21:35:44,443 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912099332] [2021-12-18 21:35:44,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:35:44,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 21:35:44,443 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:35:44,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 21:35:44,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 21:35:44,444 INFO L87 Difference]: Start difference. First operand 179 states and 211 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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-18 21:35:44,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:35:44,450 INFO L93 Difference]: Finished difference Result 252 states and 299 transitions. [2021-12-18 21:35:44,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 21:35:44,450 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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-18 21:35:44,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:35:44,451 INFO L225 Difference]: With dead ends: 252 [2021-12-18 21:35:44,451 INFO L226 Difference]: Without dead ends: 252 [2021-12-18 21:35:44,451 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-18 21:35:44,452 INFO L933 BasicCegarLoop]: 146 mSDtfsCounter, 50 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 283 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-18 21:35:44,452 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 283 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 21:35:44,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2021-12-18 21:35:44,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 185. [2021-12-18 21:35:44,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 152 states have (on average 1.4407894736842106) internal successors, (219), 184 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-18 21:35:44,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 219 transitions. [2021-12-18 21:35:44,455 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 219 transitions. Word has length 27 [2021-12-18 21:35:44,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:35:44,455 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 219 transitions. [2021-12-18 21:35:44,456 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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-18 21:35:44,456 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 219 transitions. [2021-12-18 21:35:44,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-18 21:35:44,456 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:35:44,456 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-18 21:35:44,456 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-18 21:35:44,456 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-18 21:35:44,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:35:44,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1899651814, now seen corresponding path program 1 times [2021-12-18 21:35:44,457 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:35:44,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330144212] [2021-12-18 21:35:44,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:35:44,457 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:35:44,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:35:44,477 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-18 21:35:44,477 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:35:44,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330144212] [2021-12-18 21:35:44,477 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330144212] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:35:44,477 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:35:44,477 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 21:35:44,478 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829186844] [2021-12-18 21:35:44,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:35:44,478 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 21:35:44,478 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:35:44,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 21:35:44,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 21:35:44,479 INFO L87 Difference]: Start difference. First operand 185 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-18 21:35:44,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:35:44,489 INFO L93 Difference]: Finished difference Result 183 states and 216 transitions. [2021-12-18 21:35:44,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 21:35:44,489 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-18 21:35:44,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:35:44,490 INFO L225 Difference]: With dead ends: 183 [2021-12-18 21:35:44,490 INFO L226 Difference]: Without dead ends: 183 [2021-12-18 21:35:44,490 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-18 21:35:44,491 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 20 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 254 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-18 21:35:44,491 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 254 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 21:35:44,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2021-12-18 21:35:44,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2021-12-18 21:35:44,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 151 states have (on average 1.4304635761589404) internal successors, (216), 182 states have internal predecessors, (216), 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-18 21:35:44,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 216 transitions. [2021-12-18 21:35:44,493 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 216 transitions. Word has length 28 [2021-12-18 21:35:44,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:35:44,494 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 216 transitions. [2021-12-18 21:35:44,494 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-18 21:35:44,494 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 216 transitions. [2021-12-18 21:35:44,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-18 21:35:44,494 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:35:44,494 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-18 21:35:44,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-18 21:35:44,495 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-18 21:35:44,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:35:44,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1240331581, now seen corresponding path program 1 times [2021-12-18 21:35:44,495 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:35:44,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833488463] [2021-12-18 21:35:44,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:35:44,496 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:35:44,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:35:44,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-18 21:35:44,580 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:35:44,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833488463] [2021-12-18 21:35:44,580 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833488463] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:35:44,580 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:35:44,580 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-18 21:35:44,581 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163403675] [2021-12-18 21:35:44,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:35:44,581 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 21:35:44,581 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:35:44,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 21:35:44,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-12-18 21:35:44,582 INFO L87 Difference]: Start difference. First operand 183 states and 216 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 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-18 21:35:44,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:35:44,866 INFO L93 Difference]: Finished difference Result 308 states and 341 transitions. [2021-12-18 21:35:44,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-18 21:35:44,866 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 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-18 21:35:44,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:35:44,867 INFO L225 Difference]: With dead ends: 308 [2021-12-18 21:35:44,867 INFO L226 Difference]: Without dead ends: 308 [2021-12-18 21:35:44,868 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-18 21:35:44,868 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 465 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 21:35:44,868 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [465 Valid, 781 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 21:35:44,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2021-12-18 21:35:44,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 216. [2021-12-18 21:35:44,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 184 states have (on average 1.3804347826086956) internal successors, (254), 215 states have internal predecessors, (254), 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-18 21:35:44,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 254 transitions. [2021-12-18 21:35:44,871 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 254 transitions. Word has length 29 [2021-12-18 21:35:44,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:35:44,871 INFO L470 AbstractCegarLoop]: Abstraction has 216 states and 254 transitions. [2021-12-18 21:35:44,871 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 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-18 21:35:44,871 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 254 transitions. [2021-12-18 21:35:44,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-18 21:35:44,872 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:35:44,872 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] [2021-12-18 21:35:44,872 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-18 21:35:44,872 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-18 21:35:44,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:35:44,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1786976426, now seen corresponding path program 1 times [2021-12-18 21:35:44,872 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:35:44,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132046786] [2021-12-18 21:35:44,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:35:44,872 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:35:44,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:35:44,917 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-18 21:35:44,918 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:35:44,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132046786] [2021-12-18 21:35:44,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132046786] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:35:44,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778121570] [2021-12-18 21:35:44,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:35:44,918 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:35:44,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:35:44,932 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-18 21:35:44,960 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-18 21:35:44,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:35:45,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 27 conjunts are in the unsatisfiable core [2021-12-18 21:35:45,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:35:45,085 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 21:35:45,088 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 21:35:45,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:35:45,165 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-18 21:35:45,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:35:45,169 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-18 21:35:45,300 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 21:35:45,301 INFO L388 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-18 21:35:45,326 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 21:35:45,327 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:35:45,327 INFO L388 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-18 21:35:45,337 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-18 21:35:45,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:35:45,829 INFO L388 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-18 21:35:45,832 INFO L388 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-18 21:35:45,836 INFO L388 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-18 21:35:45,841 INFO L388 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-18 21:35:45,857 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-18 21:35:45,857 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778121570] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:35:45,857 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 21:35:45,857 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2021-12-18 21:35:45,857 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643674876] [2021-12-18 21:35:45,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 21:35:45,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-18 21:35:45,858 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:35:45,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-18 21:35:45,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-12-18 21:35:45,859 INFO L87 Difference]: Start difference. First operand 216 states and 254 transitions. Second operand has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 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-18 21:35:46,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:35:46,088 INFO L93 Difference]: Finished difference Result 310 states and 344 transitions. [2021-12-18 21:35:46,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 21:35:46,089 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 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 31 [2021-12-18 21:35:46,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:35:46,090 INFO L225 Difference]: With dead ends: 310 [2021-12-18 21:35:46,090 INFO L226 Difference]: Without dead ends: 310 [2021-12-18 21:35:46,090 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2021-12-18 21:35:46,090 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 296 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 21:35:46,091 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [296 Valid, 816 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 351 Invalid, 0 Unknown, 41 Unchecked, 0.2s Time] [2021-12-18 21:35:46,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2021-12-18 21:35:46,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 251. [2021-12-18 21:35:46,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 219 states have (on average 1.3789954337899544) internal successors, (302), 250 states have internal predecessors, (302), 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-18 21:35:46,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 302 transitions. [2021-12-18 21:35:46,094 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 302 transitions. Word has length 31 [2021-12-18 21:35:46,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:35:46,094 INFO L470 AbstractCegarLoop]: Abstraction has 251 states and 302 transitions. [2021-12-18 21:35:46,095 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 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-18 21:35:46,095 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 302 transitions. [2021-12-18 21:35:46,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-18 21:35:46,095 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:35:46,095 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] [2021-12-18 21:35:46,115 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-18 21:35:46,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:35:46,312 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-18 21:35:46,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:35:46,312 INFO L85 PathProgramCache]: Analyzing trace with hash 883081196, now seen corresponding path program 1 times [2021-12-18 21:35:46,312 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:35:46,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406237393] [2021-12-18 21:35:46,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:35:46,312 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:35:46,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:35:46,363 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-18 21:35:46,363 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:35:46,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406237393] [2021-12-18 21:35:46,364 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406237393] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:35:46,364 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:35:46,364 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 21:35:46,364 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875324804] [2021-12-18 21:35:46,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:35:46,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 21:35:46,366 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:35:46,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 21:35:46,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 21:35:46,366 INFO L87 Difference]: Start difference. First operand 251 states and 302 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 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-18 21:35:46,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:35:46,467 INFO L93 Difference]: Finished difference Result 250 states and 301 transitions. [2021-12-18 21:35:46,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 21:35:46,467 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 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 33 [2021-12-18 21:35:46,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:35:46,468 INFO L225 Difference]: With dead ends: 250 [2021-12-18 21:35:46,468 INFO L226 Difference]: Without dead ends: 250 [2021-12-18 21:35:46,468 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-18 21:35:46,469 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 4 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:35:46,470 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 408 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:35:46,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2021-12-18 21:35:46,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2021-12-18 21:35:46,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 219 states have (on average 1.3744292237442923) internal successors, (301), 249 states have internal predecessors, (301), 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-18 21:35:46,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 301 transitions. [2021-12-18 21:35:46,473 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 301 transitions. Word has length 33 [2021-12-18 21:35:46,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:35:46,474 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 301 transitions. [2021-12-18 21:35:46,474 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 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-18 21:35:46,474 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 301 transitions. [2021-12-18 21:35:46,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-18 21:35:46,475 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:35:46,475 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] [2021-12-18 21:35:46,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-18 21:35:46,475 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-18 21:35:46,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:35:46,476 INFO L85 PathProgramCache]: Analyzing trace with hash 883081197, now seen corresponding path program 1 times [2021-12-18 21:35:46,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:35:46,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817235046] [2021-12-18 21:35:46,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:35:46,476 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:35:46,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:35:46,524 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-18 21:35:46,525 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:35:46,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817235046] [2021-12-18 21:35:46,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817235046] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:35:46,525 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:35:46,525 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 21:35:46,525 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17165606] [2021-12-18 21:35:46,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:35:46,526 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 21:35:46,526 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:35:46,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 21:35:46,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 21:35:46,527 INFO L87 Difference]: Start difference. First operand 250 states and 301 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 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-18 21:35:46,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:35:46,628 INFO L93 Difference]: Finished difference Result 249 states and 300 transitions. [2021-12-18 21:35:46,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 21:35:46,628 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 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 33 [2021-12-18 21:35:46,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:35:46,629 INFO L225 Difference]: With dead ends: 249 [2021-12-18 21:35:46,629 INFO L226 Difference]: Without dead ends: 249 [2021-12-18 21:35:46,630 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-18 21:35:46,630 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 2 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:35:46,631 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 411 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:35:46,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2021-12-18 21:35:46,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2021-12-18 21:35:46,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 219 states have (on average 1.36986301369863) internal successors, (300), 248 states have internal predecessors, (300), 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-18 21:35:46,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 300 transitions. [2021-12-18 21:35:46,634 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 300 transitions. Word has length 33 [2021-12-18 21:35:46,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:35:46,634 INFO L470 AbstractCegarLoop]: Abstraction has 249 states and 300 transitions. [2021-12-18 21:35:46,634 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 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-18 21:35:46,634 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 300 transitions. [2021-12-18 21:35:46,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-18 21:35:46,635 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:35:46,636 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] [2021-12-18 21:35:46,636 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-18 21:35:46,636 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-18 21:35:46,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:35:46,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1776374941, now seen corresponding path program 1 times [2021-12-18 21:35:46,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:35:46,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573159618] [2021-12-18 21:35:46,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:35:46,637 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:35:46,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:35:46,718 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-18 21:35:46,718 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:35:46,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573159618] [2021-12-18 21:35:46,719 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573159618] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:35:46,719 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:35:46,719 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-18 21:35:46,719 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510035935] [2021-12-18 21:35:46,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:35:46,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-18 21:35:46,719 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:35:46,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-18 21:35:46,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-12-18 21:35:46,720 INFO L87 Difference]: Start difference. First operand 249 states and 300 transitions. Second operand has 11 states, 10 states have (on average 3.4) internal successors, (34), 11 states have internal predecessors, (34), 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-18 21:35:47,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:35:47,100 INFO L93 Difference]: Finished difference Result 357 states and 399 transitions. [2021-12-18 21:35:47,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-18 21:35:47,100 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 11 states have internal predecessors, (34), 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 34 [2021-12-18 21:35:47,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:35:47,101 INFO L225 Difference]: With dead ends: 357 [2021-12-18 21:35:47,101 INFO L226 Difference]: Without dead ends: 357 [2021-12-18 21:35:47,102 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-18 21:35:47,102 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 380 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 21:35:47,102 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [380 Valid, 896 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-18 21:35:47,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2021-12-18 21:35:47,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 250. [2021-12-18 21:35:47,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 222 states have (on average 1.3423423423423424) internal successors, (298), 249 states have internal predecessors, (298), 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-18 21:35:47,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 298 transitions. [2021-12-18 21:35:47,106 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 298 transitions. Word has length 34 [2021-12-18 21:35:47,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:35:47,106 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 298 transitions. [2021-12-18 21:35:47,106 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 11 states have internal predecessors, (34), 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-18 21:35:47,106 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 298 transitions. [2021-12-18 21:35:47,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-18 21:35:47,107 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:35:47,107 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] [2021-12-18 21:35:47,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-18 21:35:47,107 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-18 21:35:47,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:35:47,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1776374942, now seen corresponding path program 1 times [2021-12-18 21:35:47,107 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:35:47,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581147731] [2021-12-18 21:35:47,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:35:47,107 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:35:47,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:35:47,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-18 21:35:47,262 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:35:47,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581147731] [2021-12-18 21:35:47,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581147731] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:35:47,263 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:35:47,263 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-18 21:35:47,263 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895511202] [2021-12-18 21:35:47,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:35:47,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-18 21:35:47,263 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:35:47,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-18 21:35:47,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-12-18 21:35:47,264 INFO L87 Difference]: Start difference. First operand 250 states and 298 transitions. Second operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 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-18 21:35:47,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:35:47,791 INFO L93 Difference]: Finished difference Result 426 states and 462 transitions. [2021-12-18 21:35:47,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-18 21:35:47,791 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 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 34 [2021-12-18 21:35:47,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:35:47,793 INFO L225 Difference]: With dead ends: 426 [2021-12-18 21:35:47,793 INFO L226 Difference]: Without dead ends: 426 [2021-12-18 21:35:47,793 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=425, Unknown=0, NotChecked=0, Total=552 [2021-12-18 21:35:47,793 INFO L933 BasicCegarLoop]: 130 mSDtfsCounter, 448 mSDsluCounter, 874 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 1004 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-18 21:35:47,793 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [448 Valid, 1004 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-18 21:35:47,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2021-12-18 21:35:47,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 256. [2021-12-18 21:35:47,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 228 states have (on average 1.337719298245614) internal successors, (305), 255 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-18 21:35:47,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 305 transitions. [2021-12-18 21:35:47,797 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 305 transitions. Word has length 34 [2021-12-18 21:35:47,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:35:47,797 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 305 transitions. [2021-12-18 21:35:47,797 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 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-18 21:35:47,798 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 305 transitions. [2021-12-18 21:35:47,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-18 21:35:47,798 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:35:47,798 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-18 21:35:47,798 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-18 21:35:47,798 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-18 21:35:47,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:35:47,798 INFO L85 PathProgramCache]: Analyzing trace with hash -2030948706, now seen corresponding path program 1 times [2021-12-18 21:35:47,799 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:35:47,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180574787] [2021-12-18 21:35:47,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:35:47,799 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:35:47,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:35:47,827 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-18 21:35:47,827 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:35:47,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180574787] [2021-12-18 21:35:47,828 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180574787] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:35:47,828 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:35:47,828 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 21:35:47,828 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365579014] [2021-12-18 21:35:47,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:35:47,828 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 21:35:47,828 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:35:47,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 21:35:47,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 21:35:47,829 INFO L87 Difference]: Start difference. First operand 256 states and 305 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 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-18 21:35:47,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:35:47,834 INFO L93 Difference]: Finished difference Result 258 states and 307 transitions. [2021-12-18 21:35:47,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 21:35:47,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 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-18 21:35:47,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:35:47,837 INFO L225 Difference]: With dead ends: 258 [2021-12-18 21:35:47,837 INFO L226 Difference]: Without dead ends: 258 [2021-12-18 21:35:47,837 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-18 21:35:47,838 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 274 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-18 21:35:47,838 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 274 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 21:35:47,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2021-12-18 21:35:47,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2021-12-18 21:35:47,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 230 states have (on average 1.3347826086956522) internal successors, (307), 257 states have internal predecessors, (307), 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-18 21:35:47,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 307 transitions. [2021-12-18 21:35:47,842 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 307 transitions. Word has length 35 [2021-12-18 21:35:47,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:35:47,842 INFO L470 AbstractCegarLoop]: Abstraction has 258 states and 307 transitions. [2021-12-18 21:35:47,843 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 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-18 21:35:47,843 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 307 transitions. [2021-12-18 21:35:47,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-18 21:35:47,843 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:35:47,843 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] [2021-12-18 21:35:47,843 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-18 21:35:47,843 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-18 21:35:47,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:35:47,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1994309533, now seen corresponding path program 1 times [2021-12-18 21:35:47,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:35:47,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027626545] [2021-12-18 21:35:47,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:35:47,844 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:35:47,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:35:48,013 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-18 21:35:48,013 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:35:48,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027626545] [2021-12-18 21:35:48,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027626545] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:35:48,013 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:35:48,014 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-18 21:35:48,014 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776273367] [2021-12-18 21:35:48,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:35:48,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-18 21:35:48,014 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:35:48,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-18 21:35:48,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-12-18 21:35:48,015 INFO L87 Difference]: Start difference. First operand 258 states and 307 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 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-18 21:35:48,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:35:48,606 INFO L93 Difference]: Finished difference Result 420 states and 456 transitions. [2021-12-18 21:35:48,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-18 21:35:48,606 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 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 36 [2021-12-18 21:35:48,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:35:48,610 INFO L225 Difference]: With dead ends: 420 [2021-12-18 21:35:48,610 INFO L226 Difference]: Without dead ends: 420 [2021-12-18 21:35:48,611 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2021-12-18 21:35:48,611 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 674 mSDsluCounter, 963 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 21:35:48,612 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [674 Valid, 1097 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-18 21:35:48,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2021-12-18 21:35:48,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 258. [2021-12-18 21:35:48,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 230 states have (on average 1.3304347826086957) internal successors, (306), 257 states have internal predecessors, (306), 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-18 21:35:48,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 306 transitions. [2021-12-18 21:35:48,616 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 306 transitions. Word has length 36 [2021-12-18 21:35:48,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:35:48,616 INFO L470 AbstractCegarLoop]: Abstraction has 258 states and 306 transitions. [2021-12-18 21:35:48,617 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 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-18 21:35:48,617 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 306 transitions. [2021-12-18 21:35:48,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-18 21:35:48,617 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:35:48,617 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] [2021-12-18 21:35:48,617 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-18 21:35:48,617 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-18 21:35:48,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:35:48,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1529477485, now seen corresponding path program 1 times [2021-12-18 21:35:48,618 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:35:48,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109731586] [2021-12-18 21:35:48,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:35:48,619 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:35:48,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:35:48,676 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-18 21:35:48,677 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:35:48,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109731586] [2021-12-18 21:35:48,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109731586] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:35:48,677 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:35:48,677 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 21:35:48,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156305153] [2021-12-18 21:35:48,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:35:48,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 21:35:48,678 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:35:48,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 21:35:48,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-18 21:35:48,678 INFO L87 Difference]: Start difference. First operand 258 states and 306 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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-18 21:35:48,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:35:48,839 INFO L93 Difference]: Finished difference Result 273 states and 321 transitions. [2021-12-18 21:35:48,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-18 21:35:48,840 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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 36 [2021-12-18 21:35:48,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:35:48,841 INFO L225 Difference]: With dead ends: 273 [2021-12-18 21:35:48,841 INFO L226 Difference]: Without dead ends: 273 [2021-12-18 21:35:48,841 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2021-12-18 21:35:48,841 INFO L933 BasicCegarLoop]: 123 mSDtfsCounter, 49 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:35:48,842 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 608 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:35:48,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-12-18 21:35:48,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 267. [2021-12-18 21:35:48,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 239 states have (on average 1.3179916317991631) internal successors, (315), 266 states have internal predecessors, (315), 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-18 21:35:48,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 315 transitions. [2021-12-18 21:35:48,845 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 315 transitions. Word has length 36 [2021-12-18 21:35:48,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:35:48,845 INFO L470 AbstractCegarLoop]: Abstraction has 267 states and 315 transitions. [2021-12-18 21:35:48,845 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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-18 21:35:48,845 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 315 transitions. [2021-12-18 21:35:48,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-18 21:35:48,846 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:35:48,846 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] [2021-12-18 21:35:48,846 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-12-18 21:35:48,846 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-18 21:35:48,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:35:48,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1197350168, now seen corresponding path program 1 times [2021-12-18 21:35:48,847 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:35:48,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165218629] [2021-12-18 21:35:48,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:35:48,847 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:35:48,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:35:48,942 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-18 21:35:48,943 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:35:48,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165218629] [2021-12-18 21:35:48,943 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165218629] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:35:48,943 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:35:48,943 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-18 21:35:48,944 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542692324] [2021-12-18 21:35:48,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:35:48,944 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-18 21:35:48,944 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:35:48,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-18 21:35:48,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-12-18 21:35:48,945 INFO L87 Difference]: Start difference. First operand 267 states and 315 transitions. Second operand has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 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-18 21:35:49,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:35:49,178 INFO L93 Difference]: Finished difference Result 267 states and 315 transitions. [2021-12-18 21:35:49,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-18 21:35:49,179 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 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 36 [2021-12-18 21:35:49,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:35:49,179 INFO L225 Difference]: With dead ends: 267 [2021-12-18 21:35:49,180 INFO L226 Difference]: Without dead ends: 267 [2021-12-18 21:35:49,180 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2021-12-18 21:35:49,180 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 78 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 21:35:49,180 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 647 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 21:35:49,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2021-12-18 21:35:49,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 266. [2021-12-18 21:35:49,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 239 states have (on average 1.3138075313807531) internal successors, (314), 265 states have internal predecessors, (314), 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-18 21:35:49,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 314 transitions. [2021-12-18 21:35:49,183 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 314 transitions. Word has length 36 [2021-12-18 21:35:49,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:35:49,184 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 314 transitions. [2021-12-18 21:35:49,184 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 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-18 21:35:49,184 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 314 transitions. [2021-12-18 21:35:49,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-18 21:35:49,184 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:35:49,184 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] [2021-12-18 21:35:49,184 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-12-18 21:35:49,184 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-18 21:35:49,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:35:49,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1197350169, now seen corresponding path program 1 times [2021-12-18 21:35:49,185 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:35:49,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736498161] [2021-12-18 21:35:49,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:35:49,185 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:35:49,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:35:49,289 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-18 21:35:49,290 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:35:49,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736498161] [2021-12-18 21:35:49,290 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736498161] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:35:49,290 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:35:49,290 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-18 21:35:49,290 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105985554] [2021-12-18 21:35:49,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:35:49,290 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-18 21:35:49,291 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:35:49,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-18 21:35:49,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-12-18 21:35:49,291 INFO L87 Difference]: Start difference. First operand 266 states and 314 transitions. Second operand has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 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-18 21:35:49,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:35:49,562 INFO L93 Difference]: Finished difference Result 266 states and 314 transitions. [2021-12-18 21:35:49,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-18 21:35:49,563 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 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 36 [2021-12-18 21:35:49,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:35:49,564 INFO L225 Difference]: With dead ends: 266 [2021-12-18 21:35:49,564 INFO L226 Difference]: Without dead ends: 266 [2021-12-18 21:35:49,564 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2021-12-18 21:35:49,564 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 72 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 21:35:49,565 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 714 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 21:35:49,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2021-12-18 21:35:49,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265. [2021-12-18 21:35:49,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 239 states have (on average 1.3096234309623431) internal successors, (313), 264 states have internal predecessors, (313), 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-18 21:35:49,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 313 transitions. [2021-12-18 21:35:49,567 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 313 transitions. Word has length 36 [2021-12-18 21:35:49,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:35:49,568 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 313 transitions. [2021-12-18 21:35:49,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 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-18 21:35:49,568 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 313 transitions. [2021-12-18 21:35:49,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-18 21:35:49,568 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:35:49,568 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-18 21:35:49,568 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-12-18 21:35:49,568 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-18 21:35:49,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:35:49,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1824914429, now seen corresponding path program 1 times [2021-12-18 21:35:49,569 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:35:49,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628806206] [2021-12-18 21:35:49,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:35:49,569 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:35:49,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:35:49,616 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-18 21:35:49,617 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:35:49,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628806206] [2021-12-18 21:35:49,617 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628806206] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:35:49,617 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:35:49,617 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 21:35:49,617 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294337097] [2021-12-18 21:35:49,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:35:49,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 21:35:49,618 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:35:49,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 21:35:49,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-18 21:35:49,618 INFO L87 Difference]: Start difference. First operand 265 states and 313 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-18 21:35:49,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:35:49,766 INFO L93 Difference]: Finished difference Result 275 states and 324 transitions. [2021-12-18 21:35:49,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 21:35:49,767 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-18 21:35:49,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:35:49,767 INFO L225 Difference]: With dead ends: 275 [2021-12-18 21:35:49,767 INFO L226 Difference]: Without dead ends: 275 [2021-12-18 21:35:49,768 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-18 21:35:49,768 INFO L933 BasicCegarLoop]: 138 mSDtfsCounter, 22 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:35:49,768 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 639 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:35:49,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2021-12-18 21:35:49,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 261. [2021-12-18 21:35:49,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 236 states have (on average 1.305084745762712) internal successors, (308), 260 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-18 21:35:49,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 308 transitions. [2021-12-18 21:35:49,790 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 308 transitions. Word has length 37 [2021-12-18 21:35:49,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:35:49,790 INFO L470 AbstractCegarLoop]: Abstraction has 261 states and 308 transitions. [2021-12-18 21:35:49,791 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-18 21:35:49,791 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 308 transitions. [2021-12-18 21:35:49,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-18 21:35:49,791 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:35:49,791 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] [2021-12-18 21:35:49,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-12-18 21:35:49,792 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-18 21:35:49,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:35:49,792 INFO L85 PathProgramCache]: Analyzing trace with hash -886173384, now seen corresponding path program 1 times [2021-12-18 21:35:49,792 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:35:49,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528471438] [2021-12-18 21:35:49,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:35:49,793 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:35:49,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:35:49,811 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-18 21:35:49,811 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:35:49,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528471438] [2021-12-18 21:35:49,811 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528471438] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:35:49,811 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:35:49,812 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 21:35:49,812 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410193615] [2021-12-18 21:35:49,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:35:49,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 21:35:49,812 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:35:49,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 21:35:49,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 21:35:49,813 INFO L87 Difference]: Start difference. First operand 261 states and 308 transitions. Second operand has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 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-18 21:35:49,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:35:49,835 INFO L93 Difference]: Finished difference Result 274 states and 312 transitions. [2021-12-18 21:35:49,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 21:35:49,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 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 38 [2021-12-18 21:35:49,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:35:49,836 INFO L225 Difference]: With dead ends: 274 [2021-12-18 21:35:49,836 INFO L226 Difference]: Without dead ends: 274 [2021-12-18 21:35:49,836 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-18 21:35:49,837 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 91 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 21:35:49,837 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 144 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 21:35:49,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2021-12-18 21:35:49,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 262. [2021-12-18 21:35:49,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 237 states have (on average 1.3037974683544304) internal successors, (309), 261 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-18 21:35:49,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 309 transitions. [2021-12-18 21:35:49,841 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 309 transitions. Word has length 38 [2021-12-18 21:35:49,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:35:49,841 INFO L470 AbstractCegarLoop]: Abstraction has 262 states and 309 transitions. [2021-12-18 21:35:49,841 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 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-18 21:35:49,841 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 309 transitions. [2021-12-18 21:35:49,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-18 21:35:49,842 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:35:49,842 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-18 21:35:49,842 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-12-18 21:35:49,842 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-18 21:35:49,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:35:49,842 INFO L85 PathProgramCache]: Analyzing trace with hash 196879808, now seen corresponding path program 1 times [2021-12-18 21:35:49,843 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:35:49,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480761379] [2021-12-18 21:35:49,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:35:49,843 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:35:49,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:35:50,050 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-18 21:35:50,051 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:35:50,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480761379] [2021-12-18 21:35:50,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480761379] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:35:50,051 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:35:50,051 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-18 21:35:50,051 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072284958] [2021-12-18 21:35:50,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:35:50,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-18 21:35:50,051 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:35:50,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-18 21:35:50,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2021-12-18 21:35:50,052 INFO L87 Difference]: Start difference. First operand 262 states and 309 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 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-18 21:35:50,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:35:50,674 INFO L93 Difference]: Finished difference Result 422 states and 457 transitions. [2021-12-18 21:35:50,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-18 21:35:50,674 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 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-18 21:35:50,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:35:50,676 INFO L225 Difference]: With dead ends: 422 [2021-12-18 21:35:50,676 INFO L226 Difference]: Without dead ends: 422 [2021-12-18 21:35:50,676 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=586, Unknown=0, NotChecked=0, Total=756 [2021-12-18 21:35:50,676 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 459 mSDsluCounter, 1120 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 1233 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-18 21:35:50,676 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [459 Valid, 1233 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-18 21:35:50,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2021-12-18 21:35:50,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 262. [2021-12-18 21:35:50,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 237 states have (on average 1.2995780590717299) internal successors, (308), 261 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-18 21:35:50,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 308 transitions. [2021-12-18 21:35:50,680 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 308 transitions. Word has length 39 [2021-12-18 21:35:50,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:35:50,681 INFO L470 AbstractCegarLoop]: Abstraction has 262 states and 308 transitions. [2021-12-18 21:35:50,681 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 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-18 21:35:50,681 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 308 transitions. [2021-12-18 21:35:50,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-18 21:35:50,681 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:35:50,681 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-18 21:35:50,681 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-12-18 21:35:50,681 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-18 21:35:50,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:35:50,682 INFO L85 PathProgramCache]: Analyzing trace with hash -2051878023, now seen corresponding path program 1 times [2021-12-18 21:35:50,682 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:35:50,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967049479] [2021-12-18 21:35:50,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:35:50,682 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:35:50,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:35:50,709 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-18 21:35:50,709 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:35:50,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967049479] [2021-12-18 21:35:50,709 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967049479] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:35:50,709 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:35:50,709 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 21:35:50,710 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066353937] [2021-12-18 21:35:50,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:35:50,710 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 21:35:50,710 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:35:50,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 21:35:50,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 21:35:50,711 INFO L87 Difference]: Start difference. First operand 262 states and 308 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 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-18 21:35:50,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:35:50,741 INFO L93 Difference]: Finished difference Result 264 states and 309 transitions. [2021-12-18 21:35:50,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 21:35:50,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 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-18 21:35:50,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:35:50,742 INFO L225 Difference]: With dead ends: 264 [2021-12-18 21:35:50,742 INFO L226 Difference]: Without dead ends: 264 [2021-12-18 21:35:50,745 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-18 21:35:50,745 INFO L933 BasicCegarLoop]: 117 mSDtfsCounter, 82 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 21:35:50,746 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 159 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 21:35:50,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2021-12-18 21:35:50,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 260. [2021-12-18 21:35:50,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 236 states have (on average 1.2923728813559323) internal successors, (305), 259 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-18 21:35:50,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 305 transitions. [2021-12-18 21:35:50,749 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 305 transitions. Word has length 41 [2021-12-18 21:35:50,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:35:50,749 INFO L470 AbstractCegarLoop]: Abstraction has 260 states and 305 transitions. [2021-12-18 21:35:50,750 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 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-18 21:35:50,750 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 305 transitions. [2021-12-18 21:35:50,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-18 21:35:50,750 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:35:50,750 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] [2021-12-18 21:35:50,750 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-12-18 21:35:50,751 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-18 21:35:50,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:35:50,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1173136884, now seen corresponding path program 1 times [2021-12-18 21:35:50,751 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:35:50,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140630501] [2021-12-18 21:35:50,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:35:50,752 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:35:50,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:35:50,832 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-18 21:35:50,833 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:35:50,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140630501] [2021-12-18 21:35:50,833 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140630501] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:35:50,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055154340] [2021-12-18 21:35:50,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:35:50,834 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:35:50,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:35:50,835 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-18 21:35:50,837 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-18 21:35:50,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:35:50,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-18 21:35:50,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:35:50,926 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 21:35:50,929 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 21:35:50,962 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-18 21:35:50,962 INFO L388 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-18 21:35:50,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:35:50,967 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-18 21:35:51,053 INFO L388 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-18 21:35:51,057 INFO L388 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-18 21:35:51,072 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-18 21:35:51,073 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:35:51,200 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-18 21:35:51,201 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055154340] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:35:51,201 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 21:35:51,201 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 9 [2021-12-18 21:35:51,201 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878755797] [2021-12-18 21:35:51,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 21:35:51,201 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 21:35:51,202 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:35:51,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 21:35:51,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-18 21:35:51,202 INFO L87 Difference]: Start difference. First operand 260 states and 305 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 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-18 21:35:51,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:35:51,484 INFO L93 Difference]: Finished difference Result 352 states and 387 transitions. [2021-12-18 21:35:51,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-18 21:35:51,485 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 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-18 21:35:51,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:35:51,486 INFO L225 Difference]: With dead ends: 352 [2021-12-18 21:35:51,486 INFO L226 Difference]: Without dead ends: 352 [2021-12-18 21:35:51,486 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2021-12-18 21:35:51,486 INFO L933 BasicCegarLoop]: 124 mSDtfsCounter, 176 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 21:35:51,487 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [176 Valid, 802 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 21:35:51,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2021-12-18 21:35:51,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 284. [2021-12-18 21:35:51,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 260 states have (on average 1.3038461538461539) internal successors, (339), 283 states have internal predecessors, (339), 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-18 21:35:51,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 339 transitions. [2021-12-18 21:35:51,490 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 339 transitions. Word has length 41 [2021-12-18 21:35:51,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:35:51,491 INFO L470 AbstractCegarLoop]: Abstraction has 284 states and 339 transitions. [2021-12-18 21:35:51,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 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-18 21:35:51,491 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 339 transitions. [2021-12-18 21:35:51,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-18 21:35:51,491 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:35:51,491 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-18 21:35:51,512 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-18 21:35:51,703 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,SelfDestructingSolverStorable33 [2021-12-18 21:35:51,703 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-18 21:35:51,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:35:51,703 INFO L85 PathProgramCache]: Analyzing trace with hash 816295160, now seen corresponding path program 1 times [2021-12-18 21:35:51,704 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:35:51,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822134626] [2021-12-18 21:35:51,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:35:51,704 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:35:51,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:35:51,786 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-18 21:35:51,786 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:35:51,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822134626] [2021-12-18 21:35:51,786 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822134626] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:35:51,786 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:35:51,787 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-18 21:35:51,787 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025476250] [2021-12-18 21:35:51,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:35:51,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-18 21:35:51,788 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:35:51,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-18 21:35:51,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-18 21:35:51,789 INFO L87 Difference]: Start difference. First operand 284 states and 339 transitions. Second operand has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 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-18 21:35:52,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:35:52,031 INFO L93 Difference]: Finished difference Result 348 states and 397 transitions. [2021-12-18 21:35:52,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-18 21:35:52,043 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 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-18 21:35:52,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:35:52,044 INFO L225 Difference]: With dead ends: 348 [2021-12-18 21:35:52,045 INFO L226 Difference]: Without dead ends: 348 [2021-12-18 21:35:52,045 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-18 21:35:52,045 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 352 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 21:35:52,045 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [352 Valid, 531 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 21:35:52,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2021-12-18 21:35:52,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 291. [2021-12-18 21:35:52,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 267 states have (on average 1.303370786516854) internal successors, (348), 290 states have internal predecessors, (348), 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-18 21:35:52,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 348 transitions. [2021-12-18 21:35:52,049 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 348 transitions. Word has length 42 [2021-12-18 21:35:52,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:35:52,049 INFO L470 AbstractCegarLoop]: Abstraction has 291 states and 348 transitions. [2021-12-18 21:35:52,050 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 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-18 21:35:52,050 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 348 transitions. [2021-12-18 21:35:52,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-18 21:35:52,050 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:35:52,050 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-18 21:35:52,050 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-12-18 21:35:52,051 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr64REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-18 21:35:52,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:35:52,051 INFO L85 PathProgramCache]: Analyzing trace with hash 816295161, now seen corresponding path program 1 times [2021-12-18 21:35:52,051 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:35:52,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229874940] [2021-12-18 21:35:52,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:35:52,052 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:35:52,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:35:52,153 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-18 21:35:52,153 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:35:52,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229874940] [2021-12-18 21:35:52,153 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229874940] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:35:52,153 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:35:52,153 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-18 21:35:52,154 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740490806] [2021-12-18 21:35:52,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:35:52,154 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-18 21:35:52,154 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:35:52,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-18 21:35:52,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-18 21:35:52,155 INFO L87 Difference]: Start difference. First operand 291 states and 348 transitions. Second operand has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 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-18 21:35:52,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:35:52,446 INFO L93 Difference]: Finished difference Result 348 states and 397 transitions. [2021-12-18 21:35:52,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-18 21:35:52,447 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 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-18 21:35:52,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:35:52,448 INFO L225 Difference]: With dead ends: 348 [2021-12-18 21:35:52,448 INFO L226 Difference]: Without dead ends: 348 [2021-12-18 21:35:52,448 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2021-12-18 21:35:52,448 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 301 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 21:35:52,449 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [301 Valid, 560 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 21:35:52,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2021-12-18 21:35:52,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 297. [2021-12-18 21:35:52,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 273 states have (on average 1.3003663003663004) internal successors, (355), 296 states have internal predecessors, (355), 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-18 21:35:52,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 355 transitions. [2021-12-18 21:35:52,452 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 355 transitions. Word has length 42 [2021-12-18 21:35:52,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:35:52,452 INFO L470 AbstractCegarLoop]: Abstraction has 297 states and 355 transitions. [2021-12-18 21:35:52,452 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 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-18 21:35:52,452 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 355 transitions. [2021-12-18 21:35:52,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-18 21:35:52,452 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:35:52,452 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-18 21:35:52,453 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-12-18 21:35:52,453 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-18 21:35:52,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:35:52,453 INFO L85 PathProgramCache]: Analyzing trace with hash 2007506213, now seen corresponding path program 1 times [2021-12-18 21:35:52,453 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:35:52,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181209476] [2021-12-18 21:35:52,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:35:52,453 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:35:52,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:35:52,488 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-18 21:35:52,488 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:35:52,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181209476] [2021-12-18 21:35:52,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181209476] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:35:52,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842083047] [2021-12-18 21:35:52,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:35:52,489 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:35:52,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:35:52,490 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-18 21:35:52,528 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-18 21:35:52,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:35:52,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-18 21:35:52,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:35:52,730 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 15 treesize of output 5 [2021-12-18 21:35:52,750 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-18 21:35:52,750 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:35:52,869 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-18 21:35:52,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1842083047] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:35:52,869 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 21:35:52,869 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2021-12-18 21:35:52,870 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705702306] [2021-12-18 21:35:52,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 21:35:52,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 21:35:52,871 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:35:52,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 21:35:52,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 21:35:52,872 INFO L87 Difference]: Start difference. First operand 297 states and 355 transitions. Second operand has 5 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 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-18 21:35:52,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:35:52,938 INFO L93 Difference]: Finished difference Result 328 states and 386 transitions. [2021-12-18 21:35:52,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 21:35:52,939 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 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-18 21:35:52,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:35:52,940 INFO L225 Difference]: With dead ends: 328 [2021-12-18 21:35:52,940 INFO L226 Difference]: Without dead ends: 304 [2021-12-18 21:35:52,940 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 79 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-18 21:35:52,942 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:35:52,942 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 380 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 55 Unchecked, 0.1s Time] [2021-12-18 21:35:52,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2021-12-18 21:35:52,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2021-12-18 21:35:52,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 280 states have (on average 1.292857142857143) internal successors, (362), 303 states have internal predecessors, (362), 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-18 21:35:52,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 362 transitions. [2021-12-18 21:35:52,946 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 362 transitions. Word has length 42 [2021-12-18 21:35:52,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:35:52,946 INFO L470 AbstractCegarLoop]: Abstraction has 304 states and 362 transitions. [2021-12-18 21:35:52,946 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 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-18 21:35:52,946 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 362 transitions. [2021-12-18 21:35:52,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-18 21:35:52,947 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:35:52,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, 1, 1, 1, 1] [2021-12-18 21:35:52,986 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-18 21:35:53,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:35:53,168 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-18 21:35:53,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:35:53,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1167718218, now seen corresponding path program 1 times [2021-12-18 21:35:53,168 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:35:53,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973579263] [2021-12-18 21:35:53,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:35:53,168 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:35:53,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:35:53,196 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-18 21:35:53,196 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:35:53,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973579263] [2021-12-18 21:35:53,196 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973579263] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:35:53,196 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:35:53,196 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 21:35:53,197 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766942836] [2021-12-18 21:35:53,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:35:53,198 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 21:35:53,198 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:35:53,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 21:35:53,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 21:35:53,198 INFO L87 Difference]: Start difference. First operand 304 states and 362 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-18 21:35:53,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:35:53,204 INFO L93 Difference]: Finished difference Result 458 states and 556 transitions. [2021-12-18 21:35:53,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 21:35:53,205 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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 44 [2021-12-18 21:35:53,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:35:53,206 INFO L225 Difference]: With dead ends: 458 [2021-12-18 21:35:53,206 INFO L226 Difference]: Without dead ends: 458 [2021-12-18 21:35:53,206 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-18 21:35:53,207 INFO L933 BasicCegarLoop]: 189 mSDtfsCounter, 54 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 318 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-18 21:35:53,207 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 318 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 21:35:53,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2021-12-18 21:35:53,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 340. [2021-12-18 21:35:53,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 316 states have (on average 1.3259493670886076) internal successors, (419), 339 states have internal predecessors, (419), 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-18 21:35:53,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 419 transitions. [2021-12-18 21:35:53,212 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 419 transitions. Word has length 44 [2021-12-18 21:35:53,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:35:53,212 INFO L470 AbstractCegarLoop]: Abstraction has 340 states and 419 transitions. [2021-12-18 21:35:53,212 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-18 21:35:53,212 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 419 transitions. [2021-12-18 21:35:53,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-18 21:35:53,213 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:35:53,213 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] [2021-12-18 21:35:53,213 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-12-18 21:35:53,213 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-18 21:35:53,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:35:53,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1519355336, now seen corresponding path program 1 times [2021-12-18 21:35:53,214 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:35:53,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290825476] [2021-12-18 21:35:53,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:35:53,214 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:35:53,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:35:53,349 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-18 21:35:53,350 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:35:53,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290825476] [2021-12-18 21:35:53,350 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290825476] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:35:53,350 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:35:53,350 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-18 21:35:53,350 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755384766] [2021-12-18 21:35:53,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:35:53,351 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 21:35:53,351 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:35:53,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 21:35:53,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-18 21:35:53,352 INFO L87 Difference]: Start difference. First operand 340 states and 419 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 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-18 21:35:53,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:35:53,591 INFO L93 Difference]: Finished difference Result 370 states and 439 transitions. [2021-12-18 21:35:53,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-18 21:35:53,591 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 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 44 [2021-12-18 21:35:53,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:35:53,592 INFO L225 Difference]: With dead ends: 370 [2021-12-18 21:35:53,593 INFO L226 Difference]: Without dead ends: 370 [2021-12-18 21:35:53,593 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-18 21:35:53,593 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 175 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 21:35:53,593 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 458 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 21:35:53,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2021-12-18 21:35:53,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 340. [2021-12-18 21:35:53,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 316 states have (on average 1.3227848101265822) internal successors, (418), 339 states have internal predecessors, (418), 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-18 21:35:53,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 418 transitions. [2021-12-18 21:35:53,598 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 418 transitions. Word has length 44 [2021-12-18 21:35:53,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:35:53,598 INFO L470 AbstractCegarLoop]: Abstraction has 340 states and 418 transitions. [2021-12-18 21:35:53,598 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 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-18 21:35:53,598 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 418 transitions. [2021-12-18 21:35:53,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-18 21:35:53,599 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:35:53,599 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] [2021-12-18 21:35:53,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-12-18 21:35:53,600 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-18 21:35:53,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:35:53,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1190454621, now seen corresponding path program 1 times [2021-12-18 21:35:53,601 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:35:53,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495428062] [2021-12-18 21:35:53,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:35:53,601 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:35:53,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:35:53,638 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-18 21:35:53,639 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:35:53,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495428062] [2021-12-18 21:35:53,639 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495428062] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:35:53,639 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:35:53,639 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 21:35:53,639 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40138135] [2021-12-18 21:35:53,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:35:53,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 21:35:53,640 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:35:53,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 21:35:53,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 21:35:53,641 INFO L87 Difference]: Start difference. First operand 340 states and 418 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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-18 21:35:53,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:35:53,705 INFO L93 Difference]: Finished difference Result 287 states and 330 transitions. [2021-12-18 21:35:53,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 21:35:53,706 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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 46 [2021-12-18 21:35:53,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:35:53,707 INFO L225 Difference]: With dead ends: 287 [2021-12-18 21:35:53,707 INFO L226 Difference]: Without dead ends: 287 [2021-12-18 21:35:53,707 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-18 21:35:53,707 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 54 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:35:53,707 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 504 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:35:53,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2021-12-18 21:35:53,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 286. [2021-12-18 21:35:53,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 263 states have (on average 1.2509505703422052) internal successors, (329), 285 states have internal predecessors, (329), 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-18 21:35:53,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 329 transitions. [2021-12-18 21:35:53,717 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 329 transitions. Word has length 46 [2021-12-18 21:35:53,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:35:53,717 INFO L470 AbstractCegarLoop]: Abstraction has 286 states and 329 transitions. [2021-12-18 21:35:53,717 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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-18 21:35:53,717 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 329 transitions. [2021-12-18 21:35:53,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-12-18 21:35:53,718 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:35:53,718 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] [2021-12-18 21:35:53,718 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-12-18 21:35:53,718 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-18 21:35:53,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:35:53,719 INFO L85 PathProgramCache]: Analyzing trace with hash 120277254, now seen corresponding path program 1 times [2021-12-18 21:35:53,719 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:35:53,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947428894] [2021-12-18 21:35:53,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:35:53,719 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:35:53,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:35:53,794 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-18 21:35:53,794 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:35:53,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947428894] [2021-12-18 21:35:53,795 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947428894] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:35:53,795 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:35:53,795 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-18 21:35:53,795 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265950777] [2021-12-18 21:35:53,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:35:53,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-18 21:35:53,796 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:35:53,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-18 21:35:53,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-18 21:35:53,798 INFO L87 Difference]: Start difference. First operand 286 states and 329 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 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-18 21:35:53,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:35:53,995 INFO L93 Difference]: Finished difference Result 279 states and 317 transitions. [2021-12-18 21:35:53,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-18 21:35:53,996 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 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 49 [2021-12-18 21:35:53,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:35:53,997 INFO L225 Difference]: With dead ends: 279 [2021-12-18 21:35:53,997 INFO L226 Difference]: Without dead ends: 279 [2021-12-18 21:35:53,997 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2021-12-18 21:35:53,997 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 287 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:35:53,997 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [287 Valid, 493 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:35:53,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2021-12-18 21:35:54,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 263. [2021-12-18 21:35:54,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 240 states have (on average 1.2666666666666666) internal successors, (304), 262 states have internal predecessors, (304), 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-18 21:35:54,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 304 transitions. [2021-12-18 21:35:54,001 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 304 transitions. Word has length 49 [2021-12-18 21:35:54,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:35:54,001 INFO L470 AbstractCegarLoop]: Abstraction has 263 states and 304 transitions. [2021-12-18 21:35:54,001 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 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-18 21:35:54,001 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 304 transitions. [2021-12-18 21:35:54,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-12-18 21:35:54,001 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:35:54,001 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] [2021-12-18 21:35:54,001 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-12-18 21:35:54,001 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-18 21:35:54,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:35:54,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1590511077, now seen corresponding path program 1 times [2021-12-18 21:35:54,002 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:35:54,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152587443] [2021-12-18 21:35:54,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:35:54,002 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:35:54,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:35:54,035 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-18 21:35:54,035 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:35:54,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152587443] [2021-12-18 21:35:54,035 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152587443] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:35:54,035 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:35:54,035 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 21:35:54,036 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66653535] [2021-12-18 21:35:54,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:35:54,036 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 21:35:54,036 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:35:54,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 21:35:54,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 21:35:54,037 INFO L87 Difference]: Start difference. First operand 263 states and 304 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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-18 21:35:54,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:35:54,102 INFO L93 Difference]: Finished difference Result 277 states and 318 transitions. [2021-12-18 21:35:54,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 21:35:54,102 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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-18 21:35:54,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:35:54,105 INFO L225 Difference]: With dead ends: 277 [2021-12-18 21:35:54,105 INFO L226 Difference]: Without dead ends: 277 [2021-12-18 21:35:54,105 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-18 21:35:54,105 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 19 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:35:54,106 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 474 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:35:54,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2021-12-18 21:35:54,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 266. [2021-12-18 21:35:54,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 243 states have (on average 1.2592592592592593) internal successors, (306), 265 states have internal predecessors, (306), 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-18 21:35:54,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 306 transitions. [2021-12-18 21:35:54,109 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 306 transitions. Word has length 50 [2021-12-18 21:35:54,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:35:54,110 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 306 transitions. [2021-12-18 21:35:54,110 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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-18 21:35:54,110 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 306 transitions. [2021-12-18 21:35:54,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-12-18 21:35:54,110 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:35:54,110 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] [2021-12-18 21:35:54,110 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-12-18 21:35:54,111 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-18 21:35:54,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:35:54,111 INFO L85 PathProgramCache]: Analyzing trace with hash -97333738, now seen corresponding path program 1 times [2021-12-18 21:35:54,111 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:35:54,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534612435] [2021-12-18 21:35:54,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:35:54,112 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:35:54,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:35:54,209 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-18 21:35:54,209 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:35:54,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534612435] [2021-12-18 21:35:54,209 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534612435] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:35:54,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858685965] [2021-12-18 21:35:54,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:35:54,210 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:35:54,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:35:54,211 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-18 21:35:54,237 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-18 21:35:54,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:35:54,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 33 conjunts are in the unsatisfiable core [2021-12-18 21:35:54,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:35:54,318 INFO L388 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-18 21:35:54,416 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-18 21:35:54,417 INFO L388 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-18 21:35:54,448 INFO L388 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-18 21:35:54,555 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 21:35:54,556 INFO L388 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-18 21:35:54,643 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 21:35:54,643 INFO L388 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-18 21:35:54,833 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 21:35:54,834 INFO L388 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-18 21:35:54,883 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-18 21:35:54,883 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:35:55,227 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:35:55,228 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2021-12-18 21:35:55,234 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:35:55,234 INFO L388 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 34 treesize of output 37 [2021-12-18 21:35:55,237 INFO L388 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 11 treesize of output 9 [2021-12-18 21:35:57,034 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-18 21:35:57,034 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1858685965] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:35:57,035 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 21:35:57,035 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2021-12-18 21:35:57,035 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741239594] [2021-12-18 21:35:57,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 21:35:57,035 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-12-18 21:35:57,035 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:35:57,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-12-18 21:35:57,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=732, Unknown=9, NotChecked=0, Total=870 [2021-12-18 21:35:57,036 INFO L87 Difference]: Start difference. First operand 266 states and 306 transitions. Second operand has 30 states, 29 states have (on average 5.206896551724138) internal successors, (151), 30 states have internal predecessors, (151), 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-18 21:35:57,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:35:57,894 INFO L93 Difference]: Finished difference Result 670 states and 747 transitions. [2021-12-18 21:35:57,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-18 21:35:57,894 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 5.206896551724138) internal successors, (151), 30 states have internal predecessors, (151), 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-18 21:35:57,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:35:57,896 INFO L225 Difference]: With dead ends: 670 [2021-12-18 21:35:57,896 INFO L226 Difference]: Without dead ends: 670 [2021-12-18 21:35:57,897 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=339, Invalid=1544, Unknown=9, NotChecked=0, Total=1892 [2021-12-18 21:35:57,897 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 824 mSDsluCounter, 2555 mSDsCounter, 0 mSdLazyCounter, 1462 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 824 SdHoareTripleChecker+Valid, 2703 SdHoareTripleChecker+Invalid, 2614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1095 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-18 21:35:57,897 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [824 Valid, 2703 Invalid, 2614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1462 Invalid, 0 Unknown, 1095 Unchecked, 0.6s Time] [2021-12-18 21:35:57,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2021-12-18 21:35:57,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 312. [2021-12-18 21:35:57,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 289 states have (on average 1.2560553633217992) internal successors, (363), 311 states have internal predecessors, (363), 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-18 21:35:57,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 363 transitions. [2021-12-18 21:35:57,902 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 363 transitions. Word has length 52 [2021-12-18 21:35:57,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:35:57,902 INFO L470 AbstractCegarLoop]: Abstraction has 312 states and 363 transitions. [2021-12-18 21:35:57,903 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 5.206896551724138) internal successors, (151), 30 states have internal predecessors, (151), 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-18 21:35:57,903 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 363 transitions. [2021-12-18 21:35:57,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-12-18 21:35:57,903 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:35:57,903 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] [2021-12-18 21:35:57,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-18 21:35:58,121 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:35:58,122 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-18 21:35:58,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:35:58,122 INFO L85 PathProgramCache]: Analyzing trace with hash -97333737, now seen corresponding path program 1 times [2021-12-18 21:35:58,122 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:35:58,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111081676] [2021-12-18 21:35:58,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:35:58,123 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:35:58,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:35:58,246 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-18 21:35:58,247 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:35:58,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111081676] [2021-12-18 21:35:58,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111081676] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:35:58,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759924168] [2021-12-18 21:35:58,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:35:58,247 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:35:58,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:35:58,248 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-18 21:35:58,280 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-18 21:35:58,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:35:58,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 44 conjunts are in the unsatisfiable core [2021-12-18 21:35:58,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:35:58,366 INFO L388 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-18 21:35:58,446 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 21:35:58,446 INFO L388 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 11 treesize of output 11 [2021-12-18 21:35:58,450 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-12-18 21:35:58,486 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 21:35:58,490 INFO L388 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-18 21:35:58,590 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 21:35:58,591 INFO L388 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 14 treesize of output 20 [2021-12-18 21:35:58,594 INFO L388 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 5 treesize of output 3 [2021-12-18 21:35:58,608 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 21:35:58,609 INFO L388 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-18 21:35:58,709 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 21:35:58,710 INFO L388 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 38 treesize of output 37 [2021-12-18 21:35:58,713 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-18 21:35:58,887 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 21:35:58,887 INFO L388 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-18 21:35:58,890 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 21:35:58,891 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-18 21:35:58,935 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-18 21:35:58,935 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:35:59,706 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:35:59,706 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 51 [2021-12-18 21:35:59,710 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:35:59,711 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 51 [2021-12-18 21:35:59,718 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:35:59,719 INFO L388 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 74 treesize of output 77 [2021-12-18 21:35:59,726 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:35:59,726 INFO L388 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 125 treesize of output 120 [2021-12-18 21:35:59,736 INFO L388 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 89 treesize of output 85 [2021-12-18 21:35:59,740 INFO L388 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 85 treesize of output 81 [2021-12-18 21:35:59,743 INFO L388 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 81 treesize of output 79 [2021-12-18 21:36:00,291 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-18 21:36:00,291 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759924168] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:36:00,291 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 21:36:00,291 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2021-12-18 21:36:00,291 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894968286] [2021-12-18 21:36:00,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 21:36:00,292 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-12-18 21:36:00,292 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:36:00,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-12-18 21:36:00,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=888, Unknown=8, NotChecked=0, Total=992 [2021-12-18 21:36:00,293 INFO L87 Difference]: Start difference. First operand 312 states and 363 transitions. Second operand has 32 states, 31 states have (on average 4.967741935483871) internal successors, (154), 32 states have internal predecessors, (154), 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-18 21:36:01,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:36:01,632 INFO L93 Difference]: Finished difference Result 456 states and 506 transitions. [2021-12-18 21:36:01,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-12-18 21:36:01,633 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 4.967741935483871) internal successors, (154), 32 states have internal predecessors, (154), 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-18 21:36:01,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:36:01,634 INFO L225 Difference]: With dead ends: 456 [2021-12-18 21:36:01,634 INFO L226 Difference]: Without dead ends: 456 [2021-12-18 21:36:01,635 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 84 SyntacticMatches, 5 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 586 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=441, Invalid=2857, Unknown=8, NotChecked=0, Total=3306 [2021-12-18 21:36:01,635 INFO L933 BasicCegarLoop]: 123 mSDtfsCounter, 705 mSDsluCounter, 1875 mSDsCounter, 0 mSdLazyCounter, 1532 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 1998 SdHoareTripleChecker+Invalid, 2174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 555 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-18 21:36:01,635 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [705 Valid, 1998 Invalid, 2174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1532 Invalid, 0 Unknown, 555 Unchecked, 0.6s Time] [2021-12-18 21:36:01,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2021-12-18 21:36:01,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 329. [2021-12-18 21:36:01,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 306 states have (on average 1.261437908496732) internal successors, (386), 328 states have internal predecessors, (386), 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-18 21:36:01,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 386 transitions. [2021-12-18 21:36:01,641 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 386 transitions. Word has length 52 [2021-12-18 21:36:01,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:36:01,641 INFO L470 AbstractCegarLoop]: Abstraction has 329 states and 386 transitions. [2021-12-18 21:36:01,641 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 4.967741935483871) internal successors, (154), 32 states have internal predecessors, (154), 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-18 21:36:01,641 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 386 transitions. [2021-12-18 21:36:01,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-12-18 21:36:01,642 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:36:01,642 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, 1] [2021-12-18 21:36:01,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-18 21:36:01,859 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2021-12-18 21:36:01,860 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-18 21:36:01,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:36:01,860 INFO L85 PathProgramCache]: Analyzing trace with hash 2084299753, now seen corresponding path program 1 times [2021-12-18 21:36:01,860 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:36:01,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021410008] [2021-12-18 21:36:01,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:36:01,860 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:36:01,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:36:02,083 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-18 21:36:02,084 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:36:02,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021410008] [2021-12-18 21:36:02,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021410008] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:36:02,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202988093] [2021-12-18 21:36:02,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:36:02,084 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:36:02,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:36:02,085 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 21:36:02,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-18 21:36:02,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:36:02,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 48 conjunts are in the unsatisfiable core [2021-12-18 21:36:02,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:36:02,211 INFO L388 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-18 21:36:02,240 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-18 21:36:02,240 INFO L388 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-18 21:36:02,269 INFO L388 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 13 treesize of output 9 [2021-12-18 21:36:02,310 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 21:36:02,311 INFO L388 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 34 treesize of output 35 [2021-12-18 21:36:02,379 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 21:36:02,380 INFO L388 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 34 treesize of output 35 [2021-12-18 21:36:02,488 INFO L354 Elim1Store]: treesize reduction 54, result has 36.5 percent of original size [2021-12-18 21:36:02,489 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 45 [2021-12-18 21:36:02,541 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-12-18 21:36:02,541 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2021-12-18 21:36:02,901 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 21:36:02,901 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 48 [2021-12-18 21:36:03,655 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 21:36:03,655 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2021-12-18 21:36:04,809 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:36:04,810 INFO L388 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 44 treesize of output 32 [2021-12-18 21:36:07,443 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-18 21:36:07,443 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:36:07,539 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1252 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1252) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) 1)) is different from false [2021-12-18 21:36:08,309 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1252 (Array Int Int))) (= (select |c_#valid| (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_1252) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) 1)) is different from false [2021-12-18 21:36:08,352 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1252 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc10#1.base_14| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_14|))) (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_14| 1) (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_14|)) |v_ULTIMATE.start_main_#t~malloc10#1.base_14| v_ArrVal_1252) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) 1))) is different from false [2021-12-18 21:36:08,418 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1247 (Array Int Int)) (v_ArrVal_1252 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc10#1.base_14| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_14|))) (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_14| 1) (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1247))) (store .cse0 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| |v_ULTIMATE.start_main_#t~malloc10#1.base_14|))) |v_ULTIMATE.start_main_#t~malloc10#1.base_14| v_ArrVal_1252) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) 1))) is different from false [2021-12-18 21:36:08,620 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:36:08,620 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 66 [2021-12-18 21:36:08,625 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 21:36:08,627 INFO L388 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 546 treesize of output 524 [2021-12-18 21:36:08,633 INFO L388 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 596 treesize of output 564 [2021-12-18 21:36:08,645 INFO L388 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 548 treesize of output 508 [2021-12-18 21:36:08,654 INFO L388 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 528 treesize of output 484 [2021-12-18 21:36:09,112 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-18 21:36:09,113 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202988093] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:36:09,113 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 21:36:09,113 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 17] total 40 [2021-12-18 21:36:09,113 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395531252] [2021-12-18 21:36:09,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 21:36:09,113 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-12-18 21:36:09,114 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:36:09,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-12-18 21:36:09,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=1111, Unknown=32, NotChecked=292, Total=1640 [2021-12-18 21:36:09,114 INFO L87 Difference]: Start difference. First operand 329 states and 386 transitions. Second operand has 41 states, 40 states have (on average 3.4) internal successors, (136), 41 states have internal predecessors, (136), 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-18 21:36:35,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:36:35,137 INFO L93 Difference]: Finished difference Result 552 states and 638 transitions. [2021-12-18 21:36:35,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-12-18 21:36:35,138 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 3.4) internal successors, (136), 41 states have internal predecessors, (136), 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 55 [2021-12-18 21:36:35,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:36:35,139 INFO L225 Difference]: With dead ends: 552 [2021-12-18 21:36:35,139 INFO L226 Difference]: Without dead ends: 552 [2021-12-18 21:36:35,140 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 84 SyntacticMatches, 11 SemanticMatches, 59 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 856 ImplicationChecksByTransitivity, 29.1s TimeCoverageRelationStatistics Valid=456, Invalid=2651, Unknown=101, NotChecked=452, Total=3660 [2021-12-18 21:36:35,140 INFO L933 BasicCegarLoop]: 114 mSDtfsCounter, 860 mSDsluCounter, 1967 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 860 SdHoareTripleChecker+Valid, 2081 SdHoareTripleChecker+Invalid, 2652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2007 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 21:36:35,140 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [860 Valid, 2081 Invalid, 2652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 603 Invalid, 0 Unknown, 2007 Unchecked, 0.3s Time] [2021-12-18 21:36:35,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2021-12-18 21:36:35,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 361. [2021-12-18 21:36:35,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 338 states have (on average 1.2455621301775148) internal successors, (421), 360 states have internal predecessors, (421), 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-18 21:36:35,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 421 transitions. [2021-12-18 21:36:35,154 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 421 transitions. Word has length 55 [2021-12-18 21:36:35,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:36:35,154 INFO L470 AbstractCegarLoop]: Abstraction has 361 states and 421 transitions. [2021-12-18 21:36:35,154 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 3.4) internal successors, (136), 41 states have internal predecessors, (136), 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-18 21:36:35,155 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 421 transitions. [2021-12-18 21:36:35,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-12-18 21:36:35,155 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:36:35,155 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, 1] [2021-12-18 21:36:35,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-18 21:36:35,365 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:36:35,365 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-18 21:36:35,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:36:35,365 INFO L85 PathProgramCache]: Analyzing trace with hash 2084299754, now seen corresponding path program 1 times [2021-12-18 21:36:35,366 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:36:35,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468870638] [2021-12-18 21:36:35,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:36:35,366 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:36:35,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:36:35,726 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-18 21:36:35,727 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:36:35,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468870638] [2021-12-18 21:36:35,727 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468870638] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:36:35,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173041461] [2021-12-18 21:36:35,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:36:35,727 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:36:35,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:36:35,728 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 21:36:35,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-18 21:36:35,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:36:35,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 69 conjunts are in the unsatisfiable core [2021-12-18 21:36:35,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:36:35,852 INFO L388 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-18 21:36:35,877 INFO L388 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-18 21:36:35,889 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-18 21:36:35,890 INFO L388 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-18 21:36:35,930 INFO L388 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 13 treesize of output 9 [2021-12-18 21:36:35,938 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 21:36:36,010 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 21:36:36,011 INFO L388 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 57 treesize of output 54 [2021-12-18 21:36:36,014 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-18 21:36:36,103 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 21:36:36,103 INFO L388 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 57 treesize of output 54 [2021-12-18 21:36:36,106 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-18 21:36:36,271 INFO L354 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2021-12-18 21:36:36,271 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2021-12-18 21:36:36,280 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-18 21:36:36,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:36:36,323 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-18 21:36:36,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:36:36,331 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2021-12-18 21:36:36,499 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 21:36:36,499 INFO L388 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 57 treesize of output 49 [2021-12-18 21:36:36,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:36:36,504 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2021-12-18 21:36:36,645 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 21:36:36,646 INFO L388 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 64 treesize of output 57 [2021-12-18 21:36:36,649 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-18 21:36:36,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:36:36,937 INFO L388 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 0 case distinctions, treesize of input 22 treesize of output 10 [2021-12-18 21:36:36,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:36:36,941 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:36:36,941 INFO L388 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 45 treesize of output 21 [2021-12-18 21:36:36,967 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-18 21:36:36,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:36:37,102 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1367 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1368) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1367) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0))))) (forall ((v_ArrVal_1368 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1368) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) 4)))) is different from false [2021-12-18 21:36:37,141 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1367 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1368) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1367) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0))))) (forall ((v_ArrVal_1368 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1368) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) 4)))) is different from false [2021-12-18 21:36:37,154 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1367 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1368) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1367) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))))) (forall ((v_ArrVal_1368 (Array Int Int))) (<= 0 (+ (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_1368) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) 4)))) is different from false [2021-12-18 21:36:37,168 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1368 (Array Int Int))) (<= 0 (+ (select (select (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|) |c_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_1368) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) 4))) (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1367 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (<= (+ (select (select (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|) |c_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_1368) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 8) (select |c_#length| (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|) |c_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_1367) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0)))))) is different from false [2021-12-18 21:36:41,251 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:36:41,251 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 277 treesize of output 248 [2021-12-18 21:36:41,259 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:36:41,259 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 248 treesize of output 178 [2021-12-18 21:36:41,262 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 21:36:41,265 INFO L388 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 734 treesize of output 700 [2021-12-18 21:36:41,269 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 21:36:41,277 INFO L388 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 2308 treesize of output 2274 [2021-12-18 21:36:41,289 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 21:36:41,291 INFO L388 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 2238 treesize of output 2082 [2021-12-18 21:36:41,298 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 21:36:41,302 INFO L388 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 2034 treesize of output 1966 [2021-12-18 21:36:41,313 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 21:36:41,315 INFO L388 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 1849 treesize of output 1753 [2021-12-18 21:36:41,321 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 21:36:41,323 INFO L388 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 1681 treesize of output 1585 [2021-12-18 21:36:41,329 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 21:36:41,330 INFO L388 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 1549 treesize of output 1501 [2021-12-18 21:36:41,336 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 21:36:41,338 INFO L388 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 1465 treesize of output 1305 [2021-12-18 21:36:41,353 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 21:36:41,355 INFO L388 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 1293 treesize of output 1277 [2021-12-18 21:36:41,361 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 21:36:41,362 INFO L388 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 1253 treesize of output 1221 [2021-12-18 21:36:41,372 INFO L388 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 1221 treesize of output 1197 [2021-12-18 21:36:41,576 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 21:36:41,649 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-18 21:36:41,650 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173041461] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:36:41,650 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 21:36:41,650 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 17] total 42 [2021-12-18 21:36:41,650 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166507507] [2021-12-18 21:36:41,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 21:36:41,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2021-12-18 21:36:41,650 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:36:41,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-12-18 21:36:41,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=1270, Unknown=23, NotChecked=308, Total=1806 [2021-12-18 21:36:41,651 INFO L87 Difference]: Start difference. First operand 361 states and 421 transitions. Second operand has 43 states, 42 states have (on average 3.5714285714285716) internal successors, (150), 43 states have internal predecessors, (150), 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-18 21:36:42,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:36:42,815 INFO L93 Difference]: Finished difference Result 435 states and 479 transitions. [2021-12-18 21:36:42,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-18 21:36:42,816 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 3.5714285714285716) internal successors, (150), 43 states have internal predecessors, (150), 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 55 [2021-12-18 21:36:42,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:36:42,817 INFO L225 Difference]: With dead ends: 435 [2021-12-18 21:36:42,817 INFO L226 Difference]: Without dead ends: 435 [2021-12-18 21:36:42,818 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 86 SyntacticMatches, 7 SemanticMatches, 56 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 886 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=407, Invalid=2448, Unknown=23, NotChecked=428, Total=3306 [2021-12-18 21:36:42,818 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 598 mSDsluCounter, 2166 mSDsCounter, 0 mSdLazyCounter, 1050 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 2306 SdHoareTripleChecker+Invalid, 3097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2012 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-18 21:36:42,818 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [598 Valid, 2306 Invalid, 3097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1050 Invalid, 0 Unknown, 2012 Unchecked, 0.6s Time] [2021-12-18 21:36:42,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2021-12-18 21:36:42,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 360. [2021-12-18 21:36:42,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 338 states have (on average 1.227810650887574) internal successors, (415), 359 states have internal predecessors, (415), 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-18 21:36:42,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 415 transitions. [2021-12-18 21:36:42,822 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 415 transitions. Word has length 55 [2021-12-18 21:36:42,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:36:42,822 INFO L470 AbstractCegarLoop]: Abstraction has 360 states and 415 transitions. [2021-12-18 21:36:42,822 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 3.5714285714285716) internal successors, (150), 43 states have internal predecessors, (150), 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-18 21:36:42,822 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 415 transitions. [2021-12-18 21:36:42,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-12-18 21:36:42,823 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:36:42,823 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, 1] [2021-12-18 21:36:42,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-18 21:36:43,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:36:43,040 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-18 21:36:43,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:36:43,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1738644409, now seen corresponding path program 1 times [2021-12-18 21:36:43,040 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:36:43,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359142631] [2021-12-18 21:36:43,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:36:43,040 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:36:43,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:36:43,416 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-18 21:36:43,416 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:36:43,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359142631] [2021-12-18 21:36:43,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359142631] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:36:43,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723707002] [2021-12-18 21:36:43,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:36:43,417 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:36:43,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:36:43,418 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 21:36:43,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-18 21:36:43,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:36:43,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 69 conjunts are in the unsatisfiable core [2021-12-18 21:36:43,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:36:43,533 INFO L388 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-18 21:36:43,560 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 21:36:43,566 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 21:36:43,686 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-18 21:36:43,687 INFO L388 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-18 21:36:43,738 INFO L354 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2021-12-18 21:36:43,738 INFO L388 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-18 21:36:43,751 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-12-18 21:36:43,752 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 26 [2021-12-18 21:36:43,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:36:43,985 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2021-12-18 21:36:43,996 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 21:36:43,997 INFO L388 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-18 21:36:44,290 INFO L354 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2021-12-18 21:36:44,291 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2021-12-18 21:36:44,411 INFO L354 Elim1Store]: treesize reduction 72, result has 19.1 percent of original size [2021-12-18 21:36:44,412 INFO L388 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 46 [2021-12-18 21:36:44,417 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-18 21:36:44,617 INFO L354 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2021-12-18 21:36:44,617 INFO L388 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 67 [2021-12-18 21:36:44,625 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2021-12-18 21:36:44,808 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-12-18 21:36:44,808 INFO L388 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 82 [2021-12-18 21:36:44,813 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2021-12-18 21:36:45,611 INFO L354 Elim1Store]: treesize reduction 29, result has 21.6 percent of original size [2021-12-18 21:36:45,612 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 39 [2021-12-18 21:36:45,617 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-18 21:36:45,617 INFO L388 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-18 21:36:45,749 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-18 21:36:45,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:36:46,009 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~mem15#1.base| v_ArrVal_1482) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))) (or (= 1 (select |c_#valid| .cse0)) (and (= 0 .cse0) (forall ((v_ArrVal_1483 (Array Int Int))) (= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_1483) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))))))) is different from false [2021-12-18 21:36:46,028 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| 4)) v_ArrVal_1482) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))) (or (and (forall ((v_ArrVal_1483 (Array Int Int))) (= 0 (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| 4)) v_ArrVal_1483) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))) (= 0 .cse0)) (= 1 (select |c_#valid| .cse0))))) is different from false [2021-12-18 21:36:46,070 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1482 (Array Int Int)) (v_ArrVal_1481 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1481))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~end~0#1.base|) (+ |c_ULTIMATE.start_main_~end~0#1.offset| 4)) v_ArrVal_1482)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))) (or (= 1 (select |c_#valid| .cse0)) (and (= 0 .cse0) (forall ((v_ArrVal_1483 (Array Int Int)) (v_ArrVal_1480 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1480) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1481) |c_ULTIMATE.start_main_~end~0#1.base|) (+ |c_ULTIMATE.start_main_~end~0#1.offset| 4)) v_ArrVal_1483) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))))))) is different from false [2021-12-18 21:36:46,095 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1482 (Array Int Int)) (v_ArrVal_1481 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse4 (+ |c_ULTIMATE.start_main_~end~0#1.offset| 4))) (let ((.cse3 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) .cse4) v_ArrVal_1481))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~end~0#1.base|) .cse4) v_ArrVal_1482))) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))) (or (= 1 (select |c_#valid| .cse0)) (and (= 0 .cse0) (forall ((v_ArrVal_1483 (Array Int Int)) (v_ArrVal_1480 (Array Int Int))) (= 0 (select (select (let ((.cse2 (+ |c_ULTIMATE.start_main_~end~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) .cse2))) (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1480) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1481) |c_ULTIMATE.start_main_~end~0#1.base|) .cse2) v_ArrVal_1483))) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))))))) is different from false [2021-12-18 21:36:46,130 INFO L354 Elim1Store]: treesize reduction 5, result has 89.8 percent of original size [2021-12-18 21:36:46,130 INFO L388 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 53 treesize of output 52 [2021-12-18 21:36:46,173 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1482 (Array Int Int)) (v_ArrVal_1481 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse3 (+ |ULTIMATE.start_main_~end~0#1.offset| 4))) (let ((.cse2 (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|) .cse3 |c_ULTIMATE.start_main_#t~malloc13#1.base|)) |c_ULTIMATE.start_main_#t~malloc13#1.base| v_ArrVal_1481))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~end~0#1.base|) .cse3) v_ArrVal_1482))) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))) (or (= |c_ULTIMATE.start_main_~end~0#1.base| .cse0) (and (= 0 .cse0) (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1483 (Array Int Int)) (v_ArrVal_1480 (Array Int Int))) (= 0 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1477) |c_ULTIMATE.start_main_#t~malloc13#1.base| v_ArrVal_1480) (let ((.cse1 (+ |ULTIMATE.start_main_~end~0#1.offset| 4))) (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|) .cse1 |c_ULTIMATE.start_main_#t~malloc13#1.base|)) |c_ULTIMATE.start_main_#t~malloc13#1.base| v_ArrVal_1481) |c_ULTIMATE.start_main_~end~0#1.base|) .cse1)) v_ArrVal_1483) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))))))) is different from false [2021-12-18 21:36:46,801 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:36:46,801 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 100 [2021-12-18 21:36:50,106 INFO L354 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2021-12-18 21:36:50,107 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 129 treesize of output 135 [2021-12-18 21:36:50,127 INFO L354 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2021-12-18 21:36:50,127 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 199 treesize of output 159 [2021-12-18 21:36:50,131 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 21:36:50,137 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-18 21:36:50,137 INFO L388 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 245 treesize of output 229 [2021-12-18 21:36:50,142 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 21:36:50,142 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 21:36:50,150 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:36:50,151 INFO L388 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 256 treesize of output 244 [2021-12-18 21:36:50,160 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:36:50,161 INFO L388 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 257 treesize of output 209 [2021-12-18 21:36:50,165 INFO L388 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 209 treesize of output 193 [2021-12-18 21:36:50,177 INFO L388 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 89 treesize of output 85 [2021-12-18 21:36:50,183 INFO L388 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 85 treesize of output 77 [2021-12-18 21:36:50,342 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-18 21:36:50,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723707002] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:36:50,342 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 21:36:50,342 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 19] total 51 [2021-12-18 21:36:50,342 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370472672] [2021-12-18 21:36:50,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 21:36:50,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2021-12-18 21:36:50,342 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:36:50,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2021-12-18 21:36:50,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=1866, Unknown=19, NotChecked=460, Total=2550 [2021-12-18 21:36:50,343 INFO L87 Difference]: Start difference. First operand 360 states and 415 transitions. Second operand has 51 states, 51 states have (on average 2.9607843137254903) internal successors, (151), 51 states have internal predecessors, (151), 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-18 21:36:56,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:36:56,985 INFO L93 Difference]: Finished difference Result 382 states and 439 transitions. [2021-12-18 21:36:56,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-18 21:36:56,986 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.9607843137254903) internal successors, (151), 51 states have internal predecessors, (151), 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 55 [2021-12-18 21:36:56,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:36:56,987 INFO L225 Difference]: With dead ends: 382 [2021-12-18 21:36:56,987 INFO L226 Difference]: Without dead ends: 382 [2021-12-18 21:36:56,988 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 80 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 661 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=374, Invalid=3161, Unknown=25, NotChecked=600, Total=4160 [2021-12-18 21:36:56,988 INFO L933 BasicCegarLoop]: 117 mSDtfsCounter, 123 mSDsluCounter, 2021 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 2138 SdHoareTripleChecker+Invalid, 1700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1196 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 21:36:56,988 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 2138 Invalid, 1700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 492 Invalid, 0 Unknown, 1196 Unchecked, 0.3s Time] [2021-12-18 21:36:56,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2021-12-18 21:36:56,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 381. [2021-12-18 21:36:56,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 359 states have (on average 1.2200557103064067) internal successors, (438), 380 states have internal predecessors, (438), 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-18 21:36:56,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 438 transitions. [2021-12-18 21:36:56,992 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 438 transitions. Word has length 55 [2021-12-18 21:36:56,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:36:56,992 INFO L470 AbstractCegarLoop]: Abstraction has 381 states and 438 transitions. [2021-12-18 21:36:56,992 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 2.9607843137254903) internal successors, (151), 51 states have internal predecessors, (151), 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-18 21:36:56,992 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 438 transitions. [2021-12-18 21:36:56,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-12-18 21:36:56,993 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:36:56,993 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, 1, 1, 1, 1, 1, 1] [2021-12-18 21:36:57,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-18 21:36:57,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2021-12-18 21:36:57,213 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-18 21:36:57,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:36:57,213 INFO L85 PathProgramCache]: Analyzing trace with hash 320505786, now seen corresponding path program 1 times [2021-12-18 21:36:57,213 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:36:57,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030900002] [2021-12-18 21:36:57,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:36:57,213 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:36:57,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:36:57,551 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-18 21:36:57,551 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:36:57,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030900002] [2021-12-18 21:36:57,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030900002] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:36:57,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157617077] [2021-12-18 21:36:57,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:36:57,551 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:36:57,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:36:57,553 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 21:36:57,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-18 21:36:57,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:36:57,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 61 conjunts are in the unsatisfiable core [2021-12-18 21:36:57,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:36:57,676 INFO L388 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-18 21:36:57,701 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 21:36:57,702 INFO L388 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 11 treesize of output 11 [2021-12-18 21:36:57,714 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 21:36:57,719 INFO L388 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 13 treesize of output 9 [2021-12-18 21:36:57,752 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 21:36:57,752 INFO L388 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 35 treesize of output 36 [2021-12-18 21:36:57,754 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-18 21:36:57,800 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 21:36:57,800 INFO L388 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 35 treesize of output 36 [2021-12-18 21:36:57,803 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-18 21:36:58,679 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 21:36:58,680 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 21:36:58,681 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 21:36:58,688 INFO L354 Elim1Store]: treesize reduction 38, result has 7.3 percent of original size [2021-12-18 21:36:58,688 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 85 treesize of output 48 [2021-12-18 21:36:58,691 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 21:36:58,696 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 21:36:58,696 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2021-12-18 21:36:58,709 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-18 21:36:58,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:37:00,718 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1548 (Array Int Int)) (v_ArrVal_1547 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_97| Int)) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1547))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1548)) (.cse4 (select .cse3 |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse10 (+ |v_ULTIMATE.start_main_~end~0#1.offset_97| 4))) (let ((.cse9 (select .cse4 .cse10)) (.cse6 (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse7 (select .cse6 .cse10)) (.cse8 (+ .cse9 4))) (or (let ((.cse5 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (let ((.cse1 (select .cse6 .cse5)) (.cse2 (+ (select .cse4 .cse5) 4))) (and (= (select (select .cse0 .cse1) .cse2) 0) (= (select (select .cse3 .cse1) .cse2) 0)))) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_97|) (< |v_ULTIMATE.start_main_~end~0#1.offset_97| 0) (not (= 0 (select (select .cse3 .cse7) .cse8))) (not (= 0 (select (select .cse0 .cse7) .cse8))) (< .cse9 0))))))) is different from false [2021-12-18 21:37:00,982 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1548 (Array Int Int)) (v_ArrVal_1547 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_97| Int)) (let ((.cse8 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (let ((.cse11 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) .cse8))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| .cse11 v_ArrVal_1547))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse11 v_ArrVal_1548)) (.cse7 (select .cse1 |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse10 (+ |v_ULTIMATE.start_main_~end~0#1.offset_97| 4))) (let ((.cse0 (select .cse7 .cse10)) (.cse9 (select .cse4 |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse2 (select .cse9 .cse10)) (.cse3 (+ .cse0 4))) (or (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_97|) (< |v_ULTIMATE.start_main_~end~0#1.offset_97| 0) (< .cse0 0) (not (= 0 (select (select .cse1 .cse2) .cse3))) (not (= 0 (select (select .cse4 .cse2) .cse3))) (let ((.cse5 (select .cse9 .cse8)) (.cse6 (+ (select .cse7 .cse8) 4))) (and (= (select (select .cse1 .cse5) .cse6) 0) (= (select (select .cse4 .cse5) .cse6) 0))))))))))) is different from false [2021-12-18 21:37:01,484 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1548 (Array Int Int)) (v_ArrVal_1547 (Array Int Int)) (v_ArrVal_1546 (Array Int Int)) (v_ArrVal_1545 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_97| Int)) (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1545)) (.cse5 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~list~0#1.base|) .cse5))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1546) .cse12 v_ArrVal_1547))) (let ((.cse3 (store .cse11 .cse12 v_ArrVal_1548)) (.cse4 (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse10 (+ |v_ULTIMATE.start_main_~end~0#1.offset_97| 4))) (let ((.cse7 (select .cse4 .cse10)) (.cse6 (select .cse3 |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse8 (select .cse6 .cse10)) (.cse9 (+ .cse7 4))) (or (let ((.cse1 (select .cse6 .cse5)) (.cse2 (+ (select .cse4 .cse5) 4))) (and (= (select (select .cse0 .cse1) .cse2) 0) (= (select (select .cse3 .cse1) .cse2) 0))) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_97|) (< |v_ULTIMATE.start_main_~end~0#1.offset_97| 0) (< .cse7 0) (not (= 0 (select (select .cse0 .cse8) .cse9))) (not (= 0 (select (select .cse3 .cse8) .cse9))))))))))) is different from false [2021-12-18 21:37:01,732 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1548 (Array Int Int)) (v_ArrVal_1547 (Array Int Int)) (v_ArrVal_1546 (Array Int Int)) (v_ArrVal_1545 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_97| Int)) (let ((.cse8 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (let ((.cse13 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) .cse8))) (let ((.cse11 (store |c_#memory_$Pointer$.base| .cse13 v_ArrVal_1545))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~list~0#1.base|) .cse8))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| .cse13 v_ArrVal_1546) .cse12 v_ArrVal_1547))) (let ((.cse1 (store .cse11 .cse12 v_ArrVal_1548)) (.cse7 (select .cse4 |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse10 (+ |v_ULTIMATE.start_main_~end~0#1.offset_97| 4))) (let ((.cse0 (select .cse7 .cse10)) (.cse9 (select .cse1 |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse2 (select .cse9 .cse10)) (.cse3 (+ .cse0 4))) (or (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_97|) (< .cse0 0) (< |v_ULTIMATE.start_main_~end~0#1.offset_97| 0) (not (= 0 (select (select .cse1 .cse2) .cse3))) (not (= 0 (select (select .cse4 .cse2) .cse3))) (let ((.cse5 (select .cse9 .cse8)) (.cse6 (+ (select .cse7 .cse8) 4))) (and (= (select (select .cse4 .cse5) .cse6) 0) (= (select (select .cse1 .cse5) .cse6) 0))))))))))))) is different from false [2021-12-18 21:37:02,077 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:37:02,077 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 552 treesize of output 492 [2021-12-18 21:37:02,084 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:37:02,085 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 482 treesize of output 302 [2021-12-18 21:37:03,519 INFO L354 Elim1Store]: treesize reduction 370, result has 80.1 percent of original size [2021-12-18 21:37:03,520 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 16 new quantified variables, introduced 66 case distinctions, treesize of input 4079 treesize of output 4554 [2021-12-18 21:37:03,661 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 21:37:06,944 INFO L354 Elim1Store]: treesize reduction 704, result has 72.9 percent of original size [2021-12-18 21:37:06,945 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 16 select indices, 16 select index equivalence classes, 1 disjoint index pairs (out of 120 index pairs), introduced 18 new quantified variables, introduced 120 case distinctions, treesize of input 17438 treesize of output 17153 [2021-12-18 21:37:08,423 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 21:37:08,901 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:37:08,902 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 27 case distinctions, treesize of input 13702 treesize of output 11872 [2021-12-18 21:37:09,508 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 21:37:09,867 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:37:09,868 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 27 case distinctions, treesize of input 13366 treesize of output 10984 [2021-12-18 21:37:10,551 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 21:37:10,950 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:37:10,952 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 27 case distinctions, treesize of input 10221 treesize of output 8699 [2021-12-18 21:37:12,484 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 21:37:12,881 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:37:12,883 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 27 case distinctions, treesize of input 8482 treesize of output 8022 Killed by 15