./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/sll-01-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 35987657 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-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 14067621d9a8f66625f13d1d9faf9b421dec38bd60b4ac0ad734bd36e2df123a --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 17:34:38,985 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 17:34:38,987 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 17:34:39,007 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 17:34:39,008 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 17:34:39,009 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 17:34:39,010 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 17:34:39,014 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 17:34:39,020 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 17:34:39,021 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 17:34:39,022 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 17:34:39,022 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 17:34:39,023 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 17:34:39,023 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 17:34:39,024 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 17:34:39,025 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 17:34:39,025 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 17:34:39,026 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 17:34:39,027 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 17:34:39,028 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 17:34:39,029 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 17:34:39,030 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 17:34:39,031 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 17:34:39,032 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 17:34:39,032 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 17:34:39,034 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 17:34:39,035 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 17:34:39,035 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 17:34:39,035 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 17:34:39,036 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 17:34:39,036 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 17:34:39,037 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 17:34:39,037 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 17:34:39,038 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 17:34:39,038 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 17:34:39,039 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 17:34:39,039 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 17:34:39,040 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 17:34:39,040 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 17:34:39,040 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 17:34:39,041 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 17:34:39,041 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 17:34:39,042 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-21 17:34:39,057 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 17:34:39,057 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 17:34:39,057 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 17:34:39,057 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 17:34:39,058 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 17:34:39,058 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 17:34:39,058 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 17:34:39,059 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 17:34:39,059 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 17:34:39,059 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 17:34:39,059 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 17:34:39,060 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-21 17:34:39,060 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 17:34:39,060 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 17:34:39,060 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 17:34:39,060 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-21 17:34:39,060 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-21 17:34:39,060 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-21 17:34:39,061 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 17:34:39,061 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 17:34:39,061 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 17:34:39,061 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 17:34:39,061 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 17:34:39,062 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 17:34:39,062 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 17:34:39,062 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 17:34:39,062 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 17:34:39,062 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 17:34:39,062 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 17:34:39,062 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 17:34:39,063 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 -> 14067621d9a8f66625f13d1d9faf9b421dec38bd60b4ac0ad734bd36e2df123a [2022-07-21 17:34:39,326 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 17:34:39,345 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 17:34:39,346 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 17:34:39,347 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 17:34:39,349 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 17:34:39,350 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-01-2.i [2022-07-21 17:34:39,396 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3ed25ae2/803ee6f65aa5463d87dc5a74996c0a2b/FLAGa7cc11a3a [2022-07-21 17:34:39,794 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 17:34:39,794 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i [2022-07-21 17:34:39,808 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3ed25ae2/803ee6f65aa5463d87dc5a74996c0a2b/FLAGa7cc11a3a [2022-07-21 17:34:39,817 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3ed25ae2/803ee6f65aa5463d87dc5a74996c0a2b [2022-07-21 17:34:39,819 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 17:34:39,820 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 17:34:39,821 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 17:34:39,821 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 17:34:39,823 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 17:34:39,824 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:34:39" (1/1) ... [2022-07-21 17:34:39,825 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27029464 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:34:39, skipping insertion in model container [2022-07-21 17:34:39,825 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:34:39" (1/1) ... [2022-07-21 17:34:39,829 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 17:34:39,850 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 17:34:40,064 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-2.i[22034,22047] [2022-07-21 17:34:40,077 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-2.i[22307,22320] [2022-07-21 17:34:40,079 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-2.i[22516,22529] [2022-07-21 17:34:40,081 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-2.i[22586,22599] [2022-07-21 17:34:40,085 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-2.i[22853,22866] [2022-07-21 17:34:40,088 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-2.i[22961,22974] [2022-07-21 17:34:40,089 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-2.i[23192,23205] [2022-07-21 17:34:40,091 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-2.i[23272,23285] [2022-07-21 17:34:40,093 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-2.i[23351,23364] [2022-07-21 17:34:40,094 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-2.i[23484,23497] [2022-07-21 17:34:40,096 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-2.i[23662,23675] [2022-07-21 17:34:40,098 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-2.i[23740,23753] [2022-07-21 17:34:40,098 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-2.i[23817,23830] [2022-07-21 17:34:40,105 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 17:34:40,116 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 17:34:40,142 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-2.i[22034,22047] [2022-07-21 17:34:40,148 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-2.i[22307,22320] [2022-07-21 17:34:40,152 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-2.i[22516,22529] [2022-07-21 17:34:40,154 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-2.i[22586,22599] [2022-07-21 17:34:40,156 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-2.i[22853,22866] [2022-07-21 17:34:40,157 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-2.i[22961,22974] [2022-07-21 17:34:40,159 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-2.i[23192,23205] [2022-07-21 17:34:40,161 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-2.i[23272,23285] [2022-07-21 17:34:40,162 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-2.i[23351,23364] [2022-07-21 17:34:40,163 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-2.i[23484,23497] [2022-07-21 17:34:40,165 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-2.i[23662,23675] [2022-07-21 17:34:40,165 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-2.i[23740,23753] [2022-07-21 17:34:40,166 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-2.i[23817,23830] [2022-07-21 17:34:40,167 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 17:34:40,187 INFO L208 MainTranslator]: Completed translation [2022-07-21 17:34:40,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:34:40 WrapperNode [2022-07-21 17:34:40,188 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 17:34:40,189 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 17:34:40,189 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 17:34:40,191 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 17:34:40,195 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:34:40" (1/1) ... [2022-07-21 17:34:40,216 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:34:40" (1/1) ... [2022-07-21 17:34:40,246 INFO L137 Inliner]: procedures = 119, calls = 42, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 231 [2022-07-21 17:34:40,248 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 17:34:40,249 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 17:34:40,249 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 17:34:40,249 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 17:34:40,255 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:34:40" (1/1) ... [2022-07-21 17:34:40,255 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:34:40" (1/1) ... [2022-07-21 17:34:40,267 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:34:40" (1/1) ... [2022-07-21 17:34:40,269 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:34:40" (1/1) ... [2022-07-21 17:34:40,278 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:34:40" (1/1) ... [2022-07-21 17:34:40,282 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:34:40" (1/1) ... [2022-07-21 17:34:40,284 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:34:40" (1/1) ... [2022-07-21 17:34:40,286 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 17:34:40,286 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 17:34:40,286 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 17:34:40,286 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 17:34:40,287 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:34:40" (1/1) ... [2022-07-21 17:34:40,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 17:34:40,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:34:40,321 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) [2022-07-21 17:34:40,328 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 [2022-07-21 17:34:40,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 17:34:40,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 17:34:40,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 17:34:40,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 17:34:40,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 17:34:40,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 17:34:40,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 17:34:40,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 17:34:40,499 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 17:34:40,504 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 17:34:40,896 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 17:34:40,915 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 17:34:40,916 INFO L299 CfgBuilder]: Removed 30 assume(true) statements. [2022-07-21 17:34:40,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:34:40 BoogieIcfgContainer [2022-07-21 17:34:40,917 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 17:34:40,919 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 17:34:40,919 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 17:34:40,921 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 17:34:40,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 05:34:39" (1/3) ... [2022-07-21 17:34:40,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e2c1f26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:34:40, skipping insertion in model container [2022-07-21 17:34:40,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:34:40" (2/3) ... [2022-07-21 17:34:40,923 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e2c1f26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:34:40, skipping insertion in model container [2022-07-21 17:34:40,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:34:40" (3/3) ... [2022-07-21 17:34:40,924 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-01-2.i [2022-07-21 17:34:40,935 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 17:34:40,935 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 80 error locations. [2022-07-21 17:34:40,981 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 17:34:40,988 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4467dfd5, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4dceb6cb [2022-07-21 17:34:40,989 INFO L358 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2022-07-21 17:34:40,996 INFO L276 IsEmpty]: Start isEmpty. Operand has 195 states, 114 states have (on average 2.175438596491228) internal successors, (248), 194 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:34:41,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-21 17:34:41,002 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:34:41,003 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-21 17:34:41,003 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-07-21 17:34:41,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:34:41,007 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-21 17:34:41,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:34:41,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427252795] [2022-07-21 17:34:41,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:34:41,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:34:41,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:34:41,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:34:41,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:34:41,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427252795] [2022-07-21 17:34:41,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427252795] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:34:41,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:34:41,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 17:34:41,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632118770] [2022-07-21 17:34:41,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:34:41,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:34:41,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:34:41,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:34:41,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:34:41,179 INFO L87 Difference]: Start difference. First operand has 195 states, 114 states have (on average 2.175438596491228) internal successors, (248), 194 states have internal predecessors, (248), 0 states have call successors, (0), 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) [2022-07-21 17:34:41,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:34:41,359 INFO L93 Difference]: Finished difference Result 197 states and 207 transitions. [2022-07-21 17:34:41,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:34:41,362 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 [2022-07-21 17:34:41,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:34:41,371 INFO L225 Difference]: With dead ends: 197 [2022-07-21 17:34:41,371 INFO L226 Difference]: Without dead ends: 193 [2022-07-21 17:34:41,372 INFO L412 NwaCegarLoop]: 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 [2022-07-21 17:34:41,377 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 188 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:34:41,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 123 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:34:41,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-07-21 17:34:41,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 188. [2022-07-21 17:34:41,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 116 states have (on average 1.7327586206896552) internal successors, (201), 187 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:34:41,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 201 transitions. [2022-07-21 17:34:41,436 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 201 transitions. Word has length 3 [2022-07-21 17:34:41,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:34:41,436 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 201 transitions. [2022-07-21 17:34:41,436 INFO L496 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) [2022-07-21 17:34:41,437 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 201 transitions. [2022-07-21 17:34:41,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-21 17:34:41,437 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:34:41,437 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-21 17:34:41,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 17:34:41,438 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-07-21 17:34:41,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:34:41,439 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-21 17:34:41,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:34:41,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030927470] [2022-07-21 17:34:41,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:34:41,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:34:41,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:34:41,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:34:41,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:34:41,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030927470] [2022-07-21 17:34:41,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030927470] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:34:41,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:34:41,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 17:34:41,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285844084] [2022-07-21 17:34:41,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:34:41,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:34:41,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:34:41,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:34:41,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:34:41,497 INFO L87 Difference]: Start difference. First operand 188 states and 201 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) [2022-07-21 17:34:41,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:34:41,597 INFO L93 Difference]: Finished difference Result 218 states and 230 transitions. [2022-07-21 17:34:41,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:34:41,598 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 [2022-07-21 17:34:41,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:34:41,601 INFO L225 Difference]: With dead ends: 218 [2022-07-21 17:34:41,606 INFO L226 Difference]: Without dead ends: 218 [2022-07-21 17:34:41,607 INFO L412 NwaCegarLoop]: 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 [2022-07-21 17:34:41,608 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 178 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:34:41,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 149 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:34:41,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-07-21 17:34:41,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 198. [2022-07-21 17:34:41,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 133 states have (on average 1.669172932330827) internal successors, (222), 197 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:34:41,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 222 transitions. [2022-07-21 17:34:41,621 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 222 transitions. Word has length 3 [2022-07-21 17:34:41,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:34:41,621 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 222 transitions. [2022-07-21 17:34:41,622 INFO L496 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) [2022-07-21 17:34:41,622 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 222 transitions. [2022-07-21 17:34:41,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-21 17:34:41,622 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:34:41,622 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-21 17:34:41,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 17:34:41,622 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-07-21 17:34:41,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:34:41,623 INFO L85 PathProgramCache]: Analyzing trace with hash 28691969, now seen corresponding path program 1 times [2022-07-21 17:34:41,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:34:41,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758188777] [2022-07-21 17:34:41,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:34:41,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:34:41,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:34:41,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:34:41,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:34:41,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758188777] [2022-07-21 17:34:41,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758188777] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:34:41,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:34:41,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:34:41,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803060737] [2022-07-21 17:34:41,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:34:41,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:34:41,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:34:41,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:34:41,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:34:41,648 INFO L87 Difference]: Start difference. First operand 198 states and 222 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) [2022-07-21 17:34:41,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:34:41,673 INFO L93 Difference]: Finished difference Result 213 states and 225 transitions. [2022-07-21 17:34:41,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:34:41,674 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 [2022-07-21 17:34:41,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:34:41,674 INFO L225 Difference]: With dead ends: 213 [2022-07-21 17:34:41,674 INFO L226 Difference]: Without dead ends: 213 [2022-07-21 17:34:41,675 INFO L412 NwaCegarLoop]: 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 [2022-07-21 17:34:41,675 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 175 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 202 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 [2022-07-21 17:34:41,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 202 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:34:41,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-07-21 17:34:41,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 196. [2022-07-21 17:34:41,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 132 states have (on average 1.6590909090909092) internal successors, (219), 195 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) [2022-07-21 17:34:41,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 219 transitions. [2022-07-21 17:34:41,686 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 219 transitions. Word has length 5 [2022-07-21 17:34:41,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:34:41,686 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 219 transitions. [2022-07-21 17:34:41,686 INFO L496 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) [2022-07-21 17:34:41,686 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 219 transitions. [2022-07-21 17:34:41,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-21 17:34:41,687 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:34:41,687 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:34:41,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 17:34:41,687 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-07-21 17:34:41,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:34:41,688 INFO L85 PathProgramCache]: Analyzing trace with hash -618617197, now seen corresponding path program 1 times [2022-07-21 17:34:41,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:34:41,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413276828] [2022-07-21 17:34:41,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:34:41,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:34:41,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:34:41,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:34:41,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:34:41,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413276828] [2022-07-21 17:34:41,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413276828] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:34:41,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:34:41,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 17:34:41,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937631954] [2022-07-21 17:34:41,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:34:41,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 17:34:41,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:34:41,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 17:34:41,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:34:41,757 INFO L87 Difference]: Start difference. First operand 196 states and 219 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) [2022-07-21 17:34:41,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:34:41,878 INFO L93 Difference]: Finished difference Result 195 states and 218 transitions. [2022-07-21 17:34:41,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 17:34:41,879 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 [2022-07-21 17:34:41,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:34:41,880 INFO L225 Difference]: With dead ends: 195 [2022-07-21 17:34:41,880 INFO L226 Difference]: Without dead ends: 195 [2022-07-21 17:34:41,880 INFO L412 NwaCegarLoop]: 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 [2022-07-21 17:34:41,882 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 4 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:34:41,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 536 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:34:41,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-07-21 17:34:41,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2022-07-21 17:34:41,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 132 states have (on average 1.6515151515151516) internal successors, (218), 194 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:34:41,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 218 transitions. [2022-07-21 17:34:41,912 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 218 transitions. Word has length 11 [2022-07-21 17:34:41,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:34:41,912 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 218 transitions. [2022-07-21 17:34:41,912 INFO L496 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) [2022-07-21 17:34:41,913 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 218 transitions. [2022-07-21 17:34:41,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-21 17:34:41,913 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:34:41,914 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:34:41,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 17:34:41,915 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-07-21 17:34:41,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:34:41,916 INFO L85 PathProgramCache]: Analyzing trace with hash -618617196, now seen corresponding path program 1 times [2022-07-21 17:34:41,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:34:41,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990142463] [2022-07-21 17:34:41,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:34:41,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:34:41,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:34:41,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:34:41,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:34:41,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990142463] [2022-07-21 17:34:41,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990142463] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:34:41,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:34:41,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 17:34:41,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50099683] [2022-07-21 17:34:41,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:34:41,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 17:34:41,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:34:41,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 17:34:41,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:34:41,993 INFO L87 Difference]: Start difference. First operand 195 states and 218 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) [2022-07-21 17:34:42,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:34:42,115 INFO L93 Difference]: Finished difference Result 194 states and 217 transitions. [2022-07-21 17:34:42,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 17:34:42,116 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 [2022-07-21 17:34:42,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:34:42,117 INFO L225 Difference]: With dead ends: 194 [2022-07-21 17:34:42,117 INFO L226 Difference]: Without dead ends: 194 [2022-07-21 17:34:42,117 INFO L412 NwaCegarLoop]: 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 [2022-07-21 17:34:42,118 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 2 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:34:42,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 547 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:34:42,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-07-21 17:34:42,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2022-07-21 17:34:42,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 132 states have (on average 1.643939393939394) internal successors, (217), 193 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:34:42,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 217 transitions. [2022-07-21 17:34:42,121 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 217 transitions. Word has length 11 [2022-07-21 17:34:42,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:34:42,121 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 217 transitions. [2022-07-21 17:34:42,121 INFO L496 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) [2022-07-21 17:34:42,122 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 217 transitions. [2022-07-21 17:34:42,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-21 17:34:42,122 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:34:42,122 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:34:42,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 17:34:42,122 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-07-21 17:34:42,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:34:42,123 INFO L85 PathProgramCache]: Analyzing trace with hash -2054096635, now seen corresponding path program 1 times [2022-07-21 17:34:42,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:34:42,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492066121] [2022-07-21 17:34:42,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:34:42,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:34:42,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:34:42,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:34:42,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:34:42,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492066121] [2022-07-21 17:34:42,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492066121] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:34:42,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:34:42,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:34:42,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515396629] [2022-07-21 17:34:42,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:34:42,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:34:42,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:34:42,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:34:42,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:34:42,154 INFO L87 Difference]: Start difference. First operand 194 states and 217 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) [2022-07-21 17:34:42,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:34:42,159 INFO L93 Difference]: Finished difference Result 195 states and 218 transitions. [2022-07-21 17:34:42,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:34:42,160 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 [2022-07-21 17:34:42,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:34:42,160 INFO L225 Difference]: With dead ends: 195 [2022-07-21 17:34:42,161 INFO L226 Difference]: Without dead ends: 195 [2022-07-21 17:34:42,161 INFO L412 NwaCegarLoop]: 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 [2022-07-21 17:34:42,161 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 0 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 360 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 [2022-07-21 17:34:42,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 360 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:34:42,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-07-21 17:34:42,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2022-07-21 17:34:42,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 133 states have (on average 1.6390977443609023) internal successors, (218), 194 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:34:42,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 218 transitions. [2022-07-21 17:34:42,164 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 218 transitions. Word has length 13 [2022-07-21 17:34:42,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:34:42,165 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 218 transitions. [2022-07-21 17:34:42,165 INFO L496 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) [2022-07-21 17:34:42,165 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 218 transitions. [2022-07-21 17:34:42,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-21 17:34:42,165 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:34:42,165 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:34:42,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 17:34:42,166 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-07-21 17:34:42,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:34:42,166 INFO L85 PathProgramCache]: Analyzing trace with hash 479764253, now seen corresponding path program 1 times [2022-07-21 17:34:42,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:34:42,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619381786] [2022-07-21 17:34:42,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:34:42,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:34:42,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:34:42,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:34:42,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:34:42,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619381786] [2022-07-21 17:34:42,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619381786] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:34:42,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:34:42,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 17:34:42,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849713294] [2022-07-21 17:34:42,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:34:42,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 17:34:42,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:34:42,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 17:34:42,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-21 17:34:42,251 INFO L87 Difference]: Start difference. First operand 195 states and 218 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) [2022-07-21 17:34:42,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:34:42,434 INFO L93 Difference]: Finished difference Result 195 states and 217 transitions. [2022-07-21 17:34:42,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 17:34:42,435 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 [2022-07-21 17:34:42,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:34:42,436 INFO L225 Difference]: With dead ends: 195 [2022-07-21 17:34:42,436 INFO L226 Difference]: Without dead ends: 195 [2022-07-21 17:34:42,436 INFO L412 NwaCegarLoop]: 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 [2022-07-21 17:34:42,437 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 174 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:34:42,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 457 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:34:42,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-07-21 17:34:42,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 194. [2022-07-21 17:34:42,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 133 states have (on average 1.631578947368421) internal successors, (217), 193 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:34:42,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 217 transitions. [2022-07-21 17:34:42,441 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 217 transitions. Word has length 14 [2022-07-21 17:34:42,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:34:42,441 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 217 transitions. [2022-07-21 17:34:42,441 INFO L496 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) [2022-07-21 17:34:42,441 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 217 transitions. [2022-07-21 17:34:42,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-21 17:34:42,442 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:34:42,442 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:34:42,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 17:34:42,443 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-07-21 17:34:42,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:34:42,443 INFO L85 PathProgramCache]: Analyzing trace with hash 479764254, now seen corresponding path program 1 times [2022-07-21 17:34:42,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:34:42,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925367049] [2022-07-21 17:34:42,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:34:42,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:34:42,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:34:42,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:34:42,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:34:42,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925367049] [2022-07-21 17:34:42,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925367049] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:34:42,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:34:42,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 17:34:42,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048464927] [2022-07-21 17:34:42,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:34:42,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 17:34:42,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:34:42,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 17:34:42,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-21 17:34:42,564 INFO L87 Difference]: Start difference. First operand 194 states and 217 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) [2022-07-21 17:34:42,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:34:42,847 INFO L93 Difference]: Finished difference Result 194 states and 216 transitions. [2022-07-21 17:34:42,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 17:34:42,848 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 [2022-07-21 17:34:42,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:34:42,848 INFO L225 Difference]: With dead ends: 194 [2022-07-21 17:34:42,848 INFO L226 Difference]: Without dead ends: 194 [2022-07-21 17:34:42,849 INFO L412 NwaCegarLoop]: 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 [2022-07-21 17:34:42,849 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 170 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:34:42,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 495 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:34:42,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-07-21 17:34:42,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2022-07-21 17:34:42,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 133 states have (on average 1.6240601503759398) 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) [2022-07-21 17:34:42,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 216 transitions. [2022-07-21 17:34:42,857 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 216 transitions. Word has length 14 [2022-07-21 17:34:42,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:34:42,858 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 216 transitions. [2022-07-21 17:34:42,858 INFO L496 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) [2022-07-21 17:34:42,858 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 216 transitions. [2022-07-21 17:34:42,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-21 17:34:42,858 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:34:42,858 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:34:42,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 17:34:42,859 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-07-21 17:34:42,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:34:42,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1699725866, now seen corresponding path program 1 times [2022-07-21 17:34:42,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:34:42,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75802825] [2022-07-21 17:34:42,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:34:42,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:34:42,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:34:42,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:34:42,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:34:42,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75802825] [2022-07-21 17:34:42,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75802825] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:34:42,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:34:42,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 17:34:42,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144853441] [2022-07-21 17:34:42,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:34:42,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 17:34:42,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:34:42,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 17:34:42,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:34:42,927 INFO L87 Difference]: Start difference. First operand 193 states and 216 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) [2022-07-21 17:34:43,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:34:43,082 INFO L93 Difference]: Finished difference Result 285 states and 315 transitions. [2022-07-21 17:34:43,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 17:34:43,083 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 [2022-07-21 17:34:43,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:34:43,084 INFO L225 Difference]: With dead ends: 285 [2022-07-21 17:34:43,084 INFO L226 Difference]: Without dead ends: 285 [2022-07-21 17:34:43,085 INFO L412 NwaCegarLoop]: 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 [2022-07-21 17:34:43,086 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 205 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:34:43,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 724 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:34:43,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2022-07-21 17:34:43,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 190. [2022-07-21 17:34:43,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 131 states have (on average 1.6259541984732824) internal successors, (213), 189 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) [2022-07-21 17:34:43,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 213 transitions. [2022-07-21 17:34:43,094 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 213 transitions. Word has length 15 [2022-07-21 17:34:43,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:34:43,094 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 213 transitions. [2022-07-21 17:34:43,099 INFO L496 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) [2022-07-21 17:34:43,099 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 213 transitions. [2022-07-21 17:34:43,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-21 17:34:43,099 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:34:43,099 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:34:43,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-21 17:34:43,100 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-07-21 17:34:43,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:34:43,100 INFO L85 PathProgramCache]: Analyzing trace with hash -99613104, now seen corresponding path program 1 times [2022-07-21 17:34:43,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:34:43,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18768572] [2022-07-21 17:34:43,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:34:43,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:34:43,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:34:43,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:34:43,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:34:43,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18768572] [2022-07-21 17:34:43,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18768572] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:34:43,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:34:43,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 17:34:43,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43769425] [2022-07-21 17:34:43,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:34:43,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 17:34:43,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:34:43,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 17:34:43,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:34:43,138 INFO L87 Difference]: Start difference. First operand 190 states and 213 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) [2022-07-21 17:34:43,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:34:43,231 INFO L93 Difference]: Finished difference Result 286 states and 315 transitions. [2022-07-21 17:34:43,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 17:34:43,231 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 [2022-07-21 17:34:43,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:34:43,232 INFO L225 Difference]: With dead ends: 286 [2022-07-21 17:34:43,232 INFO L226 Difference]: Without dead ends: 286 [2022-07-21 17:34:43,233 INFO L412 NwaCegarLoop]: 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 [2022-07-21 17:34:43,233 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 106 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:34:43,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 602 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:34:43,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-07-21 17:34:43,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 193. [2022-07-21 17:34:43,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 134 states have (on average 1.6119402985074627) 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) [2022-07-21 17:34:43,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 216 transitions. [2022-07-21 17:34:43,237 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 216 transitions. Word has length 17 [2022-07-21 17:34:43,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:34:43,237 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 216 transitions. [2022-07-21 17:34:43,237 INFO L496 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) [2022-07-21 17:34:43,238 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 216 transitions. [2022-07-21 17:34:43,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-21 17:34:43,238 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:34:43,238 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:34:43,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-21 17:34:43,239 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-07-21 17:34:43,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:34:43,239 INFO L85 PathProgramCache]: Analyzing trace with hash -582241035, now seen corresponding path program 1 times [2022-07-21 17:34:43,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:34:43,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428567595] [2022-07-21 17:34:43,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:34:43,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:34:43,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:34:43,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:34:43,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:34:43,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428567595] [2022-07-21 17:34:43,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428567595] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:34:43,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:34:43,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 17:34:43,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049978557] [2022-07-21 17:34:43,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:34:43,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 17:34:43,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:34:43,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 17:34:43,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:34:43,301 INFO L87 Difference]: Start difference. First operand 193 states and 216 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 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) [2022-07-21 17:34:43,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:34:43,492 INFO L93 Difference]: Finished difference Result 258 states and 275 transitions. [2022-07-21 17:34:43,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 17:34:43,492 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 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 [2022-07-21 17:34:43,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:34:43,493 INFO L225 Difference]: With dead ends: 258 [2022-07-21 17:34:43,493 INFO L226 Difference]: Without dead ends: 258 [2022-07-21 17:34:43,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:34:43,494 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 473 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:34:43,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 262 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:34:43,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-07-21 17:34:43,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 219. [2022-07-21 17:34:43,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 160 states have (on average 1.61875) internal successors, (259), 218 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:34:43,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 259 transitions. [2022-07-21 17:34:43,497 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 259 transitions. Word has length 19 [2022-07-21 17:34:43,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:34:43,497 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 259 transitions. [2022-07-21 17:34:43,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 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) [2022-07-21 17:34:43,497 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 259 transitions. [2022-07-21 17:34:43,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-21 17:34:43,498 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:34:43,498 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:34:43,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-21 17:34:43,498 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-07-21 17:34:43,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:34:43,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1187837214, now seen corresponding path program 1 times [2022-07-21 17:34:43,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:34:43,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144238089] [2022-07-21 17:34:43,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:34:43,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:34:43,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:34:43,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:34:43,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:34:43,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144238089] [2022-07-21 17:34:43,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144238089] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:34:43,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:34:43,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 17:34:43,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190815922] [2022-07-21 17:34:43,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:34:43,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:34:43,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:34:43,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:34:43,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:34:43,518 INFO L87 Difference]: Start difference. First operand 219 states and 259 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) [2022-07-21 17:34:43,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:34:43,601 INFO L93 Difference]: Finished difference Result 253 states and 269 transitions. [2022-07-21 17:34:43,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 17:34:43,601 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 [2022-07-21 17:34:43,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:34:43,602 INFO L225 Difference]: With dead ends: 253 [2022-07-21 17:34:43,602 INFO L226 Difference]: Without dead ends: 253 [2022-07-21 17:34:43,602 INFO L412 NwaCegarLoop]: 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 [2022-07-21 17:34:43,603 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 246 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:34:43,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 289 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:34:43,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-07-21 17:34:43,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 217. [2022-07-21 17:34:43,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 159 states have (on average 1.610062893081761) internal successors, (256), 216 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:34:43,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 256 transitions. [2022-07-21 17:34:43,607 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 256 transitions. Word has length 21 [2022-07-21 17:34:43,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:34:43,607 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 256 transitions. [2022-07-21 17:34:43,607 INFO L496 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) [2022-07-21 17:34:43,607 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 256 transitions. [2022-07-21 17:34:43,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-21 17:34:43,608 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:34:43,608 INFO L195 NwaCegarLoop]: 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] [2022-07-21 17:34:43,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-21 17:34:43,608 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-07-21 17:34:43,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:34:43,609 INFO L85 PathProgramCache]: Analyzing trace with hash 903845878, now seen corresponding path program 1 times [2022-07-21 17:34:43,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:34:43,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435876114] [2022-07-21 17:34:43,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:34:43,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:34:43,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:34:43,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:34:43,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:34:43,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435876114] [2022-07-21 17:34:43,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435876114] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:34:43,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:34:43,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 17:34:43,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811589365] [2022-07-21 17:34:43,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:34:43,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 17:34:43,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:34:43,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 17:34:43,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:34:43,638 INFO L87 Difference]: Start difference. First operand 217 states and 256 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) [2022-07-21 17:34:43,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:34:43,791 INFO L93 Difference]: Finished difference Result 206 states and 243 transitions. [2022-07-21 17:34:43,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 17:34:43,792 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 [2022-07-21 17:34:43,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:34:43,792 INFO L225 Difference]: With dead ends: 206 [2022-07-21 17:34:43,792 INFO L226 Difference]: Without dead ends: 206 [2022-07-21 17:34:43,793 INFO L412 NwaCegarLoop]: 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 [2022-07-21 17:34:43,793 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 104 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:34:43,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 443 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:34:43,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-07-21 17:34:43,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2022-07-21 17:34:43,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 159 states have (on average 1.5220125786163523) internal successors, (242), 204 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) [2022-07-21 17:34:43,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 242 transitions. [2022-07-21 17:34:43,796 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 242 transitions. Word has length 23 [2022-07-21 17:34:43,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:34:43,796 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 242 transitions. [2022-07-21 17:34:43,796 INFO L496 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) [2022-07-21 17:34:43,796 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 242 transitions. [2022-07-21 17:34:43,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-21 17:34:43,797 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:34:43,797 INFO L195 NwaCegarLoop]: 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] [2022-07-21 17:34:43,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-21 17:34:43,797 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-07-21 17:34:43,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:34:43,797 INFO L85 PathProgramCache]: Analyzing trace with hash 903845879, now seen corresponding path program 1 times [2022-07-21 17:34:43,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:34:43,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169435201] [2022-07-21 17:34:43,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:34:43,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:34:43,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:34:43,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:34:43,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:34:43,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169435201] [2022-07-21 17:34:43,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169435201] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:34:43,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:34:43,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 17:34:43,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406133855] [2022-07-21 17:34:43,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:34:43,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 17:34:43,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:34:43,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 17:34:43,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:34:43,846 INFO L87 Difference]: Start difference. First operand 205 states and 242 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) [2022-07-21 17:34:44,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:34:44,032 INFO L93 Difference]: Finished difference Result 198 states and 235 transitions. [2022-07-21 17:34:44,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 17:34:44,033 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 [2022-07-21 17:34:44,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:34:44,034 INFO L225 Difference]: With dead ends: 198 [2022-07-21 17:34:44,034 INFO L226 Difference]: Without dead ends: 198 [2022-07-21 17:34:44,034 INFO L412 NwaCegarLoop]: 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 [2022-07-21 17:34:44,034 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 41 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:34:44,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 510 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:34:44,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-07-21 17:34:44,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 191. [2022-07-21 17:34:44,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 154 states have (on average 1.474025974025974) internal successors, (227), 190 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:34:44,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 227 transitions. [2022-07-21 17:34:44,037 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 227 transitions. Word has length 23 [2022-07-21 17:34:44,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:34:44,037 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 227 transitions. [2022-07-21 17:34:44,037 INFO L496 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) [2022-07-21 17:34:44,037 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 227 transitions. [2022-07-21 17:34:44,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-21 17:34:44,038 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:34:44,038 INFO L195 NwaCegarLoop]: 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] [2022-07-21 17:34:44,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-21 17:34:44,038 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-07-21 17:34:44,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:34:44,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1012497526, now seen corresponding path program 1 times [2022-07-21 17:34:44,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:34:44,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591272141] [2022-07-21 17:34:44,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:34:44,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:34:44,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:34:44,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:34:44,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:34:44,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591272141] [2022-07-21 17:34:44,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591272141] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:34:44,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:34:44,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 17:34:44,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547119717] [2022-07-21 17:34:44,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:34:44,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 17:34:44,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:34:44,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 17:34:44,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:34:44,072 INFO L87 Difference]: Start difference. First operand 191 states and 227 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) [2022-07-21 17:34:44,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:34:44,170 INFO L93 Difference]: Finished difference Result 194 states and 231 transitions. [2022-07-21 17:34:44,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 17:34:44,171 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 [2022-07-21 17:34:44,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:34:44,171 INFO L225 Difference]: With dead ends: 194 [2022-07-21 17:34:44,172 INFO L226 Difference]: Without dead ends: 194 [2022-07-21 17:34:44,172 INFO L412 NwaCegarLoop]: 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 [2022-07-21 17:34:44,172 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 38 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:34:44,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 621 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:34:44,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-07-21 17:34:44,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 187. [2022-07-21 17:34:44,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 152 states have (on average 1.4671052631578947) internal successors, (223), 186 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:34:44,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 223 transitions. [2022-07-21 17:34:44,175 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 223 transitions. Word has length 25 [2022-07-21 17:34:44,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:34:44,176 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 223 transitions. [2022-07-21 17:34:44,176 INFO L496 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) [2022-07-21 17:34:44,176 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 223 transitions. [2022-07-21 17:34:44,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-21 17:34:44,176 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:34:44,176 INFO L195 NwaCegarLoop]: 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] [2022-07-21 17:34:44,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-21 17:34:44,177 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-07-21 17:34:44,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:34:44,177 INFO L85 PathProgramCache]: Analyzing trace with hash 476921774, now seen corresponding path program 1 times [2022-07-21 17:34:44,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:34:44,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204961467] [2022-07-21 17:34:44,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:34:44,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:34:44,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:34:44,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:34:44,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:34:44,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204961467] [2022-07-21 17:34:44,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204961467] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:34:44,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:34:44,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:34:44,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174389209] [2022-07-21 17:34:44,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:34:44,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:34:44,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:34:44,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:34:44,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:34:44,194 INFO L87 Difference]: Start difference. First operand 187 states and 223 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) [2022-07-21 17:34:44,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:34:44,201 INFO L93 Difference]: Finished difference Result 260 states and 311 transitions. [2022-07-21 17:34:44,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:34:44,201 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 [2022-07-21 17:34:44,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:34:44,202 INFO L225 Difference]: With dead ends: 260 [2022-07-21 17:34:44,202 INFO L226 Difference]: Without dead ends: 260 [2022-07-21 17:34:44,202 INFO L412 NwaCegarLoop]: 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 [2022-07-21 17:34:44,203 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 50 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:34:44,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 293 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:34:44,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-07-21 17:34:44,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 193. [2022-07-21 17:34:44,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 158 states have (on average 1.4620253164556962) internal successors, (231), 192 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) [2022-07-21 17:34:44,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 231 transitions. [2022-07-21 17:34:44,206 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 231 transitions. Word has length 27 [2022-07-21 17:34:44,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:34:44,206 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 231 transitions. [2022-07-21 17:34:44,206 INFO L496 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) [2022-07-21 17:34:44,207 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 231 transitions. [2022-07-21 17:34:44,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-21 17:34:44,207 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:34:44,207 INFO L195 NwaCegarLoop]: 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] [2022-07-21 17:34:44,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-21 17:34:44,211 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-07-21 17:34:44,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:34:44,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1899651814, now seen corresponding path program 1 times [2022-07-21 17:34:44,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:34:44,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107388992] [2022-07-21 17:34:44,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:34:44,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:34:44,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:34:44,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:34:44,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:34:44,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107388992] [2022-07-21 17:34:44,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107388992] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:34:44,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:34:44,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:34:44,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529966080] [2022-07-21 17:34:44,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:34:44,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:34:44,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:34:44,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:34:44,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:34:44,242 INFO L87 Difference]: Start difference. First operand 193 states and 231 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) [2022-07-21 17:34:44,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:34:44,254 INFO L93 Difference]: Finished difference Result 191 states and 228 transitions. [2022-07-21 17:34:44,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:34:44,254 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 [2022-07-21 17:34:44,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:34:44,256 INFO L225 Difference]: With dead ends: 191 [2022-07-21 17:34:44,256 INFO L226 Difference]: Without dead ends: 191 [2022-07-21 17:34:44,256 INFO L412 NwaCegarLoop]: 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 [2022-07-21 17:34:44,256 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 20 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:34:44,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 262 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:34:44,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-07-21 17:34:44,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2022-07-21 17:34:44,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 157 states have (on average 1.4522292993630572) internal successors, (228), 190 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:34:44,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 228 transitions. [2022-07-21 17:34:44,259 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 228 transitions. Word has length 28 [2022-07-21 17:34:44,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:34:44,260 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 228 transitions. [2022-07-21 17:34:44,260 INFO L496 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) [2022-07-21 17:34:44,261 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 228 transitions. [2022-07-21 17:34:44,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-21 17:34:44,261 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:34:44,261 INFO L195 NwaCegarLoop]: 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] [2022-07-21 17:34:44,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-21 17:34:44,262 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-07-21 17:34:44,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:34:44,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1240331581, now seen corresponding path program 1 times [2022-07-21 17:34:44,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:34:44,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947430022] [2022-07-21 17:34:44,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:34:44,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:34:44,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:34:44,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:34:44,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:34:44,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947430022] [2022-07-21 17:34:44,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947430022] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:34:44,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:34:44,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 17:34:44,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524069148] [2022-07-21 17:34:44,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:34:44,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 17:34:44,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:34:44,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 17:34:44,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-21 17:34:44,358 INFO L87 Difference]: Start difference. First operand 191 states and 228 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) [2022-07-21 17:34:44,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:34:44,624 INFO L93 Difference]: Finished difference Result 321 states and 359 transitions. [2022-07-21 17:34:44,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 17:34:44,624 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 [2022-07-21 17:34:44,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:34:44,625 INFO L225 Difference]: With dead ends: 321 [2022-07-21 17:34:44,625 INFO L226 Difference]: Without dead ends: 321 [2022-07-21 17:34:44,626 INFO L412 NwaCegarLoop]: 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 [2022-07-21 17:34:44,626 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 579 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:34:44,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 736 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:34:44,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2022-07-21 17:34:44,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 224. [2022-07-21 17:34:44,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 190 states have (on average 1.4) internal successors, (266), 223 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:34:44,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 266 transitions. [2022-07-21 17:34:44,629 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 266 transitions. Word has length 29 [2022-07-21 17:34:44,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:34:44,630 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 266 transitions. [2022-07-21 17:34:44,630 INFO L496 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) [2022-07-21 17:34:44,630 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 266 transitions. [2022-07-21 17:34:44,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-21 17:34:44,630 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:34:44,630 INFO L195 NwaCegarLoop]: 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] [2022-07-21 17:34:44,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-21 17:34:44,631 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-07-21 17:34:44,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:34:44,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1491142186, now seen corresponding path program 1 times [2022-07-21 17:34:44,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:34:44,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472244746] [2022-07-21 17:34:44,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:34:44,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:34:44,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:34:44,676 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:34:44,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:34:44,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472244746] [2022-07-21 17:34:44,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472244746] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:34:44,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915963562] [2022-07-21 17:34:44,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:34:44,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:34:44,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:34:44,678 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) [2022-07-21 17:34:44,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-21 17:34:44,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:34:44,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-21 17:34:44,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:34:44,862 INFO L390 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 [2022-07-21 17:34:44,866 INFO L390 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 [2022-07-21 17:34:44,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:34:44,913 INFO L390 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 [2022-07-21 17:34:44,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:34:44,917 INFO L390 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 [2022-07-21 17:34:45,021 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:34:45,021 INFO L390 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 [2022-07-21 17:34:45,038 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:34:45,045 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:34:45,045 INFO L390 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 [2022-07-21 17:34:45,052 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:34:45,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:34:46,587 INFO L390 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 13 [2022-07-21 17:34:46,590 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:34:46,592 INFO L390 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 14 treesize of output 12 [2022-07-21 17:34:46,596 INFO L390 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 13 [2022-07-21 17:34:46,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:34:46,599 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:34:46,608 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:34:46,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915963562] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:34:46,609 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:34:46,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 8] total 13 [2022-07-21 17:34:46,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657971050] [2022-07-21 17:34:46,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:34:46,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-21 17:34:46,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:34:46,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-21 17:34:46,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=122, Unknown=2, NotChecked=0, Total=156 [2022-07-21 17:34:46,611 INFO L87 Difference]: Start difference. First operand 224 states and 266 transitions. Second operand has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 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) [2022-07-21 17:34:46,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:34:46,838 INFO L93 Difference]: Finished difference Result 323 states and 362 transitions. [2022-07-21 17:34:46,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 17:34:46,839 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 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 [2022-07-21 17:34:46,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:34:46,840 INFO L225 Difference]: With dead ends: 323 [2022-07-21 17:34:46,840 INFO L226 Difference]: Without dead ends: 323 [2022-07-21 17:34:46,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=79, Invalid=225, Unknown=2, NotChecked=0, Total=306 [2022-07-21 17:34:46,841 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 644 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:34:46,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [644 Valid, 792 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 263 Invalid, 0 Unknown, 93 Unchecked, 0.2s Time] [2022-07-21 17:34:46,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-07-21 17:34:46,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 262. [2022-07-21 17:34:46,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 228 states have (on average 1.4035087719298245) internal successors, (320), 261 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:34:46,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 320 transitions. [2022-07-21 17:34:46,845 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 320 transitions. Word has length 31 [2022-07-21 17:34:46,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:34:46,845 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 320 transitions. [2022-07-21 17:34:46,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 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) [2022-07-21 17:34:46,845 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 320 transitions. [2022-07-21 17:34:46,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-21 17:34:46,846 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:34:46,846 INFO L195 NwaCegarLoop]: 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] [2022-07-21 17:34:46,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-21 17:34:47,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:34:47,052 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-07-21 17:34:47,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:34:47,052 INFO L85 PathProgramCache]: Analyzing trace with hash 883081196, now seen corresponding path program 1 times [2022-07-21 17:34:47,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:34:47,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494734612] [2022-07-21 17:34:47,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:34:47,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:34:47,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:34:47,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:34:47,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:34:47,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494734612] [2022-07-21 17:34:47,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494734612] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:34:47,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:34:47,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 17:34:47,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598809986] [2022-07-21 17:34:47,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:34:47,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 17:34:47,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:34:47,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 17:34:47,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:34:47,086 INFO L87 Difference]: Start difference. First operand 262 states and 320 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) [2022-07-21 17:34:47,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:34:47,187 INFO L93 Difference]: Finished difference Result 261 states and 319 transitions. [2022-07-21 17:34:47,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 17:34:47,195 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 [2022-07-21 17:34:47,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:34:47,196 INFO L225 Difference]: With dead ends: 261 [2022-07-21 17:34:47,197 INFO L226 Difference]: Without dead ends: 261 [2022-07-21 17:34:47,197 INFO L412 NwaCegarLoop]: 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 [2022-07-21 17:34:47,197 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 4 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:34:47,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 426 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:34:47,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-07-21 17:34:47,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2022-07-21 17:34:47,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 228 states have (on average 1.3991228070175439) internal successors, (319), 260 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:34:47,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 319 transitions. [2022-07-21 17:34:47,201 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 319 transitions. Word has length 33 [2022-07-21 17:34:47,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:34:47,202 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 319 transitions. [2022-07-21 17:34:47,202 INFO L496 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) [2022-07-21 17:34:47,202 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 319 transitions. [2022-07-21 17:34:47,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-21 17:34:47,202 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:34:47,202 INFO L195 NwaCegarLoop]: 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] [2022-07-21 17:34:47,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-21 17:34:47,203 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-07-21 17:34:47,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:34:47,203 INFO L85 PathProgramCache]: Analyzing trace with hash 883081197, now seen corresponding path program 1 times [2022-07-21 17:34:47,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:34:47,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39152242] [2022-07-21 17:34:47,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:34:47,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:34:47,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:34:47,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:34:47,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:34:47,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39152242] [2022-07-21 17:34:47,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39152242] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:34:47,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:34:47,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 17:34:47,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713371002] [2022-07-21 17:34:47,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:34:47,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 17:34:47,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:34:47,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 17:34:47,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:34:47,244 INFO L87 Difference]: Start difference. First operand 261 states and 319 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) [2022-07-21 17:34:47,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:34:47,356 INFO L93 Difference]: Finished difference Result 260 states and 318 transitions. [2022-07-21 17:34:47,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 17:34:47,356 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 [2022-07-21 17:34:47,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:34:47,357 INFO L225 Difference]: With dead ends: 260 [2022-07-21 17:34:47,357 INFO L226 Difference]: Without dead ends: 260 [2022-07-21 17:34:47,357 INFO L412 NwaCegarLoop]: 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 [2022-07-21 17:34:47,358 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 2 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:34:47,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 429 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:34:47,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-07-21 17:34:47,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2022-07-21 17:34:47,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 228 states have (on average 1.394736842105263) internal successors, (318), 259 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:34:47,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 318 transitions. [2022-07-21 17:34:47,362 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 318 transitions. Word has length 33 [2022-07-21 17:34:47,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:34:47,362 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 318 transitions. [2022-07-21 17:34:47,362 INFO L496 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) [2022-07-21 17:34:47,362 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 318 transitions. [2022-07-21 17:34:47,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-21 17:34:47,368 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:34:47,368 INFO L195 NwaCegarLoop]: 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] [2022-07-21 17:34:47,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-21 17:34:47,368 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-07-21 17:34:47,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:34:47,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1776374941, now seen corresponding path program 1 times [2022-07-21 17:34:47,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:34:47,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942314607] [2022-07-21 17:34:47,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:34:47,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:34:47,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:34:47,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:34:47,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:34:47,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942314607] [2022-07-21 17:34:47,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942314607] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:34:47,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:34:47,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 17:34:47,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851761940] [2022-07-21 17:34:47,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:34:47,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 17:34:47,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:34:47,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 17:34:47,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-07-21 17:34:47,482 INFO L87 Difference]: Start difference. First operand 260 states and 318 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) [2022-07-21 17:34:47,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:34:47,894 INFO L93 Difference]: Finished difference Result 377 states and 424 transitions. [2022-07-21 17:34:47,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-21 17:34:47,896 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 [2022-07-21 17:34:47,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:34:47,898 INFO L225 Difference]: With dead ends: 377 [2022-07-21 17:34:47,898 INFO L226 Difference]: Without dead ends: 377 [2022-07-21 17:34:47,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2022-07-21 17:34:47,899 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 521 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 17:34:47,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 871 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 17:34:47,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-07-21 17:34:47,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 261. [2022-07-21 17:34:47,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 231 states have (on average 1.367965367965368) internal successors, (316), 260 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:34:47,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 316 transitions. [2022-07-21 17:34:47,906 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 316 transitions. Word has length 34 [2022-07-21 17:34:47,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:34:47,906 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 316 transitions. [2022-07-21 17:34:47,906 INFO L496 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) [2022-07-21 17:34:47,906 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 316 transitions. [2022-07-21 17:34:47,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-21 17:34:47,907 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:34:47,907 INFO L195 NwaCegarLoop]: 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] [2022-07-21 17:34:47,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-21 17:34:47,908 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-07-21 17:34:47,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:34:47,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1776374942, now seen corresponding path program 1 times [2022-07-21 17:34:47,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:34:47,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967045454] [2022-07-21 17:34:47,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:34:47,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:34:47,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:34:48,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:34:48,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:34:48,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967045454] [2022-07-21 17:34:48,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967045454] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:34:48,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:34:48,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-21 17:34:48,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237526982] [2022-07-21 17:34:48,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:34:48,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-21 17:34:48,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:34:48,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-21 17:34:48,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-07-21 17:34:48,078 INFO L87 Difference]: Start difference. First operand 261 states and 316 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) [2022-07-21 17:34:48,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:34:48,616 INFO L93 Difference]: Finished difference Result 441 states and 482 transitions. [2022-07-21 17:34:48,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-21 17:34:48,617 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 [2022-07-21 17:34:48,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:34:48,618 INFO L225 Difference]: With dead ends: 441 [2022-07-21 17:34:48,618 INFO L226 Difference]: Without dead ends: 441 [2022-07-21 17:34:48,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2022-07-21 17:34:48,619 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 610 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 17:34:48,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 885 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 17:34:48,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2022-07-21 17:34:48,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 267. [2022-07-21 17:34:48,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 237 states have (on average 1.3628691983122363) internal successors, (323), 266 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:34:48,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 323 transitions. [2022-07-21 17:34:48,622 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 323 transitions. Word has length 34 [2022-07-21 17:34:48,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:34:48,623 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 323 transitions. [2022-07-21 17:34:48,623 INFO L496 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) [2022-07-21 17:34:48,623 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 323 transitions. [2022-07-21 17:34:48,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-21 17:34:48,623 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:34:48,623 INFO L195 NwaCegarLoop]: 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] [2022-07-21 17:34:48,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-21 17:34:48,623 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-07-21 17:34:48,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:34:48,624 INFO L85 PathProgramCache]: Analyzing trace with hash -2030948706, now seen corresponding path program 1 times [2022-07-21 17:34:48,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:34:48,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902099942] [2022-07-21 17:34:48,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:34:48,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:34:48,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:34:48,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:34:48,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:34:48,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902099942] [2022-07-21 17:34:48,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902099942] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:34:48,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:34:48,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:34:48,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482121189] [2022-07-21 17:34:48,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:34:48,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:34:48,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:34:48,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:34:48,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:34:48,652 INFO L87 Difference]: Start difference. First operand 267 states and 323 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) [2022-07-21 17:34:48,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:34:48,657 INFO L93 Difference]: Finished difference Result 269 states and 325 transitions. [2022-07-21 17:34:48,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:34:48,658 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 [2022-07-21 17:34:48,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:34:48,659 INFO L225 Difference]: With dead ends: 269 [2022-07-21 17:34:48,659 INFO L226 Difference]: Without dead ends: 269 [2022-07-21 17:34:48,659 INFO L412 NwaCegarLoop]: 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 [2022-07-21 17:34:48,660 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:34:48,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 286 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:34:48,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-07-21 17:34:48,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2022-07-21 17:34:48,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 239 states have (on average 1.3598326359832635) internal successors, (325), 268 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:34:48,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 325 transitions. [2022-07-21 17:34:48,666 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 325 transitions. Word has length 35 [2022-07-21 17:34:48,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:34:48,666 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 325 transitions. [2022-07-21 17:34:48,666 INFO L496 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) [2022-07-21 17:34:48,666 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 325 transitions. [2022-07-21 17:34:48,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-21 17:34:48,667 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:34:48,667 INFO L195 NwaCegarLoop]: 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] [2022-07-21 17:34:48,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-21 17:34:48,667 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-07-21 17:34:48,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:34:48,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1994309533, now seen corresponding path program 1 times [2022-07-21 17:34:48,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:34:48,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555290755] [2022-07-21 17:34:48,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:34:48,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:34:48,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:34:48,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:34:48,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:34:48,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555290755] [2022-07-21 17:34:48,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555290755] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:34:48,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:34:48,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-21 17:34:48,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217275410] [2022-07-21 17:34:48,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:34:48,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-21 17:34:48,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:34:48,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-21 17:34:48,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-07-21 17:34:48,837 INFO L87 Difference]: Start difference. First operand 269 states and 325 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) [2022-07-21 17:34:49,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:34:49,458 INFO L93 Difference]: Finished difference Result 433 states and 474 transitions. [2022-07-21 17:34:49,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-21 17:34:49,459 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 [2022-07-21 17:34:49,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:34:49,460 INFO L225 Difference]: With dead ends: 433 [2022-07-21 17:34:49,460 INFO L226 Difference]: Without dead ends: 433 [2022-07-21 17:34:49,460 INFO L412 NwaCegarLoop]: 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 [2022-07-21 17:34:49,461 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 583 mSDsluCounter, 1067 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 1205 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 17:34:49,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 1205 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 17:34:49,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2022-07-21 17:34:49,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 269. [2022-07-21 17:34:49,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 239 states have (on average 1.3556485355648535) internal successors, (324), 268 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:34:49,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 324 transitions. [2022-07-21 17:34:49,465 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 324 transitions. Word has length 36 [2022-07-21 17:34:49,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:34:49,465 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 324 transitions. [2022-07-21 17:34:49,465 INFO L496 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) [2022-07-21 17:34:49,465 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 324 transitions. [2022-07-21 17:34:49,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-21 17:34:49,465 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:34:49,466 INFO L195 NwaCegarLoop]: 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] [2022-07-21 17:34:49,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-21 17:34:49,466 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-07-21 17:34:49,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:34:49,466 INFO L85 PathProgramCache]: Analyzing trace with hash -339896365, now seen corresponding path program 1 times [2022-07-21 17:34:49,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:34:49,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597469777] [2022-07-21 17:34:49,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:34:49,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:34:49,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:34:49,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:34:49,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:34:49,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597469777] [2022-07-21 17:34:49,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597469777] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:34:49,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:34:49,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 17:34:49,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543842617] [2022-07-21 17:34:49,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:34:49,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 17:34:49,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:34:49,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 17:34:49,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:34:49,531 INFO L87 Difference]: Start difference. First operand 269 states and 324 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) [2022-07-21 17:34:49,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:34:49,683 INFO L93 Difference]: Finished difference Result 284 states and 339 transitions. [2022-07-21 17:34:49,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 17:34:49,684 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 [2022-07-21 17:34:49,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:34:49,685 INFO L225 Difference]: With dead ends: 284 [2022-07-21 17:34:49,685 INFO L226 Difference]: Without dead ends: 284 [2022-07-21 17:34:49,685 INFO L412 NwaCegarLoop]: 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 [2022-07-21 17:34:49,685 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 49 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:34:49,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 641 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:34:49,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-07-21 17:34:49,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 278. [2022-07-21 17:34:49,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 248 states have (on average 1.342741935483871) internal successors, (333), 277 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:34:49,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 333 transitions. [2022-07-21 17:34:49,693 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 333 transitions. Word has length 36 [2022-07-21 17:34:49,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:34:49,693 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 333 transitions. [2022-07-21 17:34:49,694 INFO L496 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) [2022-07-21 17:34:49,694 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 333 transitions. [2022-07-21 17:34:49,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-21 17:34:49,694 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:34:49,694 INFO L195 NwaCegarLoop]: 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] [2022-07-21 17:34:49,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-21 17:34:49,695 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-07-21 17:34:49,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:34:49,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1197350168, now seen corresponding path program 1 times [2022-07-21 17:34:49,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:34:49,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428402867] [2022-07-21 17:34:49,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:34:49,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:34:49,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:34:49,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:34:49,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:34:49,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428402867] [2022-07-21 17:34:49,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428402867] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:34:49,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:34:49,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 17:34:49,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604107023] [2022-07-21 17:34:49,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:34:49,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 17:34:49,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:34:49,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 17:34:49,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-07-21 17:34:49,775 INFO L87 Difference]: Start difference. First operand 278 states and 333 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) [2022-07-21 17:34:50,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:34:50,014 INFO L93 Difference]: Finished difference Result 278 states and 333 transitions. [2022-07-21 17:34:50,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 17:34:50,015 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 [2022-07-21 17:34:50,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:34:50,016 INFO L225 Difference]: With dead ends: 278 [2022-07-21 17:34:50,016 INFO L226 Difference]: Without dead ends: 278 [2022-07-21 17:34:50,017 INFO L412 NwaCegarLoop]: 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 [2022-07-21 17:34:50,017 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 84 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:34:50,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 675 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:34:50,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-07-21 17:34:50,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 277. [2022-07-21 17:34:50,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 248 states have (on average 1.3387096774193548) internal successors, (332), 276 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:34:50,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 332 transitions. [2022-07-21 17:34:50,023 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 332 transitions. Word has length 36 [2022-07-21 17:34:50,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:34:50,023 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 332 transitions. [2022-07-21 17:34:50,023 INFO L496 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) [2022-07-21 17:34:50,023 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 332 transitions. [2022-07-21 17:34:50,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-21 17:34:50,024 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:34:50,024 INFO L195 NwaCegarLoop]: 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] [2022-07-21 17:34:50,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-21 17:34:50,024 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-07-21 17:34:50,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:34:50,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1197350169, now seen corresponding path program 1 times [2022-07-21 17:34:50,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:34:50,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069201720] [2022-07-21 17:34:50,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:34:50,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:34:50,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:34:50,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:34:50,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:34:50,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069201720] [2022-07-21 17:34:50,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069201720] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:34:50,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:34:50,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 17:34:50,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629927080] [2022-07-21 17:34:50,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:34:50,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 17:34:50,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:34:50,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 17:34:50,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-07-21 17:34:50,118 INFO L87 Difference]: Start difference. First operand 277 states and 332 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) [2022-07-21 17:34:50,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:34:50,431 INFO L93 Difference]: Finished difference Result 277 states and 332 transitions. [2022-07-21 17:34:50,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 17:34:50,432 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 [2022-07-21 17:34:50,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:34:50,433 INFO L225 Difference]: With dead ends: 277 [2022-07-21 17:34:50,433 INFO L226 Difference]: Without dead ends: 277 [2022-07-21 17:34:50,434 INFO L412 NwaCegarLoop]: 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 [2022-07-21 17:34:50,434 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 78 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:34:50,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 742 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:34:50,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2022-07-21 17:34:50,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 276. [2022-07-21 17:34:50,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 248 states have (on average 1.3346774193548387) internal successors, (331), 275 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:34:50,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 331 transitions. [2022-07-21 17:34:50,437 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 331 transitions. Word has length 36 [2022-07-21 17:34:50,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:34:50,437 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 331 transitions. [2022-07-21 17:34:50,437 INFO L496 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) [2022-07-21 17:34:50,437 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 331 transitions. [2022-07-21 17:34:50,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-21 17:34:50,438 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:34:50,438 INFO L195 NwaCegarLoop]: 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] [2022-07-21 17:34:50,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-21 17:34:50,438 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-07-21 17:34:50,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:34:50,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1824914429, now seen corresponding path program 1 times [2022-07-21 17:34:50,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:34:50,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954661248] [2022-07-21 17:34:50,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:34:50,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:34:50,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:34:50,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:34:50,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:34:50,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954661248] [2022-07-21 17:34:50,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954661248] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:34:50,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:34:50,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 17:34:50,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030774873] [2022-07-21 17:34:50,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:34:50,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 17:34:50,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:34:50,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 17:34:50,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:34:50,488 INFO L87 Difference]: Start difference. First operand 276 states and 331 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) [2022-07-21 17:34:50,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:34:50,618 INFO L93 Difference]: Finished difference Result 286 states and 342 transitions. [2022-07-21 17:34:50,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 17:34:50,619 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 [2022-07-21 17:34:50,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:34:50,620 INFO L225 Difference]: With dead ends: 286 [2022-07-21 17:34:50,620 INFO L226 Difference]: Without dead ends: 286 [2022-07-21 17:34:50,620 INFO L412 NwaCegarLoop]: 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 [2022-07-21 17:34:50,631 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 33 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:34:50,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 457 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:34:50,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-07-21 17:34:50,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 272. [2022-07-21 17:34:50,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 245 states have (on average 1.3306122448979592) internal successors, (326), 271 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:34:50,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 326 transitions. [2022-07-21 17:34:50,639 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 326 transitions. Word has length 37 [2022-07-21 17:34:50,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:34:50,640 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 326 transitions. [2022-07-21 17:34:50,640 INFO L496 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) [2022-07-21 17:34:50,640 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 326 transitions. [2022-07-21 17:34:50,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-21 17:34:50,640 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:34:50,640 INFO L195 NwaCegarLoop]: 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] [2022-07-21 17:34:50,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-21 17:34:50,641 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-07-21 17:34:50,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:34:50,641 INFO L85 PathProgramCache]: Analyzing trace with hash -160017480, now seen corresponding path program 1 times [2022-07-21 17:34:50,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:34:50,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478604244] [2022-07-21 17:34:50,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:34:50,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:34:50,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:34:50,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:34:50,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:34:50,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478604244] [2022-07-21 17:34:50,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478604244] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:34:50,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:34:50,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 17:34:50,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026654943] [2022-07-21 17:34:50,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:34:50,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:34:50,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:34:50,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:34:50,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:34:50,666 INFO L87 Difference]: Start difference. First operand 272 states and 326 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) [2022-07-21 17:34:50,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:34:50,689 INFO L93 Difference]: Finished difference Result 285 states and 330 transitions. [2022-07-21 17:34:50,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:34:50,690 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 [2022-07-21 17:34:50,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:34:50,691 INFO L225 Difference]: With dead ends: 285 [2022-07-21 17:34:50,691 INFO L226 Difference]: Without dead ends: 285 [2022-07-21 17:34:50,691 INFO L412 NwaCegarLoop]: 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 [2022-07-21 17:34:50,692 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 97 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 150 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 [2022-07-21 17:34:50,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 150 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:34:50,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2022-07-21 17:34:50,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 273. [2022-07-21 17:34:50,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 246 states have (on average 1.329268292682927) internal successors, (327), 272 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:34:50,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 327 transitions. [2022-07-21 17:34:50,695 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 327 transitions. Word has length 38 [2022-07-21 17:34:50,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:34:50,696 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 327 transitions. [2022-07-21 17:34:50,696 INFO L496 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) [2022-07-21 17:34:50,696 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 327 transitions. [2022-07-21 17:34:50,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-21 17:34:50,696 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:34:50,696 INFO L195 NwaCegarLoop]: 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] [2022-07-21 17:34:50,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-21 17:34:50,697 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-07-21 17:34:50,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:34:50,697 INFO L85 PathProgramCache]: Analyzing trace with hash 196879808, now seen corresponding path program 1 times [2022-07-21 17:34:50,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:34:50,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321246013] [2022-07-21 17:34:50,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:34:50,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:34:50,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:34:50,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:34:50,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:34:50,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321246013] [2022-07-21 17:34:50,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321246013] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:34:50,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:34:50,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-21 17:34:50,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404022294] [2022-07-21 17:34:50,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:34:50,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-21 17:34:50,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:34:50,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-21 17:34:50,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-07-21 17:34:50,888 INFO L87 Difference]: Start difference. First operand 273 states and 327 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) [2022-07-21 17:34:51,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:34:51,506 INFO L93 Difference]: Finished difference Result 435 states and 475 transitions. [2022-07-21 17:34:51,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-21 17:34:51,506 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 [2022-07-21 17:34:51,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:34:51,512 INFO L225 Difference]: With dead ends: 435 [2022-07-21 17:34:51,512 INFO L226 Difference]: Without dead ends: 435 [2022-07-21 17:34:51,513 INFO L412 NwaCegarLoop]: 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 [2022-07-21 17:34:51,513 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 826 mSDsluCounter, 934 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 17:34:51,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 1051 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 17:34:51,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2022-07-21 17:34:51,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 273. [2022-07-21 17:34:51,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 246 states have (on average 1.3252032520325203) internal successors, (326), 272 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:34:51,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 326 transitions. [2022-07-21 17:34:51,517 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 326 transitions. Word has length 39 [2022-07-21 17:34:51,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:34:51,517 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 326 transitions. [2022-07-21 17:34:51,517 INFO L496 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) [2022-07-21 17:34:51,517 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 326 transitions. [2022-07-21 17:34:51,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-21 17:34:51,518 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:34:51,518 INFO L195 NwaCegarLoop]: 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] [2022-07-21 17:34:51,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-21 17:34:51,518 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-07-21 17:34:51,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:34:51,519 INFO L85 PathProgramCache]: Analyzing trace with hash -862296903, now seen corresponding path program 1 times [2022-07-21 17:34:51,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:34:51,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014626874] [2022-07-21 17:34:51,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:34:51,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:34:51,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:34:51,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:34:51,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:34:51,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014626874] [2022-07-21 17:34:51,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014626874] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:34:51,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:34:51,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:34:51,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849770895] [2022-07-21 17:34:51,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:34:51,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:34:51,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:34:51,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:34:51,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:34:51,545 INFO L87 Difference]: Start difference. First operand 273 states and 326 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) [2022-07-21 17:34:51,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:34:51,579 INFO L93 Difference]: Finished difference Result 275 states and 327 transitions. [2022-07-21 17:34:51,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:34:51,579 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 [2022-07-21 17:34:51,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:34:51,580 INFO L225 Difference]: With dead ends: 275 [2022-07-21 17:34:51,580 INFO L226 Difference]: Without dead ends: 275 [2022-07-21 17:34:51,581 INFO L412 NwaCegarLoop]: 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 [2022-07-21 17:34:51,581 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 88 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 165 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 [2022-07-21 17:34:51,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 165 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:34:51,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-07-21 17:34:51,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 271. [2022-07-21 17:34:51,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 245 states have (on average 1.3183673469387756) internal successors, (323), 270 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:34:51,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 323 transitions. [2022-07-21 17:34:51,586 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 323 transitions. Word has length 41 [2022-07-21 17:34:51,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:34:51,586 INFO L495 AbstractCegarLoop]: Abstraction has 271 states and 323 transitions. [2022-07-21 17:34:51,586 INFO L496 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) [2022-07-21 17:34:51,586 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 323 transitions. [2022-07-21 17:34:51,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-21 17:34:51,586 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:34:51,587 INFO L195 NwaCegarLoop]: 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] [2022-07-21 17:34:51,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-21 17:34:51,587 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-07-21 17:34:51,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:34:51,587 INFO L85 PathProgramCache]: Analyzing trace with hash 333412926, now seen corresponding path program 1 times [2022-07-21 17:34:51,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:34:51,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769288175] [2022-07-21 17:34:51,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:34:51,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:34:51,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:34:51,703 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:34:51,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:34:51,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769288175] [2022-07-21 17:34:51,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769288175] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:34:51,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950572075] [2022-07-21 17:34:51,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:34:51,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:34:51,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:34:51,705 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) [2022-07-21 17:34:51,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-21 17:34:51,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:34:51,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-21 17:34:51,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:34:51,796 INFO L390 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 [2022-07-21 17:34:51,798 INFO L390 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 [2022-07-21 17:34:51,822 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-21 17:34:51,822 INFO L390 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 [2022-07-21 17:34:51,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:34:51,826 INFO L390 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 [2022-07-21 17:34:51,889 INFO L390 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 [2022-07-21 17:34:51,892 INFO L390 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 [2022-07-21 17:34:51,902 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:34:51,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:34:51,983 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:34:51,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1950572075] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:34:51,983 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:34:51,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 9 [2022-07-21 17:34:51,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216429103] [2022-07-21 17:34:51,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:34:51,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 17:34:51,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:34:51,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 17:34:51,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-21 17:34:51,985 INFO L87 Difference]: Start difference. First operand 271 states and 323 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) [2022-07-21 17:34:52,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:34:52,269 INFO L93 Difference]: Finished difference Result 372 states and 411 transitions. [2022-07-21 17:34:52,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 17:34:52,271 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 [2022-07-21 17:34:52,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:34:52,272 INFO L225 Difference]: With dead ends: 372 [2022-07-21 17:34:52,272 INFO L226 Difference]: Without dead ends: 372 [2022-07-21 17:34:52,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-07-21 17:34:52,272 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 200 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:34:52,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 872 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:34:52,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2022-07-21 17:34:52,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 295. [2022-07-21 17:34:52,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 269 states have (on average 1.3271375464684014) internal successors, (357), 294 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:34:52,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 357 transitions. [2022-07-21 17:34:52,276 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 357 transitions. Word has length 41 [2022-07-21 17:34:52,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:34:52,276 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 357 transitions. [2022-07-21 17:34:52,277 INFO L496 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) [2022-07-21 17:34:52,277 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 357 transitions. [2022-07-21 17:34:52,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-21 17:34:52,277 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:34:52,277 INFO L195 NwaCegarLoop]: 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] [2022-07-21 17:34:52,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-21 17:34:52,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-07-21 17:34:52,483 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-07-21 17:34:52,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:34:52,484 INFO L85 PathProgramCache]: Analyzing trace with hash -961395774, now seen corresponding path program 1 times [2022-07-21 17:34:52,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:34:52,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202469522] [2022-07-21 17:34:52,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:34:52,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:34:52,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:34:52,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:34:52,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:34:52,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202469522] [2022-07-21 17:34:52,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202469522] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:34:52,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:34:52,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 17:34:52,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817382488] [2022-07-21 17:34:52,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:34:52,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 17:34:52,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:34:52,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 17:34:52,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-21 17:34:52,564 INFO L87 Difference]: Start difference. First operand 295 states and 357 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) [2022-07-21 17:34:52,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:34:52,848 INFO L93 Difference]: Finished difference Result 361 states and 415 transitions. [2022-07-21 17:34:52,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 17:34:52,849 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 [2022-07-21 17:34:52,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:34:52,850 INFO L225 Difference]: With dead ends: 361 [2022-07-21 17:34:52,850 INFO L226 Difference]: Without dead ends: 361 [2022-07-21 17:34:52,850 INFO L412 NwaCegarLoop]: 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 [2022-07-21 17:34:52,850 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 441 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:34:52,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 559 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:34:52,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2022-07-21 17:34:52,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 302. [2022-07-21 17:34:52,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 276 states have (on average 1.326086956521739) internal successors, (366), 301 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:34:52,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 366 transitions. [2022-07-21 17:34:52,858 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 366 transitions. Word has length 42 [2022-07-21 17:34:52,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:34:52,859 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 366 transitions. [2022-07-21 17:34:52,859 INFO L496 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) [2022-07-21 17:34:52,859 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 366 transitions. [2022-07-21 17:34:52,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-21 17:34:52,859 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:34:52,859 INFO L195 NwaCegarLoop]: 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] [2022-07-21 17:34:52,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-07-21 17:34:52,860 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-07-21 17:34:52,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:34:52,860 INFO L85 PathProgramCache]: Analyzing trace with hash -961395773, now seen corresponding path program 1 times [2022-07-21 17:34:52,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:34:52,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379509560] [2022-07-21 17:34:52,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:34:52,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:34:52,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:34:52,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:34:52,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:34:52,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379509560] [2022-07-21 17:34:52,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379509560] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:34:52,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:34:52,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 17:34:52,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329210602] [2022-07-21 17:34:52,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:34:52,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 17:34:52,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:34:52,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 17:34:52,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-21 17:34:52,961 INFO L87 Difference]: Start difference. First operand 302 states and 366 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) [2022-07-21 17:34:53,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:34:53,271 INFO L93 Difference]: Finished difference Result 361 states and 415 transitions. [2022-07-21 17:34:53,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 17:34:53,272 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 [2022-07-21 17:34:53,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:34:53,273 INFO L225 Difference]: With dead ends: 361 [2022-07-21 17:34:53,273 INFO L226 Difference]: Without dead ends: 361 [2022-07-21 17:34:53,273 INFO L412 NwaCegarLoop]: 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 [2022-07-21 17:34:53,273 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 266 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:34:53,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 656 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:34:53,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2022-07-21 17:34:53,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 308. [2022-07-21 17:34:53,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 282 states have (on average 1.322695035460993) internal successors, (373), 307 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:34:53,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 373 transitions. [2022-07-21 17:34:53,277 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 373 transitions. Word has length 42 [2022-07-21 17:34:53,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:34:53,278 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 373 transitions. [2022-07-21 17:34:53,278 INFO L496 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) [2022-07-21 17:34:53,278 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 373 transitions. [2022-07-21 17:34:53,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-21 17:34:53,278 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:34:53,278 INFO L195 NwaCegarLoop]: 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] [2022-07-21 17:34:53,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-07-21 17:34:53,279 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr79ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-07-21 17:34:53,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:34:53,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1745867301, now seen corresponding path program 1 times [2022-07-21 17:34:53,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:34:53,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009495551] [2022-07-21 17:34:53,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:34:53,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:34:53,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:34:53,310 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:34:53,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:34:53,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009495551] [2022-07-21 17:34:53,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009495551] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:34:53,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829624520] [2022-07-21 17:34:53,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:34:53,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:34:53,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:34:53,312 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) [2022-07-21 17:34:53,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-21 17:34:53,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:34:53,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-21 17:34:53,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:34:53,437 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 17:34:53,452 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:34:53,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:34:53,489 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:34:53,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829624520] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:34:53,489 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:34:53,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2022-07-21 17:34:53,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794772368] [2022-07-21 17:34:53,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:34:53,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 17:34:53,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:34:53,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 17:34:53,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:34:53,490 INFO L87 Difference]: Start difference. First operand 308 states and 373 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) [2022-07-21 17:34:53,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:34:53,552 INFO L93 Difference]: Finished difference Result 339 states and 404 transitions. [2022-07-21 17:34:53,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 17:34:53,560 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 [2022-07-21 17:34:53,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:34:53,561 INFO L225 Difference]: With dead ends: 339 [2022-07-21 17:34:53,561 INFO L226 Difference]: Without dead ends: 315 [2022-07-21 17:34:53,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:34:53,562 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:34:53,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 302 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 1 Unchecked, 0.1s Time] [2022-07-21 17:34:53,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2022-07-21 17:34:53,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2022-07-21 17:34:53,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 289 states have (on average 1.314878892733564) internal successors, (380), 314 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:34:53,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 380 transitions. [2022-07-21 17:34:53,566 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 380 transitions. Word has length 42 [2022-07-21 17:34:53,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:34:53,566 INFO L495 AbstractCegarLoop]: Abstraction has 315 states and 380 transitions. [2022-07-21 17:34:53,566 INFO L496 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) [2022-07-21 17:34:53,566 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 380 transitions. [2022-07-21 17:34:53,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-21 17:34:53,567 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:34:53,567 INFO L195 NwaCegarLoop]: 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] [2022-07-21 17:34:53,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-21 17:34:53,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:34:53,784 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-07-21 17:34:53,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:34:53,785 INFO L85 PathProgramCache]: Analyzing trace with hash -377971448, now seen corresponding path program 1 times [2022-07-21 17:34:53,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:34:53,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082844342] [2022-07-21 17:34:53,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:34:53,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:34:53,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 17:34:53,798 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-21 17:34:53,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 17:34:53,829 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-21 17:34:53,829 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-21 17:34:53,831 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 80 remaining) [2022-07-21 17:34:53,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 80 remaining) [2022-07-21 17:34:53,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 80 remaining) [2022-07-21 17:34:53,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (76 of 80 remaining) [2022-07-21 17:34:53,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 80 remaining) [2022-07-21 17:34:53,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 80 remaining) [2022-07-21 17:34:53,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 80 remaining) [2022-07-21 17:34:53,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 80 remaining) [2022-07-21 17:34:53,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 80 remaining) [2022-07-21 17:34:53,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 80 remaining) [2022-07-21 17:34:53,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 80 remaining) [2022-07-21 17:34:53,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 80 remaining) [2022-07-21 17:34:53,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 80 remaining) [2022-07-21 17:34:53,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 80 remaining) [2022-07-21 17:34:53,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 80 remaining) [2022-07-21 17:34:53,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 80 remaining) [2022-07-21 17:34:53,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 80 remaining) [2022-07-21 17:34:53,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 80 remaining) [2022-07-21 17:34:53,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 80 remaining) [2022-07-21 17:34:53,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 80 remaining) [2022-07-21 17:34:53,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK (59 of 80 remaining) [2022-07-21 17:34:53,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 80 remaining) [2022-07-21 17:34:53,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 80 remaining) [2022-07-21 17:34:53,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 80 remaining) [2022-07-21 17:34:53,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 80 remaining) [2022-07-21 17:34:53,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 80 remaining) [2022-07-21 17:34:53,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 80 remaining) [2022-07-21 17:34:53,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK (52 of 80 remaining) [2022-07-21 17:34:53,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK (51 of 80 remaining) [2022-07-21 17:34:53,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 80 remaining) [2022-07-21 17:34:53,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 80 remaining) [2022-07-21 17:34:53,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 80 remaining) [2022-07-21 17:34:53,839 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 80 remaining) [2022-07-21 17:34:53,839 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 80 remaining) [2022-07-21 17:34:53,839 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 80 remaining) [2022-07-21 17:34:53,839 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 80 remaining) [2022-07-21 17:34:53,839 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 80 remaining) [2022-07-21 17:34:53,839 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 80 remaining) [2022-07-21 17:34:53,840 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 80 remaining) [2022-07-21 17:34:53,840 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 80 remaining) [2022-07-21 17:34:53,840 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 80 remaining) [2022-07-21 17:34:53,840 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 80 remaining) [2022-07-21 17:34:53,840 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 80 remaining) [2022-07-21 17:34:53,840 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 80 remaining) [2022-07-21 17:34:53,840 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 80 remaining) [2022-07-21 17:34:53,840 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK (34 of 80 remaining) [2022-07-21 17:34:53,841 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK (33 of 80 remaining) [2022-07-21 17:34:53,841 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 80 remaining) [2022-07-21 17:34:53,841 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 80 remaining) [2022-07-21 17:34:53,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK (30 of 80 remaining) [2022-07-21 17:34:53,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 80 remaining) [2022-07-21 17:34:53,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 80 remaining) [2022-07-21 17:34:53,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK (27 of 80 remaining) [2022-07-21 17:34:53,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 80 remaining) [2022-07-21 17:34:53,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 80 remaining) [2022-07-21 17:34:53,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK (24 of 80 remaining) [2022-07-21 17:34:53,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 80 remaining) [2022-07-21 17:34:53,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 80 remaining) [2022-07-21 17:34:53,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 80 remaining) [2022-07-21 17:34:53,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_LEAK (20 of 80 remaining) [2022-07-21 17:34:53,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 80 remaining) [2022-07-21 17:34:53,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 80 remaining) [2022-07-21 17:34:53,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 80 remaining) [2022-07-21 17:34:53,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 80 remaining) [2022-07-21 17:34:53,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK (15 of 80 remaining) [2022-07-21 17:34:53,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 80 remaining) [2022-07-21 17:34:53,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 80 remaining) [2022-07-21 17:34:53,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_LEAK (12 of 80 remaining) [2022-07-21 17:34:53,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 80 remaining) [2022-07-21 17:34:53,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 80 remaining) [2022-07-21 17:34:53,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK (9 of 80 remaining) [2022-07-21 17:34:53,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE (8 of 80 remaining) [2022-07-21 17:34:53,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE (7 of 80 remaining) [2022-07-21 17:34:53,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE (6 of 80 remaining) [2022-07-21 17:34:53,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 80 remaining) [2022-07-21 17:34:53,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 80 remaining) [2022-07-21 17:34:53,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE (3 of 80 remaining) [2022-07-21 17:34:53,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE (2 of 80 remaining) [2022-07-21 17:34:53,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78ASSERT_VIOLATIONMEMORY_FREE (1 of 80 remaining) [2022-07-21 17:34:53,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79ASSERT_VIOLATIONMEMORY_LEAK (0 of 80 remaining) [2022-07-21 17:34:53,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-07-21 17:34:53,849 INFO L356 BasicCegarLoop]: Path program 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] [2022-07-21 17:34:53,852 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 17:34:53,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 05:34:53 BoogieIcfgContainer [2022-07-21 17:34:53,900 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 17:34:53,901 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 17:34:53,901 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 17:34:53,901 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 17:34:53,902 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:34:40" (3/4) ... [2022-07-21 17:34:53,903 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-21 17:34:53,933 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-21 17:34:53,934 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 17:34:53,935 INFO L158 Benchmark]: Toolchain (without parser) took 14114.17ms. Allocated memory was 60.8MB in the beginning and 113.2MB in the end (delta: 52.4MB). Free memory was 39.6MB in the beginning and 37.9MB in the end (delta: 1.6MB). Peak memory consumption was 53.9MB. Max. memory is 16.1GB. [2022-07-21 17:34:53,935 INFO L158 Benchmark]: CDTParser took 0.68ms. Allocated memory is still 60.8MB. Free memory was 42.5MB in the beginning and 42.4MB in the end (delta: 33.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 17:34:53,938 INFO L158 Benchmark]: CACSL2BoogieTranslator took 367.77ms. Allocated memory is still 60.8MB. Free memory was 39.3MB in the beginning and 34.8MB in the end (delta: 4.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-21 17:34:53,939 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.64ms. Allocated memory is still 60.8MB. Free memory was 34.6MB in the beginning and 32.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 17:34:53,940 INFO L158 Benchmark]: Boogie Preprocessor took 36.65ms. Allocated memory is still 60.8MB. Free memory was 32.3MB in the beginning and 30.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 17:34:53,940 INFO L158 Benchmark]: RCFGBuilder took 631.19ms. Allocated memory was 60.8MB in the beginning and 77.6MB in the end (delta: 16.8MB). Free memory was 30.0MB in the beginning and 38.7MB in the end (delta: -8.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-21 17:34:53,940 INFO L158 Benchmark]: TraceAbstraction took 12981.15ms. Allocated memory was 77.6MB in the beginning and 113.2MB in the end (delta: 35.7MB). Free memory was 38.4MB in the beginning and 41.1MB in the end (delta: -2.7MB). Peak memory consumption was 33.5MB. Max. memory is 16.1GB. [2022-07-21 17:34:53,940 INFO L158 Benchmark]: Witness Printer took 32.90ms. Allocated memory is still 113.2MB. Free memory was 41.1MB in the beginning and 37.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 17:34:53,941 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.68ms. Allocated memory is still 60.8MB. Free memory was 42.5MB in the beginning and 42.4MB in the end (delta: 33.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 367.77ms. Allocated memory is still 60.8MB. Free memory was 39.3MB in the beginning and 34.8MB in the end (delta: 4.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.64ms. Allocated memory is still 60.8MB. Free memory was 34.6MB in the beginning and 32.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.65ms. Allocated memory is still 60.8MB. Free memory was 32.3MB in the beginning and 30.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 631.19ms. Allocated memory was 60.8MB in the beginning and 77.6MB in the end (delta: 16.8MB). Free memory was 30.0MB in the beginning and 38.7MB in the end (delta: -8.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 12981.15ms. Allocated memory was 77.6MB in the beginning and 113.2MB in the end (delta: 35.7MB). Free memory was 38.4MB in the beginning and 41.1MB in the end (delta: -2.7MB). Peak memory consumption was 33.5MB. Max. memory is 16.1GB. * Witness Printer took 32.90ms. Allocated memory is still 113.2MB. Free memory was 41.1MB in the beginning and 37.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L1002] SLL* list = malloc(sizeof(SLL)); [L1003] list->next = ((void*)0) VAL [list={-1:0}] [L1004] COND FALSE !(!(list != ((void*)0))) VAL [list={-1:0}] [L1004] COND FALSE !(__VERIFIER_nondet_int()) [L1004] list->inner = malloc(sizeof(SLL)) VAL [list={-1:0}, malloc(sizeof(SLL))={-2:0}] [L1004] EXPR list->inner VAL [list={-1:0}, list->inner={-2:0}] [L1004] list->inner->next = ((void*)0) VAL [list={-1:0}, list->inner={-2:0}] [L1004] EXPR list->inner VAL [list={-1:0}, list->inner={-2:0}] [L1004] list->inner->inner = ((void*)0) VAL [list={-1:0}, list->inner={-2:0}] [L1004] EXPR list->inner VAL [list={-1:0}, list->inner={-2:0}] [L1004] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={-1:0}, list->inner={-2:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1] [L1004] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L1006] SLL* end = list; VAL [end={-1:0}, list={-1:0}] [L1009] COND FALSE !(__VERIFIER_nondet_int()) [L1019] end = ((void*)0) [L1020] end = list VAL [end={-1:0}, list={-1:0}] [L1023] COND FALSE !(!(((void*)0) != end)) VAL [end={-1:0}, list={-1:0}] [L1025] COND TRUE ((void*)0) != end [L1027] int len = 0; VAL [end={-1:0}, len=0, list={-1:0}] [L1028] EXPR end->inner VAL [end={-1:0}, end->inner={-2:0}, len=0, list={-1:0}] [L1028] SLL* inner = end->inner; [L1029] COND TRUE ((void*)0) != inner VAL [end={-1:0}, inner={-2:0}, len=0, list={-1:0}] [L1031] COND TRUE len == 0 [L1032] len = 1 VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1035] COND FALSE !(!(((void*)0) != inner)) VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1036] EXPR inner->inner VAL [end={-1:0}, inner={-2:0}, inner->inner={0:0}, len=1, list={-1:0}] [L1036] COND FALSE !(!(((void*)0) == inner->inner)) [L1037] EXPR inner->next VAL [end={-1:0}, inner={-2:0}, inner->next={0:0}, len=1, list={-1:0}] [L1037] COND FALSE !(!(((void*)0) == inner->next)) [L1038] EXPR inner->inner VAL [end={-1:0}, inner={-2:0}, inner->inner={0:0}, len=1, list={-1:0}] [L1038] inner = inner->inner [L1039] COND TRUE len == 1 VAL [end={-1:0}, inner={0:0}, len=1, list={-1:0}] [L1040] inner->inner - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1036]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1037]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1042]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1054]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1055]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1056]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1057]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1057]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1057]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 999]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 195 locations, 80 error locations. Started 1 CEGAR loops. OverallTime: 12.9s, OverallIterations: 37, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7279 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7279 mSDsluCounter, 18775 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 94 IncrementalHoareTripleChecker+Unchecked, 13880 mSDsCounter, 440 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9361 IncrementalHoareTripleChecker+Invalid, 9895 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 440 mSolverCounterUnsat, 4895 mSDtfsCounter, 9361 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 612 GetRequests, 275 SyntacticMatches, 1 SemanticMatches, 336 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 686 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=315occurred in iteration=36, InterpolantAutomatonStates: 312, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 36 MinimizatonAttempts, 1390 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 1124 NumberOfCodeBlocks, 1124 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1153 ConstructedInterpolants, 19 QuantifiedInterpolants, 10574 SizeOfPredicates, 16 NumberOfNonLiveVariables, 518 ConjunctsInSsa, 62 ConjunctsInUnsatCore, 42 InterpolantComputations, 33 PerfectInterpolantSequences, 16/26 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-21 17:34:53,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)