./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/dll-01-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/dll-01-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 652acbc8fb2d659424086f7ee4bd5fc2f45ff1d49f46cde68db4fdee1ed0638e --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 06:16:44,368 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 06:16:44,371 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 06:16:44,416 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 06:16:44,416 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 06:16:44,418 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 06:16:44,420 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 06:16:44,423 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 06:16:44,425 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 06:16:44,430 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 06:16:44,431 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 06:16:44,433 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 06:16:44,433 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 06:16:44,435 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 06:16:44,436 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 06:16:44,439 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 06:16:44,440 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 06:16:44,442 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 06:16:44,443 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 06:16:44,448 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 06:16:44,452 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 06:16:44,453 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 06:16:44,454 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 06:16:44,455 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 06:16:44,456 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 06:16:44,463 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 06:16:44,464 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 06:16:44,464 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 06:16:44,466 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 06:16:44,466 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 06:16:44,467 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 06:16:44,468 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 06:16:44,469 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 06:16:44,470 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 06:16:44,471 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 06:16:44,472 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 06:16:44,472 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 06:16:44,472 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 06:16:44,473 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 06:16:44,474 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 06:16:44,474 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 06:16:44,476 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 06:16:44,477 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-23 06:16:44,505 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 06:16:44,506 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 06:16:44,506 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 06:16:44,507 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 06:16:44,507 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 06:16:44,508 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 06:16:44,508 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 06:16:44,508 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 06:16:44,509 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 06:16:44,509 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 06:16:44,510 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 06:16:44,510 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 06:16:44,510 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 06:16:44,510 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 06:16:44,510 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 06:16:44,510 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-23 06:16:44,511 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-23 06:16:44,511 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-23 06:16:44,511 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 06:16:44,511 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-23 06:16:44,511 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 06:16:44,511 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 06:16:44,512 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 06:16:44,512 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 06:16:44,512 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 06:16:44,512 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 06:16:44,512 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 06:16:44,513 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 06:16:44,513 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 06:16:44,513 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-23 06:16:44,513 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 652acbc8fb2d659424086f7ee4bd5fc2f45ff1d49f46cde68db4fdee1ed0638e [2022-07-23 06:16:44,796 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 06:16:44,822 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 06:16:44,824 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 06:16:44,825 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 06:16:44,827 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 06:16:44,829 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-01-2.i [2022-07-23 06:16:44,888 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdfb1b883/53fe04fc72184030a340b2209049e322/FLAG03a005023 [2022-07-23 06:16:45,432 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 06:16:45,433 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i [2022-07-23 06:16:45,450 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdfb1b883/53fe04fc72184030a340b2209049e322/FLAG03a005023 [2022-07-23 06:16:45,732 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdfb1b883/53fe04fc72184030a340b2209049e322 [2022-07-23 06:16:45,734 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 06:16:45,736 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 06:16:45,739 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 06:16:45,739 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 06:16:45,742 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 06:16:45,743 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 06:16:45" (1/1) ... [2022-07-23 06:16:45,744 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3462c57b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:16:45, skipping insertion in model container [2022-07-23 06:16:45,744 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 06:16:45" (1/1) ... [2022-07-23 06:16:45,752 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 06:16:45,804 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 06:16:46,070 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[22080,22093] [2022-07-23 06:16:46,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/dll-01-2.i[22353,22366] [2022-07-23 06:16:46,095 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[22587,22600] [2022-07-23 06:16:46,097 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[22657,22670] [2022-07-23 06:16:46,100 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[22924,22937] [2022-07-23 06:16:46,103 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23032,23045] [2022-07-23 06:16:46,105 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23263,23276] [2022-07-23 06:16:46,108 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23343,23356] [2022-07-23 06:16:46,110 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23422,23435] [2022-07-23 06:16:46,111 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23512,23525] [2022-07-23 06:16:46,114 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23690,23703] [2022-07-23 06:16:46,116 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23768,23781] [2022-07-23 06:16:46,117 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23845,23858] [2022-07-23 06:16:46,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 06:16:46,139 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 06:16:46,177 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[22080,22093] [2022-07-23 06:16:46,193 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[22353,22366] [2022-07-23 06:16:46,197 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[22587,22600] [2022-07-23 06:16:46,198 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[22657,22670] [2022-07-23 06:16:46,203 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[22924,22937] [2022-07-23 06:16:46,207 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23032,23045] [2022-07-23 06:16:46,210 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23263,23276] [2022-07-23 06:16:46,211 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23343,23356] [2022-07-23 06:16:46,212 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23422,23435] [2022-07-23 06:16:46,213 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23512,23525] [2022-07-23 06:16:46,214 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23690,23703] [2022-07-23 06:16:46,214 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23768,23781] [2022-07-23 06:16:46,215 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23845,23858] [2022-07-23 06:16:46,217 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 06:16:46,240 INFO L208 MainTranslator]: Completed translation [2022-07-23 06:16:46,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:16:46 WrapperNode [2022-07-23 06:16:46,242 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 06:16:46,243 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 06:16:46,244 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 06:16:46,246 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 06:16:46,259 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:16:46" (1/1) ... [2022-07-23 06:16:46,296 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:16:46" (1/1) ... [2022-07-23 06:16:46,323 INFO L137 Inliner]: procedures = 119, calls = 45, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 231 [2022-07-23 06:16:46,324 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 06:16:46,324 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 06:16:46,325 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 06:16:46,325 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 06:16:46,333 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:16:46" (1/1) ... [2022-07-23 06:16:46,333 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:16:46" (1/1) ... [2022-07-23 06:16:46,342 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:16:46" (1/1) ... [2022-07-23 06:16:46,342 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:16:46" (1/1) ... [2022-07-23 06:16:46,351 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:16:46" (1/1) ... [2022-07-23 06:16:46,357 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:16:46" (1/1) ... [2022-07-23 06:16:46,359 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:16:46" (1/1) ... [2022-07-23 06:16:46,368 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 06:16:46,369 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 06:16:46,369 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 06:16:46,369 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 06:16:46,370 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:16:46" (1/1) ... [2022-07-23 06:16:46,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 06:16:46,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:16:46,418 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-23 06:16:46,447 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-23 06:16:46,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-23 06:16:46,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 06:16:46,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-23 06:16:46,462 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-23 06:16:46,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 06:16:46,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-23 06:16:46,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 06:16:46,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 06:16:46,580 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 06:16:46,595 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 06:16:47,113 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 06:16:47,123 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 06:16:47,127 INFO L299 CfgBuilder]: Removed 30 assume(true) statements. [2022-07-23 06:16:47,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 06:16:47 BoogieIcfgContainer [2022-07-23 06:16:47,131 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 06:16:47,134 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 06:16:47,135 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 06:16:47,138 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 06:16:47,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 06:16:45" (1/3) ... [2022-07-23 06:16:47,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@166ae2ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 06:16:47, skipping insertion in model container [2022-07-23 06:16:47,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:16:46" (2/3) ... [2022-07-23 06:16:47,140 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@166ae2ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 06:16:47, skipping insertion in model container [2022-07-23 06:16:47,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 06:16:47" (3/3) ... [2022-07-23 06:16:47,143 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-01-2.i [2022-07-23 06:16:47,158 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 06:16:47,158 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 86 error locations. [2022-07-23 06:16:47,222 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 06:16:47,229 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@427e4c2c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6a87fe74 [2022-07-23 06:16:47,230 INFO L358 AbstractCegarLoop]: Starting to check reachability of 86 error locations. [2022-07-23 06:16:47,236 INFO L276 IsEmpty]: Start isEmpty. Operand has 203 states, 116 states have (on average 2.1982758620689653) internal successors, (255), 202 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:47,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-23 06:16:47,252 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:16:47,252 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-23 06:16:47,253 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-07-23 06:16:47,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:16:47,258 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-23 06:16:47,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:16:47,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638179151] [2022-07-23 06:16:47,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:16:47,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:16:47,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:47,445 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-23 06:16:47,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:16:47,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638179151] [2022-07-23 06:16:47,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638179151] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:16:47,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:16:47,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:16:47,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026500282] [2022-07-23 06:16:47,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:16:47,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:16:47,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:16:47,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:16:47,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:16:47,489 INFO L87 Difference]: Start difference. First operand has 203 states, 116 states have (on average 2.1982758620689653) internal successors, (255), 202 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:47,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:16:47,706 INFO L93 Difference]: Finished difference Result 201 states and 210 transitions. [2022-07-23 06:16:47,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:16:47,709 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-23 06:16:47,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:16:47,719 INFO L225 Difference]: With dead ends: 201 [2022-07-23 06:16:47,720 INFO L226 Difference]: Without dead ends: 197 [2022-07-23 06:16:47,721 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-23 06:16:47,725 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 191 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:16:47,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 124 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:16:47,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-07-23 06:16:47,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 193. [2022-07-23 06:16:47,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 117 states have (on average 1.7435897435897436) internal successors, (204), 192 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:47,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 204 transitions. [2022-07-23 06:16:47,767 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 204 transitions. Word has length 3 [2022-07-23 06:16:47,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:16:47,767 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 204 transitions. [2022-07-23 06:16:47,767 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-23 06:16:47,768 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 204 transitions. [2022-07-23 06:16:47,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-23 06:16:47,768 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:16:47,768 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-23 06:16:47,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-23 06:16:47,769 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-07-23 06:16:47,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:16:47,769 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-23 06:16:47,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:16:47,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919083858] [2022-07-23 06:16:47,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:16:47,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:16:47,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:47,810 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-23 06:16:47,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:16:47,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919083858] [2022-07-23 06:16:47,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919083858] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:16:47,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:16:47,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:16:47,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557454317] [2022-07-23 06:16:47,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:16:47,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:16:47,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:16:47,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:16:47,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:16:47,820 INFO L87 Difference]: Start difference. First operand 193 states and 204 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:47,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:16:47,942 INFO L93 Difference]: Finished difference Result 222 states and 232 transitions. [2022-07-23 06:16:47,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:16:47,942 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-23 06:16:47,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:16:47,944 INFO L225 Difference]: With dead ends: 222 [2022-07-23 06:16:47,945 INFO L226 Difference]: Without dead ends: 222 [2022-07-23 06:16:47,945 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-23 06:16:47,946 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 181 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:16:47,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 149 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:16:47,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-07-23 06:16:47,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 202. [2022-07-23 06:16:47,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 134 states have (on average 1.671641791044776) internal successors, (224), 201 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:47,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 224 transitions. [2022-07-23 06:16:47,959 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 224 transitions. Word has length 3 [2022-07-23 06:16:47,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:16:47,960 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 224 transitions. [2022-07-23 06:16:47,960 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-23 06:16:47,960 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 224 transitions. [2022-07-23 06:16:47,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-23 06:16:47,960 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:16:47,961 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-23 06:16:47,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-23 06:16:47,961 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-07-23 06:16:47,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:16:47,962 INFO L85 PathProgramCache]: Analyzing trace with hash 889446311, now seen corresponding path program 1 times [2022-07-23 06:16:47,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:16:47,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068609285] [2022-07-23 06:16:47,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:16:47,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:16:47,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:48,002 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-23 06:16:48,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:16:48,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068609285] [2022-07-23 06:16:48,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068609285] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:16:48,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:16:48,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 06:16:48,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882807106] [2022-07-23 06:16:48,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:16:48,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:16:48,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:16:48,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:16:48,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:16:48,007 INFO L87 Difference]: Start difference. First operand 202 states and 224 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:48,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:16:48,044 INFO L93 Difference]: Finished difference Result 217 states and 227 transitions. [2022-07-23 06:16:48,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:16:48,045 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-23 06:16:48,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:16:48,048 INFO L225 Difference]: With dead ends: 217 [2022-07-23 06:16:48,048 INFO L226 Difference]: Without dead ends: 217 [2022-07-23 06:16:48,048 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-23 06:16:48,051 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 177 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:16:48,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 204 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:16:48,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-07-23 06:16:48,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 200. [2022-07-23 06:16:48,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 133 states have (on average 1.6616541353383458) internal successors, (221), 199 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:48,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 221 transitions. [2022-07-23 06:16:48,075 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 221 transitions. Word has length 6 [2022-07-23 06:16:48,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:16:48,075 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 221 transitions. [2022-07-23 06:16:48,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:48,076 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 221 transitions. [2022-07-23 06:16:48,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-23 06:16:48,077 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:16:48,077 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:16:48,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-23 06:16:48,077 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-07-23 06:16:48,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:16:48,078 INFO L85 PathProgramCache]: Analyzing trace with hash 2020777177, now seen corresponding path program 1 times [2022-07-23 06:16:48,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:16:48,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885282373] [2022-07-23 06:16:48,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:16:48,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:16:48,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:48,163 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-23 06:16:48,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:16:48,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885282373] [2022-07-23 06:16:48,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885282373] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:16:48,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:16:48,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 06:16:48,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405489107] [2022-07-23 06:16:48,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:16:48,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 06:16:48,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:16:48,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 06:16:48,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:16:48,167 INFO L87 Difference]: Start difference. First operand 200 states and 221 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:48,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:16:48,335 INFO L93 Difference]: Finished difference Result 199 states and 220 transitions. [2022-07-23 06:16:48,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:16:48,335 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-23 06:16:48,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:16:48,336 INFO L225 Difference]: With dead ends: 199 [2022-07-23 06:16:48,337 INFO L226 Difference]: Without dead ends: 199 [2022-07-23 06:16:48,337 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-23 06:16:48,338 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 4 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:16:48,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 539 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:16:48,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-07-23 06:16:48,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2022-07-23 06:16:48,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 133 states have (on average 1.6541353383458646) internal successors, (220), 198 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:48,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 220 transitions. [2022-07-23 06:16:48,343 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 220 transitions. Word has length 12 [2022-07-23 06:16:48,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:16:48,344 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 220 transitions. [2022-07-23 06:16:48,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:48,344 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 220 transitions. [2022-07-23 06:16:48,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-23 06:16:48,345 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:16:48,345 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:16:48,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-23 06:16:48,346 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-07-23 06:16:48,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:16:48,346 INFO L85 PathProgramCache]: Analyzing trace with hash 2020777178, now seen corresponding path program 1 times [2022-07-23 06:16:48,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:16:48,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612147482] [2022-07-23 06:16:48,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:16:48,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:16:48,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:48,459 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-23 06:16:48,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:16:48,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612147482] [2022-07-23 06:16:48,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612147482] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:16:48,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:16:48,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 06:16:48,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742958977] [2022-07-23 06:16:48,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:16:48,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 06:16:48,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:16:48,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 06:16:48,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:16:48,469 INFO L87 Difference]: Start difference. First operand 199 states and 220 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:48,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:16:48,655 INFO L93 Difference]: Finished difference Result 198 states and 219 transitions. [2022-07-23 06:16:48,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:16:48,662 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-23 06:16:48,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:16:48,663 INFO L225 Difference]: With dead ends: 198 [2022-07-23 06:16:48,664 INFO L226 Difference]: Without dead ends: 198 [2022-07-23 06:16:48,664 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-23 06:16:48,665 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 2 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:16:48,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 548 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 06:16:48,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-07-23 06:16:48,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2022-07-23 06:16:48,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 133 states have (on average 1.6466165413533835) internal successors, (219), 197 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:48,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 219 transitions. [2022-07-23 06:16:48,670 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 219 transitions. Word has length 12 [2022-07-23 06:16:48,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:16:48,671 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 219 transitions. [2022-07-23 06:16:48,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:48,671 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 219 transitions. [2022-07-23 06:16:48,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-23 06:16:48,672 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:16:48,672 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:16:48,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-23 06:16:48,672 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-07-23 06:16:48,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:16:48,673 INFO L85 PathProgramCache]: Analyzing trace with hash 373192235, now seen corresponding path program 1 times [2022-07-23 06:16:48,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:16:48,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338066728] [2022-07-23 06:16:48,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:16:48,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:16:48,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:48,727 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-23 06:16:48,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:16:48,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338066728] [2022-07-23 06:16:48,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338066728] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:16:48,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:16:48,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 06:16:48,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348713724] [2022-07-23 06:16:48,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:16:48,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:16:48,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:16:48,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:16:48,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:16:48,729 INFO L87 Difference]: Start difference. First operand 198 states and 219 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:48,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:16:48,737 INFO L93 Difference]: Finished difference Result 199 states and 220 transitions. [2022-07-23 06:16:48,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:16:48,738 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-23 06:16:48,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:16:48,739 INFO L225 Difference]: With dead ends: 199 [2022-07-23 06:16:48,739 INFO L226 Difference]: Without dead ends: 199 [2022-07-23 06:16:48,739 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-23 06:16:48,740 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 0 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:16:48,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 368 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:16:48,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-07-23 06:16:48,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2022-07-23 06:16:48,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 134 states have (on average 1.6417910447761195) internal successors, (220), 198 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:48,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 220 transitions. [2022-07-23 06:16:48,745 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 220 transitions. Word has length 14 [2022-07-23 06:16:48,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:16:48,746 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 220 transitions. [2022-07-23 06:16:48,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:48,746 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 220 transitions. [2022-07-23 06:16:48,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-23 06:16:48,747 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:16:48,747 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:16:48,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-23 06:16:48,748 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-07-23 06:16:48,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:16:48,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1583692102, now seen corresponding path program 1 times [2022-07-23 06:16:48,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:16:48,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334661013] [2022-07-23 06:16:48,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:16:48,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:16:48,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:48,883 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-23 06:16:48,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:16:48,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334661013] [2022-07-23 06:16:48,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334661013] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:16:48,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:16:48,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 06:16:48,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979968817] [2022-07-23 06:16:48,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:16:48,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 06:16:48,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:16:48,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 06:16:48,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-23 06:16:48,886 INFO L87 Difference]: Start difference. First operand 199 states and 220 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:49,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:16:49,145 INFO L93 Difference]: Finished difference Result 198 states and 219 transitions. [2022-07-23 06:16:49,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 06:16:49,145 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-23 06:16:49,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:16:49,146 INFO L225 Difference]: With dead ends: 198 [2022-07-23 06:16:49,146 INFO L226 Difference]: Without dead ends: 198 [2022-07-23 06:16:49,147 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-23 06:16:49,147 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 175 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:16:49,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 456 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 06:16:49,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-07-23 06:16:49,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2022-07-23 06:16:49,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 134 states have (on average 1.6343283582089552) internal successors, (219), 197 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:49,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 219 transitions. [2022-07-23 06:16:49,152 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 219 transitions. Word has length 15 [2022-07-23 06:16:49,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:16:49,152 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 219 transitions. [2022-07-23 06:16:49,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:49,152 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 219 transitions. [2022-07-23 06:16:49,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-23 06:16:49,153 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:16:49,153 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:16:49,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-23 06:16:49,153 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-07-23 06:16:49,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:16:49,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1583692101, now seen corresponding path program 1 times [2022-07-23 06:16:49,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:16:49,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115551305] [2022-07-23 06:16:49,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:16:49,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:16:49,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:49,267 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-23 06:16:49,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:16:49,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115551305] [2022-07-23 06:16:49,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115551305] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:16:49,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:16:49,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 06:16:49,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455113265] [2022-07-23 06:16:49,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:16:49,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 06:16:49,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:16:49,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 06:16:49,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-23 06:16:49,270 INFO L87 Difference]: Start difference. First operand 198 states and 219 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:49,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:16:49,623 INFO L93 Difference]: Finished difference Result 197 states and 218 transitions. [2022-07-23 06:16:49,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 06:16:49,623 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-23 06:16:49,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:16:49,624 INFO L225 Difference]: With dead ends: 197 [2022-07-23 06:16:49,624 INFO L226 Difference]: Without dead ends: 197 [2022-07-23 06:16:49,624 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-23 06:16:49,625 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 169 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:16:49,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 577 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 06:16:49,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-07-23 06:16:49,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2022-07-23 06:16:49,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 134 states have (on average 1.626865671641791) internal successors, (218), 196 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:49,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 218 transitions. [2022-07-23 06:16:49,628 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 218 transitions. Word has length 15 [2022-07-23 06:16:49,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:16:49,629 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 218 transitions. [2022-07-23 06:16:49,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:49,629 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 218 transitions. [2022-07-23 06:16:49,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-23 06:16:49,629 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:16:49,629 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:16:49,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-23 06:16:49,630 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-07-23 06:16:49,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:16:49,630 INFO L85 PathProgramCache]: Analyzing trace with hash -2137878992, now seen corresponding path program 1 times [2022-07-23 06:16:49,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:16:49,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469866650] [2022-07-23 06:16:49,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:16:49,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:16:49,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:49,706 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-23 06:16:49,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:16:49,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469866650] [2022-07-23 06:16:49,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469866650] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:16:49,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:16:49,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 06:16:49,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864006614] [2022-07-23 06:16:49,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:16:49,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 06:16:49,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:16:49,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 06:16:49,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:16:49,708 INFO L87 Difference]: Start difference. First operand 197 states and 218 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:49,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:16:49,905 INFO L93 Difference]: Finished difference Result 289 states and 316 transitions. [2022-07-23 06:16:49,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 06:16:49,906 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-23 06:16:49,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:16:49,907 INFO L225 Difference]: With dead ends: 289 [2022-07-23 06:16:49,907 INFO L226 Difference]: Without dead ends: 289 [2022-07-23 06:16:49,907 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-23 06:16:49,908 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 199 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:16:49,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 651 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:16:49,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-07-23 06:16:49,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 194. [2022-07-23 06:16:49,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 132 states have (on average 1.628787878787879) internal successors, (215), 193 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:49,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 215 transitions. [2022-07-23 06:16:49,913 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 215 transitions. Word has length 16 [2022-07-23 06:16:49,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:16:49,913 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 215 transitions. [2022-07-23 06:16:49,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:49,914 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 215 transitions. [2022-07-23 06:16:49,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-23 06:16:49,914 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:16:49,914 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:16:49,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-23 06:16:49,915 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-07-23 06:16:49,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:16:49,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1339025717, now seen corresponding path program 1 times [2022-07-23 06:16:49,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:16:49,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076694743] [2022-07-23 06:16:49,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:16:49,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:16:49,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:49,981 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-23 06:16:49,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:16:49,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076694743] [2022-07-23 06:16:49,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076694743] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:16:49,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:16:49,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:16:49,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074320142] [2022-07-23 06:16:49,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:16:49,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 06:16:49,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:16:49,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 06:16:49,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:16:49,983 INFO L87 Difference]: Start difference. First operand 194 states and 215 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:50,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:16:50,108 INFO L93 Difference]: Finished difference Result 290 states and 316 transitions. [2022-07-23 06:16:50,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 06:16:50,109 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-23 06:16:50,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:16:50,110 INFO L225 Difference]: With dead ends: 290 [2022-07-23 06:16:50,110 INFO L226 Difference]: Without dead ends: 290 [2022-07-23 06:16:50,110 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-23 06:16:50,111 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 102 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:16:50,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 614 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:16:50,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-07-23 06:16:50,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 197. [2022-07-23 06:16:50,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 135 states have (on average 1.614814814814815) internal successors, (218), 196 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:50,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 218 transitions. [2022-07-23 06:16:50,115 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 218 transitions. Word has length 18 [2022-07-23 06:16:50,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:16:50,115 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 218 transitions. [2022-07-23 06:16:50,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:50,115 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 218 transitions. [2022-07-23 06:16:50,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-23 06:16:50,116 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:16:50,116 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] [2022-07-23 06:16:50,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-23 06:16:50,116 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-07-23 06:16:50,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:16:50,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1029802310, now seen corresponding path program 1 times [2022-07-23 06:16:50,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:16:50,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353048414] [2022-07-23 06:16:50,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:16:50,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:16:50,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:50,155 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-23 06:16:50,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:16:50,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353048414] [2022-07-23 06:16:50,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353048414] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:16:50,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:16:50,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 06:16:50,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49865482] [2022-07-23 06:16:50,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:16:50,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 06:16:50,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:16:50,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 06:16:50,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 06:16:50,157 INFO L87 Difference]: Start difference. First operand 197 states and 218 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:50,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:16:50,286 INFO L93 Difference]: Finished difference Result 191 states and 211 transitions. [2022-07-23 06:16:50,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 06:16:50,286 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-23 06:16:50,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:16:50,287 INFO L225 Difference]: With dead ends: 191 [2022-07-23 06:16:50,288 INFO L226 Difference]: Without dead ends: 191 [2022-07-23 06:16:50,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:16:50,289 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 257 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:16:50,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 118 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:16:50,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-07-23 06:16:50,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 187. [2022-07-23 06:16:50,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 137 states have (on average 1.5182481751824817) internal successors, (208), 186 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:50,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 208 transitions. [2022-07-23 06:16:50,301 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 208 transitions. Word has length 20 [2022-07-23 06:16:50,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:16:50,302 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 208 transitions. [2022-07-23 06:16:50,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:50,302 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 208 transitions. [2022-07-23 06:16:50,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-23 06:16:50,304 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:16:50,304 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] [2022-07-23 06:16:50,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-23 06:16:50,305 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-07-23 06:16:50,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:16:50,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1029802309, now seen corresponding path program 1 times [2022-07-23 06:16:50,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:16:50,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34251902] [2022-07-23 06:16:50,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:16:50,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:16:50,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:50,391 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-23 06:16:50,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:16:50,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34251902] [2022-07-23 06:16:50,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34251902] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:16:50,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:16:50,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:16:50,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048627057] [2022-07-23 06:16:50,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:16:50,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:16:50,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:16:50,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:16:50,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:16:50,393 INFO L87 Difference]: Start difference. First operand 187 states and 208 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:50,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:16:50,640 INFO L93 Difference]: Finished difference Result 248 states and 262 transitions. [2022-07-23 06:16:50,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 06:16:50,640 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-23 06:16:50,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:16:50,641 INFO L225 Difference]: With dead ends: 248 [2022-07-23 06:16:50,641 INFO L226 Difference]: Without dead ends: 248 [2022-07-23 06:16:50,642 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-23 06:16:50,642 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 449 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:16:50,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 255 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 06:16:50,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-07-23 06:16:50,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 211. [2022-07-23 06:16:50,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 161 states have (on average 1.5279503105590062) internal successors, (246), 210 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:50,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 246 transitions. [2022-07-23 06:16:50,647 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 246 transitions. Word has length 20 [2022-07-23 06:16:50,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:16:50,647 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 246 transitions. [2022-07-23 06:16:50,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:50,648 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 246 transitions. [2022-07-23 06:16:50,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-23 06:16:50,648 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:16:50,648 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] [2022-07-23 06:16:50,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-23 06:16:50,648 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-07-23 06:16:50,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:16:50,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1797484881, now seen corresponding path program 1 times [2022-07-23 06:16:50,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:16:50,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344528441] [2022-07-23 06:16:50,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:16:50,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:16:50,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:50,679 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-23 06:16:50,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:16:50,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344528441] [2022-07-23 06:16:50,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344528441] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:16:50,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:16:50,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 06:16:50,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20230619] [2022-07-23 06:16:50,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:16:50,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 06:16:50,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:16:50,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 06:16:50,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 06:16:50,681 INFO L87 Difference]: Start difference. First operand 211 states and 246 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:50,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:16:50,778 INFO L93 Difference]: Finished difference Result 243 states and 256 transitions. [2022-07-23 06:16:50,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 06:16:50,779 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-23 06:16:50,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:16:50,780 INFO L225 Difference]: With dead ends: 243 [2022-07-23 06:16:50,780 INFO L226 Difference]: Without dead ends: 243 [2022-07-23 06:16:50,780 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-23 06:16:50,781 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 234 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:16:50,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 273 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:16:50,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-07-23 06:16:50,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 209. [2022-07-23 06:16:50,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 160 states have (on average 1.51875) internal successors, (243), 208 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:50,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 243 transitions. [2022-07-23 06:16:50,786 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 243 transitions. Word has length 22 [2022-07-23 06:16:50,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:16:50,786 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 243 transitions. [2022-07-23 06:16:50,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:50,787 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 243 transitions. [2022-07-23 06:16:50,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-23 06:16:50,787 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:16:50,787 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-23 06:16:50,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-23 06:16:50,788 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-07-23 06:16:50,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:16:50,788 INFO L85 PathProgramCache]: Analyzing trace with hash 110847663, now seen corresponding path program 1 times [2022-07-23 06:16:50,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:16:50,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321042564] [2022-07-23 06:16:50,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:16:50,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:16:50,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:50,824 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-23 06:16:50,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:16:50,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321042564] [2022-07-23 06:16:50,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321042564] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:16:50,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:16:50,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 06:16:50,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725372927] [2022-07-23 06:16:50,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:16:50,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 06:16:50,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:16:50,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 06:16:50,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:16:50,826 INFO L87 Difference]: Start difference. First operand 209 states and 243 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:50,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:16:50,955 INFO L93 Difference]: Finished difference Result 208 states and 241 transitions. [2022-07-23 06:16:50,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 06:16:50,956 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-23 06:16:50,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:16:50,956 INFO L225 Difference]: With dead ends: 208 [2022-07-23 06:16:50,957 INFO L226 Difference]: Without dead ends: 208 [2022-07-23 06:16:50,957 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-23 06:16:50,957 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 9 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:16:50,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 469 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:16:50,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-07-23 06:16:50,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2022-07-23 06:16:50,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 160 states have (on average 1.50625) internal successors, (241), 207 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:50,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 241 transitions. [2022-07-23 06:16:50,962 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 241 transitions. Word has length 23 [2022-07-23 06:16:50,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:16:50,962 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 241 transitions. [2022-07-23 06:16:50,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:50,963 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 241 transitions. [2022-07-23 06:16:50,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-23 06:16:50,963 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:16:50,963 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-23 06:16:50,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-23 06:16:50,963 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-07-23 06:16:50,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:16:50,964 INFO L85 PathProgramCache]: Analyzing trace with hash 110847664, now seen corresponding path program 1 times [2022-07-23 06:16:50,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:16:50,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127131721] [2022-07-23 06:16:50,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:16:50,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:16:50,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:51,012 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-23 06:16:51,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:16:51,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127131721] [2022-07-23 06:16:51,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127131721] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:16:51,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:16:51,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 06:16:51,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870165523] [2022-07-23 06:16:51,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:16:51,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 06:16:51,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:16:51,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 06:16:51,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:16:51,014 INFO L87 Difference]: Start difference. First operand 208 states and 241 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:51,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:16:51,180 INFO L93 Difference]: Finished difference Result 207 states and 239 transitions. [2022-07-23 06:16:51,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:16:51,181 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-23 06:16:51,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:16:51,182 INFO L225 Difference]: With dead ends: 207 [2022-07-23 06:16:51,182 INFO L226 Difference]: Without dead ends: 207 [2022-07-23 06:16:51,182 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-23 06:16:51,182 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 4 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:16:51,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 458 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:16:51,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-07-23 06:16:51,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2022-07-23 06:16:51,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 160 states have (on average 1.49375) internal successors, (239), 206 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:51,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 239 transitions. [2022-07-23 06:16:51,186 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 239 transitions. Word has length 23 [2022-07-23 06:16:51,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:16:51,187 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 239 transitions. [2022-07-23 06:16:51,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:51,187 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 239 transitions. [2022-07-23 06:16:51,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-23 06:16:51,194 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:16:51,194 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-23 06:16:51,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-23 06:16:51,194 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-07-23 06:16:51,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:16:51,195 INFO L85 PathProgramCache]: Analyzing trace with hash -398547279, now seen corresponding path program 1 times [2022-07-23 06:16:51,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:16:51,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187065794] [2022-07-23 06:16:51,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:16:51,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:16:51,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:51,322 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-23 06:16:51,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:16:51,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187065794] [2022-07-23 06:16:51,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187065794] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:16:51,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:16:51,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 06:16:51,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156422035] [2022-07-23 06:16:51,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:16:51,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 06:16:51,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:16:51,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 06:16:51,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-23 06:16:51,326 INFO L87 Difference]: Start difference. First operand 207 states and 239 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:51,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:16:51,634 INFO L93 Difference]: Finished difference Result 206 states and 238 transitions. [2022-07-23 06:16:51,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 06:16:51,635 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-23 06:16:51,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:16:51,636 INFO L225 Difference]: With dead ends: 206 [2022-07-23 06:16:51,636 INFO L226 Difference]: Without dead ends: 206 [2022-07-23 06:16:51,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-07-23 06:16:51,637 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 250 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:16:51,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 434 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 06:16:51,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-07-23 06:16:51,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2022-07-23 06:16:51,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 160 states have (on average 1.4875) internal successors, (238), 205 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:51,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 238 transitions. [2022-07-23 06:16:51,641 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 238 transitions. Word has length 27 [2022-07-23 06:16:51,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:16:51,641 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 238 transitions. [2022-07-23 06:16:51,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:51,642 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 238 transitions. [2022-07-23 06:16:51,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-23 06:16:51,642 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:16:51,642 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-23 06:16:51,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-23 06:16:51,643 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-07-23 06:16:51,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:16:51,643 INFO L85 PathProgramCache]: Analyzing trace with hash -398547278, now seen corresponding path program 1 times [2022-07-23 06:16:51,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:16:51,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877025259] [2022-07-23 06:16:51,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:16:51,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:16:51,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:51,757 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-23 06:16:51,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:16:51,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877025259] [2022-07-23 06:16:51,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877025259] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:16:51,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:16:51,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-23 06:16:51,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326559552] [2022-07-23 06:16:51,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:16:51,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-23 06:16:51,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:16:51,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-23 06:16:51,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-23 06:16:51,759 INFO L87 Difference]: Start difference. First operand 206 states and 238 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:52,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:16:52,229 INFO L93 Difference]: Finished difference Result 198 states and 230 transitions. [2022-07-23 06:16:52,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-23 06:16:52,229 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-23 06:16:52,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:16:52,230 INFO L225 Difference]: With dead ends: 198 [2022-07-23 06:16:52,230 INFO L226 Difference]: Without dead ends: 198 [2022-07-23 06:16:52,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2022-07-23 06:16:52,231 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 265 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:16:52,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 413 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 06:16:52,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-07-23 06:16:52,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 188. [2022-07-23 06:16:52,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 152 states have (on average 1.4407894736842106) internal successors, (219), 187 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:52,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 219 transitions. [2022-07-23 06:16:52,235 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 219 transitions. Word has length 27 [2022-07-23 06:16:52,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:16:52,236 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 219 transitions. [2022-07-23 06:16:52,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:52,236 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 219 transitions. [2022-07-23 06:16:52,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-23 06:16:52,237 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:16:52,237 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-23 06:16:52,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-23 06:16:52,237 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-07-23 06:16:52,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:16:52,238 INFO L85 PathProgramCache]: Analyzing trace with hash 329779259, now seen corresponding path program 1 times [2022-07-23 06:16:52,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:16:52,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050384848] [2022-07-23 06:16:52,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:16:52,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:16:52,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:52,273 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-23 06:16:52,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:16:52,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050384848] [2022-07-23 06:16:52,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050384848] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:16:52,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:16:52,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 06:16:52,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771821933] [2022-07-23 06:16:52,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:16:52,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:16:52,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:16:52,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:16:52,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:16:52,276 INFO L87 Difference]: Start difference. First operand 188 states and 219 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:52,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:16:52,284 INFO L93 Difference]: Finished difference Result 262 states and 307 transitions. [2022-07-23 06:16:52,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:16:52,285 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-23 06:16:52,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:16:52,286 INFO L225 Difference]: With dead ends: 262 [2022-07-23 06:16:52,286 INFO L226 Difference]: Without dead ends: 262 [2022-07-23 06:16:52,286 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-23 06:16:52,287 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 52 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:16:52,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 303 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:16:52,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-07-23 06:16:52,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 194. [2022-07-23 06:16:52,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 158 states have (on average 1.4367088607594938) internal successors, (227), 193 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:52,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 227 transitions. [2022-07-23 06:16:52,292 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 227 transitions. Word has length 28 [2022-07-23 06:16:52,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:16:52,293 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 227 transitions. [2022-07-23 06:16:52,293 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-23 06:16:52,293 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 227 transitions. [2022-07-23 06:16:52,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-23 06:16:52,293 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:16:52,294 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-23 06:16:52,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-23 06:16:52,294 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-07-23 06:16:52,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:16:52,295 INFO L85 PathProgramCache]: Analyzing trace with hash -751842895, now seen corresponding path program 1 times [2022-07-23 06:16:52,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:16:52,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2847990] [2022-07-23 06:16:52,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:16:52,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:16:52,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:52,344 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-23 06:16:52,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:16:52,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2847990] [2022-07-23 06:16:52,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2847990] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:16:52,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:16:52,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:16:52,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141558040] [2022-07-23 06:16:52,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:16:52,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:16:52,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:16:52,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:16:52,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:16:52,347 INFO L87 Difference]: Start difference. First operand 194 states and 227 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:52,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:16:52,469 INFO L93 Difference]: Finished difference Result 199 states and 233 transitions. [2022-07-23 06:16:52,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 06:16:52,469 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-23 06:16:52,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:16:52,470 INFO L225 Difference]: With dead ends: 199 [2022-07-23 06:16:52,471 INFO L226 Difference]: Without dead ends: 199 [2022-07-23 06:16:52,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-07-23 06:16:52,471 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 357 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:16:52,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 232 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:16:52,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-07-23 06:16:52,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 190. [2022-07-23 06:16:52,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 156 states have (on average 1.4294871794871795) internal successors, (223), 189 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:52,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 223 transitions. [2022-07-23 06:16:52,475 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 223 transitions. Word has length 29 [2022-07-23 06:16:52,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:16:52,475 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 223 transitions. [2022-07-23 06:16:52,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:52,475 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 223 transitions. [2022-07-23 06:16:52,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-23 06:16:52,476 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:16:52,476 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-23 06:16:52,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-23 06:16:52,476 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-07-23 06:16:52,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:16:52,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1633211075, now seen corresponding path program 1 times [2022-07-23 06:16:52,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:16:52,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423064714] [2022-07-23 06:16:52,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:16:52,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:16:52,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:52,515 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-23 06:16:52,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:16:52,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423064714] [2022-07-23 06:16:52,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423064714] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:16:52,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:16:52,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 06:16:52,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224887667] [2022-07-23 06:16:52,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:16:52,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:16:52,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:16:52,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:16:52,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:16:52,517 INFO L87 Difference]: Start difference. First operand 190 states and 223 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:52,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:16:52,531 INFO L93 Difference]: Finished difference Result 188 states and 220 transitions. [2022-07-23 06:16:52,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:16:52,531 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-23 06:16:52,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:16:52,532 INFO L225 Difference]: With dead ends: 188 [2022-07-23 06:16:52,532 INFO L226 Difference]: Without dead ends: 188 [2022-07-23 06:16:52,532 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-23 06:16:52,533 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 20 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:16:52,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 266 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:16:52,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-07-23 06:16:52,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2022-07-23 06:16:52,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 155 states have (on average 1.4193548387096775) internal successors, (220), 187 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:52,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 220 transitions. [2022-07-23 06:16:52,538 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 220 transitions. Word has length 29 [2022-07-23 06:16:52,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:16:52,538 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 220 transitions. [2022-07-23 06:16:52,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:52,538 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 220 transitions. [2022-07-23 06:16:52,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-23 06:16:52,539 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:16:52,539 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] [2022-07-23 06:16:52,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-23 06:16:52,539 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-07-23 06:16:52,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:16:52,540 INFO L85 PathProgramCache]: Analyzing trace with hash -910059888, now seen corresponding path program 1 times [2022-07-23 06:16:52,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:16:52,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429093635] [2022-07-23 06:16:52,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:16:52,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:16:52,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:52,681 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-23 06:16:52,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:16:52,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429093635] [2022-07-23 06:16:52,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429093635] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:16:52,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:16:52,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-23 06:16:52,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701922412] [2022-07-23 06:16:52,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:16:52,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 06:16:52,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:16:52,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 06:16:52,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-23 06:16:52,683 INFO L87 Difference]: Start difference. First operand 188 states and 220 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:53,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:16:53,036 INFO L93 Difference]: Finished difference Result 291 states and 320 transitions. [2022-07-23 06:16:53,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-23 06:16:53,037 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-07-23 06:16:53,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:16:53,038 INFO L225 Difference]: With dead ends: 291 [2022-07-23 06:16:53,038 INFO L226 Difference]: Without dead ends: 291 [2022-07-23 06:16:53,038 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-23 06:16:53,039 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 452 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:16:53,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 710 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 06:16:53,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2022-07-23 06:16:53,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 200. [2022-07-23 06:16:53,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 167 states have (on average 1.3952095808383234) internal successors, (233), 199 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:53,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 233 transitions. [2022-07-23 06:16:53,044 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 233 transitions. Word has length 30 [2022-07-23 06:16:53,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:16:53,044 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 233 transitions. [2022-07-23 06:16:53,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:16:53,044 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 233 transitions. [2022-07-23 06:16:53,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-23 06:16:53,045 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:16:53,045 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] [2022-07-23 06:16:53,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-23 06:16:53,045 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-07-23 06:16:53,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:16:53,045 INFO L85 PathProgramCache]: Analyzing trace with hash 2071508259, now seen corresponding path program 1 times [2022-07-23 06:16:53,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:16:53,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100280544] [2022-07-23 06:16:53,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:16:53,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:16:53,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:53,105 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-23 06:16:53,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:16:53,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100280544] [2022-07-23 06:16:53,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100280544] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:16:53,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845007037] [2022-07-23 06:16:53,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:16:53,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:16:53,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:16:53,111 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-23 06:16:53,137 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-23 06:16:53,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:16:53,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-23 06:16:53,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:16:53,335 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-23 06:16:53,351 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-23 06:16:53,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:53,384 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-23 06:16:53,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:53,395 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-23 06:16:53,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:53,439 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-23 06:16:53,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:16:53,446 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-23 06:16:53,596 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:16:53,597 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-23 06:16:53,602 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:16:53,604 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:16:53,605 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-23 06:16:53,613 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-23 06:16:53,614 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:17:00,329 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 20 treesize of output 18 [2022-07-23 06:17:00,334 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:17:00,334 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:17:00,337 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-23 06:17:00,345 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 20 treesize of output 18 [2022-07-23 06:17:00,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:17:00,349 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:17:00,349 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:17:00,362 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-23 06:17:00,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845007037] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:17:00,363 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:17:00,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 9] total 14 [2022-07-23 06:17:00,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725060721] [2022-07-23 06:17:00,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:17:00,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-23 06:17:00,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:17:00,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-23 06:17:00,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=141, Unknown=5, NotChecked=0, Total=182 [2022-07-23 06:17:00,365 INFO L87 Difference]: Start difference. First operand 200 states and 233 transitions. Second operand has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:00,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:17:00,694 INFO L93 Difference]: Finished difference Result 294 states and 323 transitions. [2022-07-23 06:17:00,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 06:17:00,695 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-23 06:17:00,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:17:00,696 INFO L225 Difference]: With dead ends: 294 [2022-07-23 06:17:00,696 INFO L226 Difference]: Without dead ends: 294 [2022-07-23 06:17:00,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=86, Invalid=251, Unknown=5, NotChecked=0, Total=342 [2022-07-23 06:17:00,697 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 511 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:17:00,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 833 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 351 Invalid, 0 Unknown, 122 Unchecked, 0.2s Time] [2022-07-23 06:17:00,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-07-23 06:17:00,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 228. [2022-07-23 06:17:00,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 195 states have (on average 1.405128205128205) internal successors, (274), 227 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:00,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 274 transitions. [2022-07-23 06:17:00,703 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 274 transitions. Word has length 32 [2022-07-23 06:17:00,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:17:00,703 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 274 transitions. [2022-07-23 06:17:00,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:00,704 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 274 transitions. [2022-07-23 06:17:00,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-23 06:17:00,704 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:17:00,705 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-23 06:17:00,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-23 06:17:00,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-07-23 06:17:00,906 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-07-23 06:17:00,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:17:00,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1393921825, now seen corresponding path program 1 times [2022-07-23 06:17:00,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:17:00,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233940179] [2022-07-23 06:17:00,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:17:00,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:17:00,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:17:01,061 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-23 06:17:01,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:17:01,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233940179] [2022-07-23 06:17:01,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233940179] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:17:01,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:17:01,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-23 06:17:01,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146088038] [2022-07-23 06:17:01,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:17:01,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-23 06:17:01,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:17:01,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-23 06:17:01,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-23 06:17:01,063 INFO L87 Difference]: Start difference. First operand 228 states and 274 transitions. Second operand has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:01,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:17:01,588 INFO L93 Difference]: Finished difference Result 334 states and 372 transitions. [2022-07-23 06:17:01,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-23 06:17:01,589 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-07-23 06:17:01,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:17:01,590 INFO L225 Difference]: With dead ends: 334 [2022-07-23 06:17:01,590 INFO L226 Difference]: Without dead ends: 334 [2022-07-23 06:17:01,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2022-07-23 06:17:01,591 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 499 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 06:17:01,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 838 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-23 06:17:01,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2022-07-23 06:17:01,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 229. [2022-07-23 06:17:01,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 198 states have (on average 1.3737373737373737) internal successors, (272), 228 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:01,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 272 transitions. [2022-07-23 06:17:01,596 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 272 transitions. Word has length 35 [2022-07-23 06:17:01,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:17:01,596 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 272 transitions. [2022-07-23 06:17:01,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:01,596 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 272 transitions. [2022-07-23 06:17:01,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-23 06:17:01,596 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:17:01,596 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-23 06:17:01,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-23 06:17:01,597 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-07-23 06:17:01,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:17:01,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1393921826, now seen corresponding path program 1 times [2022-07-23 06:17:01,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:17:01,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742858347] [2022-07-23 06:17:01,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:17:01,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:17:01,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:17:01,817 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-23 06:17:01,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:17:01,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742858347] [2022-07-23 06:17:01,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742858347] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:17:01,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:17:01,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-23 06:17:01,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513211388] [2022-07-23 06:17:01,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:17:01,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-23 06:17:01,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:17:01,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-23 06:17:01,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-07-23 06:17:01,819 INFO L87 Difference]: Start difference. First operand 229 states and 272 transitions. Second operand has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:02,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:17:02,590 INFO L93 Difference]: Finished difference Result 408 states and 438 transitions. [2022-07-23 06:17:02,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-23 06:17:02,590 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-07-23 06:17:02,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:17:02,592 INFO L225 Difference]: With dead ends: 408 [2022-07-23 06:17:02,592 INFO L226 Difference]: Without dead ends: 408 [2022-07-23 06:17:02,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2022-07-23 06:17:02,593 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 742 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 742 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-23 06:17:02,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [742 Valid, 928 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-23 06:17:02,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2022-07-23 06:17:02,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 235. [2022-07-23 06:17:02,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 204 states have (on average 1.3676470588235294) internal successors, (279), 234 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:02,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 279 transitions. [2022-07-23 06:17:02,599 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 279 transitions. Word has length 35 [2022-07-23 06:17:02,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:17:02,599 INFO L495 AbstractCegarLoop]: Abstraction has 235 states and 279 transitions. [2022-07-23 06:17:02,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:02,599 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 279 transitions. [2022-07-23 06:17:02,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-23 06:17:02,600 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:17:02,600 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-23 06:17:02,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-23 06:17:02,600 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-07-23 06:17:02,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:17:02,601 INFO L85 PathProgramCache]: Analyzing trace with hash -470914463, now seen corresponding path program 1 times [2022-07-23 06:17:02,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:17:02,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272873341] [2022-07-23 06:17:02,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:17:02,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:17:02,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:17:02,894 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-23 06:17:02,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:17:02,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272873341] [2022-07-23 06:17:02,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272873341] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:17:02,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:17:02,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-23 06:17:02,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059154448] [2022-07-23 06:17:02,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:17:02,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-23 06:17:02,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:17:02,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-23 06:17:02,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-07-23 06:17:02,896 INFO L87 Difference]: Start difference. First operand 235 states and 279 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:03,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:17:03,919 INFO L93 Difference]: Finished difference Result 338 states and 368 transitions. [2022-07-23 06:17:03,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-23 06:17:03,920 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-07-23 06:17:03,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:17:03,922 INFO L225 Difference]: With dead ends: 338 [2022-07-23 06:17:03,922 INFO L226 Difference]: Without dead ends: 338 [2022-07-23 06:17:03,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=259, Invalid=1001, Unknown=0, NotChecked=0, Total=1260 [2022-07-23 06:17:03,924 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 791 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-23 06:17:03,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [791 Valid, 992 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-23 06:17:03,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2022-07-23 06:17:03,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 235. [2022-07-23 06:17:03,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 204 states have (on average 1.3627450980392157) internal successors, (278), 234 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:03,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 278 transitions. [2022-07-23 06:17:03,931 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 278 transitions. Word has length 37 [2022-07-23 06:17:03,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:17:03,931 INFO L495 AbstractCegarLoop]: Abstraction has 235 states and 278 transitions. [2022-07-23 06:17:03,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:03,932 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 278 transitions. [2022-07-23 06:17:03,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-23 06:17:03,932 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:17:03,932 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-23 06:17:03,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-23 06:17:03,933 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-07-23 06:17:03,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:17:03,933 INFO L85 PathProgramCache]: Analyzing trace with hash -2012362969, now seen corresponding path program 1 times [2022-07-23 06:17:03,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:17:03,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142505666] [2022-07-23 06:17:03,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:17:03,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:17:03,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:17:03,972 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-23 06:17:03,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:17:03,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142505666] [2022-07-23 06:17:03,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142505666] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:17:03,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:17:03,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 06:17:03,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104605813] [2022-07-23 06:17:03,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:17:03,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 06:17:03,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:17:03,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 06:17:03,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:17:03,975 INFO L87 Difference]: Start difference. First operand 235 states and 278 transitions. Second operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:04,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:17:04,090 INFO L93 Difference]: Finished difference Result 234 states and 277 transitions. [2022-07-23 06:17:04,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:17:04,090 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-07-23 06:17:04,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:17:04,091 INFO L225 Difference]: With dead ends: 234 [2022-07-23 06:17:04,091 INFO L226 Difference]: Without dead ends: 234 [2022-07-23 06:17:04,092 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-23 06:17:04,092 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 4 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:17:04,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 418 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:17:04,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2022-07-23 06:17:04,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2022-07-23 06:17:04,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 204 states have (on average 1.357843137254902) internal successors, (277), 233 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:04,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 277 transitions. [2022-07-23 06:17:04,106 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 277 transitions. Word has length 37 [2022-07-23 06:17:04,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:17:04,107 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 277 transitions. [2022-07-23 06:17:04,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:04,107 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 277 transitions. [2022-07-23 06:17:04,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-23 06:17:04,107 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:17:04,108 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-23 06:17:04,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-23 06:17:04,108 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-07-23 06:17:04,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:17:04,109 INFO L85 PathProgramCache]: Analyzing trace with hash -2012362968, now seen corresponding path program 1 times [2022-07-23 06:17:04,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:17:04,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255487074] [2022-07-23 06:17:04,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:17:04,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:17:04,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:17:04,171 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-23 06:17:04,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:17:04,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255487074] [2022-07-23 06:17:04,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255487074] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:17:04,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:17:04,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 06:17:04,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834176966] [2022-07-23 06:17:04,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:17:04,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 06:17:04,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:17:04,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 06:17:04,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:17:04,174 INFO L87 Difference]: Start difference. First operand 234 states and 277 transitions. Second operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:04,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:17:04,307 INFO L93 Difference]: Finished difference Result 233 states and 276 transitions. [2022-07-23 06:17:04,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:17:04,307 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-07-23 06:17:04,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:17:04,308 INFO L225 Difference]: With dead ends: 233 [2022-07-23 06:17:04,309 INFO L226 Difference]: Without dead ends: 233 [2022-07-23 06:17:04,309 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-23 06:17:04,309 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 2 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:17:04,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 412 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:17:04,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-07-23 06:17:04,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2022-07-23 06:17:04,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 204 states have (on average 1.3529411764705883) internal successors, (276), 232 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:04,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 276 transitions. [2022-07-23 06:17:04,314 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 276 transitions. Word has length 37 [2022-07-23 06:17:04,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:17:04,314 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 276 transitions. [2022-07-23 06:17:04,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:04,314 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 276 transitions. [2022-07-23 06:17:04,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-23 06:17:04,314 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:17:04,314 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-23 06:17:04,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-23 06:17:04,315 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-07-23 06:17:04,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:17:04,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1939172976, now seen corresponding path program 1 times [2022-07-23 06:17:04,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:17:04,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799627733] [2022-07-23 06:17:04,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:17:04,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:17:04,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:17:04,392 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-23 06:17:04,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:17:04,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799627733] [2022-07-23 06:17:04,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799627733] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:17:04,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:17:04,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 06:17:04,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936934890] [2022-07-23 06:17:04,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:17:04,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 06:17:04,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:17:04,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 06:17:04,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:17:04,394 INFO L87 Difference]: Start difference. First operand 233 states and 276 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:04,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:17:04,586 INFO L93 Difference]: Finished difference Result 256 states and 299 transitions. [2022-07-23 06:17:04,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 06:17:04,586 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-23 06:17:04,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:17:04,587 INFO L225 Difference]: With dead ends: 256 [2022-07-23 06:17:04,587 INFO L226 Difference]: Without dead ends: 256 [2022-07-23 06:17:04,587 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-23 06:17:04,588 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 52 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:17:04,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 628 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 06:17:04,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-07-23 06:17:04,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 242. [2022-07-23 06:17:04,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 213 states have (on average 1.3380281690140845) internal successors, (285), 241 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:04,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 285 transitions. [2022-07-23 06:17:04,593 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 285 transitions. Word has length 37 [2022-07-23 06:17:04,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:17:04,593 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 285 transitions. [2022-07-23 06:17:04,593 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-23 06:17:04,593 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 285 transitions. [2022-07-23 06:17:04,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-23 06:17:04,594 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:17:04,594 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-23 06:17:04,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-23 06:17:04,594 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-07-23 06:17:04,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:17:04,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1413983143, now seen corresponding path program 1 times [2022-07-23 06:17:04,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:17:04,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884301861] [2022-07-23 06:17:04,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:17:04,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:17:04,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:17:04,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-23 06:17:04,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:17:04,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884301861] [2022-07-23 06:17:04,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884301861] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:17:04,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:17:04,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 06:17:04,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094494347] [2022-07-23 06:17:04,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:17:04,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:17:04,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:17:04,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:17:04,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:17:04,653 INFO L87 Difference]: Start difference. First operand 242 states and 285 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:04,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:17:04,661 INFO L93 Difference]: Finished difference Result 243 states and 286 transitions. [2022-07-23 06:17:04,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:17:04,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-07-23 06:17:04,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:17:04,662 INFO L225 Difference]: With dead ends: 243 [2022-07-23 06:17:04,663 INFO L226 Difference]: Without dead ends: 243 [2022-07-23 06:17:04,663 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-23 06:17:04,667 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-23 06:17:04,667 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-23 06:17:04,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-07-23 06:17:04,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2022-07-23 06:17:04,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 214 states have (on average 1.3364485981308412) internal successors, (286), 242 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:04,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 286 transitions. [2022-07-23 06:17:04,672 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 286 transitions. Word has length 39 [2022-07-23 06:17:04,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:17:04,673 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 286 transitions. [2022-07-23 06:17:04,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:04,673 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 286 transitions. [2022-07-23 06:17:04,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-23 06:17:04,673 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:17:04,674 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-23 06:17:04,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-23 06:17:04,674 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-07-23 06:17:04,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:17:04,675 INFO L85 PathProgramCache]: Analyzing trace with hash -404838824, now seen corresponding path program 1 times [2022-07-23 06:17:04,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:17:04,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391269625] [2022-07-23 06:17:04,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:17:04,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:17:04,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:17:04,709 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-23 06:17:04,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:17:04,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391269625] [2022-07-23 06:17:04,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391269625] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:17:04,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:17:04,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:17:04,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264291506] [2022-07-23 06:17:04,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:17:04,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:17:04,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:17:04,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:17:04,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:17:04,711 INFO L87 Difference]: Start difference. First operand 243 states and 286 transitions. Second operand has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:04,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:17:04,754 INFO L93 Difference]: Finished difference Result 256 states and 290 transitions. [2022-07-23 06:17:04,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:17:04,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-07-23 06:17:04,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:17:04,756 INFO L225 Difference]: With dead ends: 256 [2022-07-23 06:17:04,756 INFO L226 Difference]: Without dead ends: 256 [2022-07-23 06:17:04,756 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-23 06:17:04,757 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 99 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:17:04,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 152 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:17:04,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-07-23 06:17:04,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 244. [2022-07-23 06:17:04,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 215 states have (on average 1.3348837209302327) internal successors, (287), 243 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:04,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 287 transitions. [2022-07-23 06:17:04,762 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 287 transitions. Word has length 39 [2022-07-23 06:17:04,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:17:04,763 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 287 transitions. [2022-07-23 06:17:04,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:04,763 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 287 transitions. [2022-07-23 06:17:04,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-23 06:17:04,763 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:17:04,764 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] [2022-07-23 06:17:04,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-23 06:17:04,764 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-07-23 06:17:04,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:17:04,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1645380794, now seen corresponding path program 1 times [2022-07-23 06:17:04,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:17:04,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921250863] [2022-07-23 06:17:04,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:17:04,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:17:04,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:17:05,044 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-23 06:17:05,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:17:05,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921250863] [2022-07-23 06:17:05,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921250863] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:17:05,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:17:05,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-23 06:17:05,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76330560] [2022-07-23 06:17:05,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:17:05,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-23 06:17:05,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:17:05,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-23 06:17:05,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-07-23 06:17:05,046 INFO L87 Difference]: Start difference. First operand 244 states and 287 transitions. Second operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:05,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:17:05,802 INFO L93 Difference]: Finished difference Result 409 states and 439 transitions. [2022-07-23 06:17:05,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-23 06:17:05,802 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-07-23 06:17:05,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:17:05,804 INFO L225 Difference]: With dead ends: 409 [2022-07-23 06:17:05,804 INFO L226 Difference]: Without dead ends: 409 [2022-07-23 06:17:05,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=179, Invalid=633, Unknown=0, NotChecked=0, Total=812 [2022-07-23 06:17:05,805 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 466 mSDsluCounter, 1116 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-23 06:17:05,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 1235 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-23 06:17:05,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2022-07-23 06:17:05,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 244. [2022-07-23 06:17:05,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 215 states have (on average 1.330232558139535) internal successors, (286), 243 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:05,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 286 transitions. [2022-07-23 06:17:05,810 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 286 transitions. Word has length 40 [2022-07-23 06:17:05,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:17:05,811 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 286 transitions. [2022-07-23 06:17:05,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:05,811 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 286 transitions. [2022-07-23 06:17:05,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-23 06:17:05,811 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:17:05,812 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] [2022-07-23 06:17:05,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-23 06:17:05,812 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-07-23 06:17:05,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:17:05,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1151553849, now seen corresponding path program 1 times [2022-07-23 06:17:05,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:17:05,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383422315] [2022-07-23 06:17:05,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:17:05,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:17:05,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:17:05,961 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-23 06:17:05,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:17:05,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383422315] [2022-07-23 06:17:05,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383422315] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:17:05,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:17:05,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-23 06:17:05,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36558266] [2022-07-23 06:17:05,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:17:05,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-23 06:17:05,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:17:05,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-23 06:17:05,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2022-07-23 06:17:05,964 INFO L87 Difference]: Start difference. First operand 244 states and 286 transitions. Second operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:06,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:17:06,405 INFO L93 Difference]: Finished difference Result 243 states and 285 transitions. [2022-07-23 06:17:06,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-23 06:17:06,406 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-07-23 06:17:06,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:17:06,407 INFO L225 Difference]: With dead ends: 243 [2022-07-23 06:17:06,407 INFO L226 Difference]: Without dead ends: 243 [2022-07-23 06:17:06,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2022-07-23 06:17:06,408 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 201 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:17:06,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 697 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 06:17:06,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-07-23 06:17:06,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2022-07-23 06:17:06,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 215 states have (on average 1.3255813953488371) internal successors, (285), 242 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:06,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 285 transitions. [2022-07-23 06:17:06,413 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 285 transitions. Word has length 40 [2022-07-23 06:17:06,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:17:06,413 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 285 transitions. [2022-07-23 06:17:06,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:06,413 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 285 transitions. [2022-07-23 06:17:06,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-23 06:17:06,413 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:17:06,414 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] [2022-07-23 06:17:06,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-23 06:17:06,414 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-07-23 06:17:06,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:17:06,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1151553848, now seen corresponding path program 1 times [2022-07-23 06:17:06,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:17:06,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603202914] [2022-07-23 06:17:06,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:17:06,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:17:06,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:17:06,616 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-23 06:17:06,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:17:06,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603202914] [2022-07-23 06:17:06,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603202914] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:17:06,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:17:06,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-23 06:17:06,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006139390] [2022-07-23 06:17:06,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:17:06,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-23 06:17:06,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:17:06,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-23 06:17:06,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2022-07-23 06:17:06,618 INFO L87 Difference]: Start difference. First operand 243 states and 285 transitions. Second operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:07,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:17:07,068 INFO L93 Difference]: Finished difference Result 242 states and 284 transitions. [2022-07-23 06:17:07,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-23 06:17:07,071 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-07-23 06:17:07,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:17:07,073 INFO L225 Difference]: With dead ends: 242 [2022-07-23 06:17:07,073 INFO L226 Difference]: Without dead ends: 242 [2022-07-23 06:17:07,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2022-07-23 06:17:07,074 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 194 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:17:07,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 687 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 06:17:07,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-07-23 06:17:07,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2022-07-23 06:17:07,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 215 states have (on average 1.3209302325581396) internal successors, (284), 241 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:07,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 284 transitions. [2022-07-23 06:17:07,078 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 284 transitions. Word has length 40 [2022-07-23 06:17:07,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:17:07,079 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 284 transitions. [2022-07-23 06:17:07,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:07,079 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 284 transitions. [2022-07-23 06:17:07,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-23 06:17:07,080 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:17:07,080 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-23 06:17:07,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-07-23 06:17:07,080 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-07-23 06:17:07,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:17:07,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1626494914, now seen corresponding path program 1 times [2022-07-23 06:17:07,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:17:07,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815996517] [2022-07-23 06:17:07,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:17:07,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:17:07,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:17:07,149 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-23 06:17:07,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:17:07,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815996517] [2022-07-23 06:17:07,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815996517] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:17:07,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:17:07,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 06:17:07,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069591678] [2022-07-23 06:17:07,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:17:07,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 06:17:07,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:17:07,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 06:17:07,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:17:07,152 INFO L87 Difference]: Start difference. First operand 242 states and 284 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:07,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:17:07,313 INFO L93 Difference]: Finished difference Result 252 states and 296 transitions. [2022-07-23 06:17:07,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 06:17:07,315 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-07-23 06:17:07,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:17:07,316 INFO L225 Difference]: With dead ends: 252 [2022-07-23 06:17:07,316 INFO L226 Difference]: Without dead ends: 252 [2022-07-23 06:17:07,317 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-23 06:17:07,317 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 31 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:17:07,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 583 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:17:07,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2022-07-23 06:17:07,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 239. [2022-07-23 06:17:07,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 213 states have (on average 1.3192488262910798) internal successors, (281), 238 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:07,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 281 transitions. [2022-07-23 06:17:07,322 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 281 transitions. Word has length 41 [2022-07-23 06:17:07,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:17:07,322 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 281 transitions. [2022-07-23 06:17:07,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:07,322 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 281 transitions. [2022-07-23 06:17:07,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-23 06:17:07,323 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:17:07,323 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-23 06:17:07,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-07-23 06:17:07,323 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-07-23 06:17:07,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:17:07,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1357177023, now seen corresponding path program 1 times [2022-07-23 06:17:07,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:17:07,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481113289] [2022-07-23 06:17:07,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:17:07,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:17:07,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:17:07,368 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-23 06:17:07,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:17:07,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481113289] [2022-07-23 06:17:07,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481113289] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:17:07,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:17:07,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 06:17:07,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48256666] [2022-07-23 06:17:07,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:17:07,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:17:07,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:17:07,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:17:07,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:17:07,371 INFO L87 Difference]: Start difference. First operand 239 states and 281 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:07,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:17:07,425 INFO L93 Difference]: Finished difference Result 249 states and 290 transitions. [2022-07-23 06:17:07,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:17:07,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-07-23 06:17:07,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:17:07,427 INFO L225 Difference]: With dead ends: 249 [2022-07-23 06:17:07,427 INFO L226 Difference]: Without dead ends: 249 [2022-07-23 06:17:07,428 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-23 06:17:07,429 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 91 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:17:07,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 170 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:17:07,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-07-23 06:17:07,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 237. [2022-07-23 06:17:07,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 212 states have (on average 1.3113207547169812) internal successors, (278), 236 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:07,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 278 transitions. [2022-07-23 06:17:07,435 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 278 transitions. Word has length 42 [2022-07-23 06:17:07,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:17:07,435 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 278 transitions. [2022-07-23 06:17:07,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:07,435 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 278 transitions. [2022-07-23 06:17:07,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-23 06:17:07,436 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:17:07,436 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, 1] [2022-07-23 06:17:07,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-07-23 06:17:07,436 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-07-23 06:17:07,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:17:07,437 INFO L85 PathProgramCache]: Analyzing trace with hash -284774687, now seen corresponding path program 1 times [2022-07-23 06:17:07,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:17:07,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971581967] [2022-07-23 06:17:07,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:17:07,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:17:07,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:17:07,560 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-23 06:17:07,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:17:07,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971581967] [2022-07-23 06:17:07,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971581967] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:17:07,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447424912] [2022-07-23 06:17:07,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:17:07,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:17:07,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:17:07,563 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-23 06:17:07,565 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-23 06:17:07,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:17:07,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-23 06:17:07,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:17:07,702 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-23 06:17:07,707 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-23 06:17:07,723 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-23 06:17:07,724 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-23 06:17:07,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:17:07,730 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-23 06:17:07,758 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-23 06:17:07,758 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-23 06:17:07,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:17:07,765 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-23 06:17:07,844 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-23 06:17:07,847 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-23 06:17:07,860 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-23 06:17:07,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:17:07,967 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-23 06:17:07,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447424912] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:17:07,967 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:17:07,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2022-07-23 06:17:07,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993088712] [2022-07-23 06:17:07,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:17:07,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 06:17:07,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:17:07,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 06:17:07,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:17:07,969 INFO L87 Difference]: Start difference. First operand 237 states and 278 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:08,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:17:08,176 INFO L93 Difference]: Finished difference Result 290 states and 324 transitions. [2022-07-23 06:17:08,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 06:17:08,177 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-07-23 06:17:08,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:17:08,178 INFO L225 Difference]: With dead ends: 290 [2022-07-23 06:17:08,178 INFO L226 Difference]: Without dead ends: 290 [2022-07-23 06:17:08,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-07-23 06:17:08,178 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 99 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:17:08,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 500 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 06:17:08,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-07-23 06:17:08,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 259. [2022-07-23 06:17:08,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 234 states have (on average 1.3205128205128205) internal successors, (309), 258 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:08,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 309 transitions. [2022-07-23 06:17:08,183 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 309 transitions. Word has length 42 [2022-07-23 06:17:08,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:17:08,185 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 309 transitions. [2022-07-23 06:17:08,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:08,185 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 309 transitions. [2022-07-23 06:17:08,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-23 06:17:08,185 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:17:08,186 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-23 06:17:08,216 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-23 06:17:08,386 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,SelfDestructingSolverStorable35 [2022-07-23 06:17:08,386 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-07-23 06:17:08,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:17:08,387 INFO L85 PathProgramCache]: Analyzing trace with hash -877180804, now seen corresponding path program 1 times [2022-07-23 06:17:08,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:17:08,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667282788] [2022-07-23 06:17:08,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:17:08,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:17:08,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:17:08,483 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-23 06:17:08,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:17:08,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667282788] [2022-07-23 06:17:08,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667282788] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:17:08,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:17:08,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-23 06:17:08,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182173943] [2022-07-23 06:17:08,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:17:08,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-23 06:17:08,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:17:08,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-23 06:17:08,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-23 06:17:08,489 INFO L87 Difference]: Start difference. First operand 259 states and 309 transitions. Second operand has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:08,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:17:08,852 INFO L93 Difference]: Finished difference Result 306 states and 343 transitions. [2022-07-23 06:17:08,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 06:17:08,852 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-07-23 06:17:08,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:17:08,854 INFO L225 Difference]: With dead ends: 306 [2022-07-23 06:17:08,854 INFO L226 Difference]: Without dead ends: 306 [2022-07-23 06:17:08,854 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-23 06:17:08,855 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 358 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:17:08,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 578 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 06:17:08,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-07-23 06:17:08,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 259. [2022-07-23 06:17:08,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 234 states have (on average 1.3162393162393162) internal successors, (308), 258 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:08,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 308 transitions. [2022-07-23 06:17:08,859 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 308 transitions. Word has length 43 [2022-07-23 06:17:08,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:17:08,859 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 308 transitions. [2022-07-23 06:17:08,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:08,860 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 308 transitions. [2022-07-23 06:17:08,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-23 06:17:08,860 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:17:08,860 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-23 06:17:08,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-07-23 06:17:08,860 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-07-23 06:17:08,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:17:08,861 INFO L85 PathProgramCache]: Analyzing trace with hash -877180803, now seen corresponding path program 1 times [2022-07-23 06:17:08,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:17:08,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930519854] [2022-07-23 06:17:08,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:17:08,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:17:08,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:17:08,995 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-23 06:17:08,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:17:08,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930519854] [2022-07-23 06:17:08,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930519854] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:17:08,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:17:08,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-23 06:17:08,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176387390] [2022-07-23 06:17:08,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:17:08,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-23 06:17:08,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:17:08,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-23 06:17:08,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-23 06:17:08,997 INFO L87 Difference]: Start difference. First operand 259 states and 308 transitions. Second operand has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:09,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:17:09,405 INFO L93 Difference]: Finished difference Result 306 states and 342 transitions. [2022-07-23 06:17:09,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-23 06:17:09,406 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-07-23 06:17:09,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:17:09,407 INFO L225 Difference]: With dead ends: 306 [2022-07-23 06:17:09,407 INFO L226 Difference]: Without dead ends: 306 [2022-07-23 06:17:09,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2022-07-23 06:17:09,408 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 251 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:17:09,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 600 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 06:17:09,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-07-23 06:17:09,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 259. [2022-07-23 06:17:09,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 234 states have (on average 1.3034188034188035) internal successors, (305), 258 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:09,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 305 transitions. [2022-07-23 06:17:09,413 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 305 transitions. Word has length 43 [2022-07-23 06:17:09,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:17:09,413 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 305 transitions. [2022-07-23 06:17:09,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:09,413 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 305 transitions. [2022-07-23 06:17:09,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-23 06:17:09,414 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:17:09,414 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-23 06:17:09,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-07-23 06:17:09,414 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-07-23 06:17:09,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:17:09,415 INFO L85 PathProgramCache]: Analyzing trace with hash -238079422, now seen corresponding path program 1 times [2022-07-23 06:17:09,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:17:09,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516861811] [2022-07-23 06:17:09,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:17:09,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:17:09,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:17:09,458 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-23 06:17:09,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:17:09,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516861811] [2022-07-23 06:17:09,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516861811] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:17:09,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807232501] [2022-07-23 06:17:09,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:17:09,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:17:09,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:17:09,464 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-23 06:17:09,495 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-23 06:17:09,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:17:09,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-23 06:17:09,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:17:09,654 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-23 06:17:09,678 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-23 06:17:09,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:17:09,733 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-23 06:17:09,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807232501] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:17:09,734 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:17:09,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2022-07-23 06:17:09,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64523064] [2022-07-23 06:17:09,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:17:09,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 06:17:09,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:17:09,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 06:17:09,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:17:09,735 INFO L87 Difference]: Start difference. First operand 259 states and 305 transitions. Second operand has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:09,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:17:09,831 INFO L93 Difference]: Finished difference Result 290 states and 336 transitions. [2022-07-23 06:17:09,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 06:17:09,831 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-07-23 06:17:09,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:17:09,832 INFO L225 Difference]: With dead ends: 290 [2022-07-23 06:17:09,832 INFO L226 Difference]: Without dead ends: 266 [2022-07-23 06:17:09,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:17:09,833 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:17:09,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 386 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 52 Unchecked, 0.1s Time] [2022-07-23 06:17:09,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-07-23 06:17:09,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2022-07-23 06:17:09,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 241 states have (on average 1.2946058091286308) internal successors, (312), 265 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:09,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 312 transitions. [2022-07-23 06:17:09,837 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 312 transitions. Word has length 43 [2022-07-23 06:17:09,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:17:09,838 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 312 transitions. [2022-07-23 06:17:09,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:09,838 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 312 transitions. [2022-07-23 06:17:09,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-23 06:17:09,838 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:17:09,838 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, 1, 1] [2022-07-23 06:17:09,874 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-23 06:17:10,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:17:10,056 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-07-23 06:17:10,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:17:10,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1157151236, now seen corresponding path program 1 times [2022-07-23 06:17:10,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:17:10,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072825648] [2022-07-23 06:17:10,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:17:10,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:17:10,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:17:10,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:17:10,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:17:10,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072825648] [2022-07-23 06:17:10,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072825648] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:17:10,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:17:10,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 06:17:10,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085814173] [2022-07-23 06:17:10,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:17:10,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 06:17:10,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:17:10,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 06:17:10,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-23 06:17:10,271 INFO L87 Difference]: Start difference. First operand 266 states and 312 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:10,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:17:10,604 INFO L93 Difference]: Finished difference Result 291 states and 325 transitions. [2022-07-23 06:17:10,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 06:17:10,604 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-07-23 06:17:10,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:17:10,605 INFO L225 Difference]: With dead ends: 291 [2022-07-23 06:17:10,605 INFO L226 Difference]: Without dead ends: 291 [2022-07-23 06:17:10,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-07-23 06:17:10,606 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 214 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:17:10,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 464 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 06:17:10,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2022-07-23 06:17:10,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 265. [2022-07-23 06:17:10,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 240 states have (on average 1.2916666666666667) internal successors, (310), 264 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:10,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 310 transitions. [2022-07-23 06:17:10,611 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 310 transitions. Word has length 45 [2022-07-23 06:17:10,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:17:10,611 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 310 transitions. [2022-07-23 06:17:10,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:10,612 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 310 transitions. [2022-07-23 06:17:10,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-23 06:17:10,612 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:17:10,612 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, 1, 1] [2022-07-23 06:17:10,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-07-23 06:17:10,613 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-07-23 06:17:10,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:17:10,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1529922318, now seen corresponding path program 1 times [2022-07-23 06:17:10,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:17:10,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807883245] [2022-07-23 06:17:10,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:17:10,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:17:10,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:17:10,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:17:10,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:17:10,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807883245] [2022-07-23 06:17:10,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807883245] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:17:10,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:17:10,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 06:17:10,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299284170] [2022-07-23 06:17:10,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:17:10,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:17:10,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:17:10,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:17:10,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:17:10,652 INFO L87 Difference]: Start difference. First operand 265 states and 310 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:10,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:17:10,661 INFO L93 Difference]: Finished difference Result 405 states and 481 transitions. [2022-07-23 06:17:10,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:17:10,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-07-23 06:17:10,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:17:10,663 INFO L225 Difference]: With dead ends: 405 [2022-07-23 06:17:10,663 INFO L226 Difference]: Without dead ends: 405 [2022-07-23 06:17:10,664 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-23 06:17:10,665 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 56 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:17:10,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 313 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:17:10,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2022-07-23 06:17:10,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 302. [2022-07-23 06:17:10,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 277 states have (on average 1.3285198555956679) internal successors, (368), 301 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:10,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 368 transitions. [2022-07-23 06:17:10,671 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 368 transitions. Word has length 45 [2022-07-23 06:17:10,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:17:10,672 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 368 transitions. [2022-07-23 06:17:10,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:10,672 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 368 transitions. [2022-07-23 06:17:10,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-23 06:17:10,673 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:17:10,673 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:17:10,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-07-23 06:17:10,673 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-07-23 06:17:10,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:17:10,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1376244065, now seen corresponding path program 1 times [2022-07-23 06:17:10,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:17:10,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103450579] [2022-07-23 06:17:10,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:17:10,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:17:10,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:17:10,736 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:17:10,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:17:10,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103450579] [2022-07-23 06:17:10,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103450579] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:17:10,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:17:10,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 06:17:10,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158740558] [2022-07-23 06:17:10,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:17:10,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:17:10,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:17:10,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:17:10,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:17:10,738 INFO L87 Difference]: Start difference. First operand 302 states and 368 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:10,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:17:10,832 INFO L93 Difference]: Finished difference Result 249 states and 280 transitions. [2022-07-23 06:17:10,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 06:17:10,833 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-07-23 06:17:10,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:17:10,834 INFO L225 Difference]: With dead ends: 249 [2022-07-23 06:17:10,834 INFO L226 Difference]: Without dead ends: 249 [2022-07-23 06:17:10,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:17:10,835 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 56 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:17:10,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 524 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:17:10,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-07-23 06:17:10,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2022-07-23 06:17:10,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 225 states have (on average 1.2444444444444445) internal successors, (280), 248 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:10,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 280 transitions. [2022-07-23 06:17:10,839 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 280 transitions. Word has length 47 [2022-07-23 06:17:10,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:17:10,840 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 280 transitions. [2022-07-23 06:17:10,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:10,840 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 280 transitions. [2022-07-23 06:17:10,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-23 06:17:10,840 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:17:10,840 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:17:10,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-07-23 06:17:10,841 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-07-23 06:17:10,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:17:10,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1538447444, now seen corresponding path program 1 times [2022-07-23 06:17:10,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:17:10,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777712425] [2022-07-23 06:17:10,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:17:10,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:17:10,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:17:10,956 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-23 06:17:10,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:17:10,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777712425] [2022-07-23 06:17:10,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777712425] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:17:10,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:17:10,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-23 06:17:10,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819484921] [2022-07-23 06:17:10,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:17:10,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-23 06:17:10,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:17:10,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-23 06:17:10,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-23 06:17:10,959 INFO L87 Difference]: Start difference. First operand 249 states and 280 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:11,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:17:11,303 INFO L93 Difference]: Finished difference Result 238 states and 263 transitions. [2022-07-23 06:17:11,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-23 06:17:11,304 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-07-23 06:17:11,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:17:11,305 INFO L225 Difference]: With dead ends: 238 [2022-07-23 06:17:11,305 INFO L226 Difference]: Without dead ends: 238 [2022-07-23 06:17:11,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2022-07-23 06:17:11,305 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 411 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:17:11,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 650 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 06:17:11,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-07-23 06:17:11,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 226. [2022-07-23 06:17:11,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 202 states have (on average 1.2623762376237624) internal successors, (255), 225 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:11,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 255 transitions. [2022-07-23 06:17:11,310 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 255 transitions. Word has length 50 [2022-07-23 06:17:11,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:17:11,310 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 255 transitions. [2022-07-23 06:17:11,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:11,310 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 255 transitions. [2022-07-23 06:17:11,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-23 06:17:11,311 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:17:11,311 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:17:11,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-07-23 06:17:11,311 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-07-23 06:17:11,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:17:11,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1188819543, now seen corresponding path program 1 times [2022-07-23 06:17:11,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:17:11,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812457228] [2022-07-23 06:17:11,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:17:11,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:17:11,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:17:11,356 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:17:11,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:17:11,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812457228] [2022-07-23 06:17:11,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812457228] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:17:11,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:17:11,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:17:11,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941619076] [2022-07-23 06:17:11,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:17:11,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 06:17:11,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:17:11,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 06:17:11,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:17:11,358 INFO L87 Difference]: Start difference. First operand 226 states and 255 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:11,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:17:11,451 INFO L93 Difference]: Finished difference Result 240 states and 270 transitions. [2022-07-23 06:17:11,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 06:17:11,452 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-07-23 06:17:11,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:17:11,453 INFO L225 Difference]: With dead ends: 240 [2022-07-23 06:17:11,453 INFO L226 Difference]: Without dead ends: 240 [2022-07-23 06:17:11,453 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-23 06:17:11,453 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 19 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:17:11,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 491 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:17:11,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-07-23 06:17:11,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 229. [2022-07-23 06:17:11,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 205 states have (on average 1.2585365853658537) internal successors, (258), 228 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:11,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 258 transitions. [2022-07-23 06:17:11,458 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 258 transitions. Word has length 52 [2022-07-23 06:17:11,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:17:11,458 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 258 transitions. [2022-07-23 06:17:11,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:11,458 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 258 transitions. [2022-07-23 06:17:11,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-23 06:17:11,458 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:17:11,459 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:17:11,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-07-23 06:17:11,459 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-07-23 06:17:11,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:17:11,459 INFO L85 PathProgramCache]: Analyzing trace with hash 426433170, now seen corresponding path program 1 times [2022-07-23 06:17:11,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:17:11,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355196096] [2022-07-23 06:17:11,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:17:11,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:17:11,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:17:11,769 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:17:11,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:17:11,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355196096] [2022-07-23 06:17:11,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355196096] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:17:11,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699396515] [2022-07-23 06:17:11,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:17:11,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:17:11,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:17:11,772 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:17:11,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-23 06:17:11,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:17:11,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 56 conjunts are in the unsatisfiable core [2022-07-23 06:17:11,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:17:11,942 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 6 treesize of output 5 [2022-07-23 06:17:11,964 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 13 treesize of output 9 [2022-07-23 06:17:11,968 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 13 treesize of output 9 [2022-07-23 06:17:12,058 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-23 06:17:12,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-23 06:17:12,121 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-07-23 06:17:12,122 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 1 case distinctions, treesize of input 21 treesize of output 26 [2022-07-23 06:17:12,139 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-07-23 06:17:12,140 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 1 case distinctions, treesize of input 21 treesize of output 20 [2022-07-23 06:17:12,282 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:17:12,282 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 50 [2022-07-23 06:17:12,289 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2022-07-23 06:17:12,514 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:17:12,515 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 80 treesize of output 70 [2022-07-23 06:17:12,527 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:17:12,528 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 85 treesize of output 85 [2022-07-23 06:17:12,840 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:17:12,840 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 80 treesize of output 70 [2022-07-23 06:17:12,850 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:17:12,851 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 85 treesize of output 85 [2022-07-23 06:17:13,240 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:17:13,241 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 59 treesize of output 43 [2022-07-23 06:17:13,248 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:17:13,248 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 57 treesize of output 53 [2022-07-23 06:17:13,440 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:17:13,440 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:17:13,661 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1482 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1482) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) (or (= (select |c_#valid| .cse0) 1) (= .cse0 0)))) (or (forall ((v_ArrVal_1483 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1483) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 0)) (forall ((v_ArrVal_1482 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1482) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) 1)))) is different from false [2022-07-23 06:17:13,735 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_1482 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_1482) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) 1)) (forall ((v_ArrVal_1483 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_1483) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 0))) (forall ((v_ArrVal_1482 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_1482) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) (or (= .cse0 0) (= (select |c_#valid| .cse0) 1))))) is different from false [2022-07-23 06:17:13,748 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_1482 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1482) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) 1)) (forall ((v_ArrVal_1483 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1483) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 0))) (forall ((v_ArrVal_1482 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1482) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) (or (= (select |c_#valid| .cse0) 1) (= .cse0 0))))) is different from false [2022-07-23 06:17:13,781 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1479 (Array Int Int)) (v_ArrVal_1478 (Array Int Int))) (or (forall ((v_ArrVal_1483 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1479) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1478) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1483) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 0)) (forall ((v_ArrVal_1482 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1478))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1482)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) 1)))) (forall ((v_ArrVal_1478 (Array Int Int)) (v_ArrVal_1482 (Array Int Int))) (let ((.cse1 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1478))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1482)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) (or (= .cse1 0) (= (select |c_#valid| .cse1) 1))))) is different from false [2022-07-23 06:17:13,798 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1478 (Array Int Int)) (v_ArrVal_1482 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1478))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1482)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) (or (= .cse0 0) (= (select |c_#valid| .cse0) 1)))) (forall ((v_ArrVal_1479 (Array Int Int)) (v_ArrVal_1478 (Array Int Int))) (or (forall ((v_ArrVal_1483 (Array Int Int))) (= (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1479) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1478) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1483)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 0)) (forall ((v_ArrVal_1482 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1478))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1482)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) 1))))) is different from false [2022-07-23 06:17:13,829 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1479 (Array Int Int)) (v_ArrVal_1478 (Array Int Int))) (or (forall ((v_ArrVal_1482 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_#t~malloc10#1.base|)) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1478))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1482)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) 1)) (forall ((v_ArrVal_1483 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_#t~malloc10#1.offset|)) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1479) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_#t~malloc10#1.base|)) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1478) |c_ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1483) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 0)))) (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1478 (Array Int Int)) (v_ArrVal_1482 (Array Int Int))) (let ((.cse1 (select (select (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_#t~malloc10#1.base|)) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1478))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1482)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) (or (= .cse1 0) (= (select |c_#valid| .cse1) 1))))) is different from false [2022-07-23 06:17:14,320 INFO L356 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2022-07-23 06:17:14,320 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 54 [2022-07-23 06:17:14,338 INFO L356 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2022-07-23 06:17:14,340 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 75 [2022-07-23 06:17:14,350 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:17:14,351 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 263 treesize of output 187 [2022-07-23 06:17:14,357 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 122 treesize of output 110 [2022-07-23 06:17:14,367 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:17:14,368 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 96 [2022-07-23 06:17:14,379 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-23 06:17:14,380 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 184 treesize of output 156 [2022-07-23 06:17:14,396 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 58 treesize of output 50 [2022-07-23 06:17:14,402 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 50 treesize of output 42 [2022-07-23 06:17:14,453 INFO L356 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2022-07-23 06:17:14,454 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 75 [2022-07-23 06:17:14,462 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:17:14,462 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 542 treesize of output 374 [2022-07-23 06:17:14,469 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 347 treesize of output 315 [2022-07-23 06:17:14,490 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:17:14,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 315 treesize of output 285 [2022-07-23 06:17:28,945 WARN L233 SmtUtils]: Spent 14.05s on a formula simplification. DAG size of input: 40 DAG size of output: 13 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-23 06:17:28,977 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:17:28,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1699396515] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:17:28,978 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:17:28,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 15] total 40 [2022-07-23 06:17:28,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53008212] [2022-07-23 06:17:28,978 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:17:28,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-23 06:17:28,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:17:28,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-23 06:17:28,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=965, Unknown=10, NotChecked=414, Total=1560 [2022-07-23 06:17:28,980 INFO L87 Difference]: Start difference. First operand 229 states and 258 transitions. Second operand has 40 states, 40 states have (on average 3.675) internal successors, (147), 40 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:31,146 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~end~0#1.offset| 8)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 1) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (= |c_ULTIMATE.start_main_#t~malloc10#1.offset| 0) (= (select .cse0 .cse1) 0) (= (select .cse2 .cse1) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 0) (= (select |c_#valid| |c_ULTIMATE.start_main_#t~malloc10#1.base|) 1) (not (<= (+ |c_ULTIMATE.start_main_~list~0#1.offset| 1) |c_ULTIMATE.start_main_~end~0#1.offset|)) (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1479 (Array Int Int)) (v_ArrVal_1478 (Array Int Int))) (or (forall ((v_ArrVal_1482 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse4 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_#t~malloc10#1.base|)) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1478))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1482)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) 1)) (forall ((v_ArrVal_1483 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_#t~malloc10#1.offset|)) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1479) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_#t~malloc10#1.base|)) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1478) |c_ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1483) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 0)))) (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1478 (Array Int Int)) (v_ArrVal_1482 (Array Int Int))) (let ((.cse5 (select (select (let ((.cse6 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_#t~malloc10#1.base|)) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1478))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1482)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) (or (= .cse5 0) (= (select |c_#valid| .cse5) 1)))) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_#t~malloc10#1.base|)) (= |c_ULTIMATE.start_main_~end~0#1.offset| 0) (= (select .cse2 .cse3) 0) (= (select .cse0 .cse3) 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 0) (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~end~0#1.base|))) is different from false [2022-07-23 06:17:40,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:17:40,795 INFO L93 Difference]: Finished difference Result 354 states and 388 transitions. [2022-07-23 06:17:40,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-23 06:17:40,796 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 3.675) internal successors, (147), 40 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-07-23 06:17:40,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:17:40,797 INFO L225 Difference]: With dead ends: 354 [2022-07-23 06:17:40,797 INFO L226 Difference]: Without dead ends: 354 [2022-07-23 06:17:40,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 26.1s TimeCoverageRelationStatistics Valid=366, Invalid=1999, Unknown=15, NotChecked=700, Total=3080 [2022-07-23 06:17:40,798 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 256 mSDsluCounter, 1883 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 1990 SdHoareTripleChecker+Invalid, 2350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1419 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-23 06:17:40,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 1990 Invalid, 2350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 905 Invalid, 0 Unknown, 1419 Unchecked, 0.5s Time] [2022-07-23 06:17:40,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2022-07-23 06:17:40,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 259. [2022-07-23 06:17:40,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 235 states have (on average 1.2340425531914894) internal successors, (290), 258 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:40,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 290 transitions. [2022-07-23 06:17:40,804 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 290 transitions. Word has length 54 [2022-07-23 06:17:40,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:17:40,804 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 290 transitions. [2022-07-23 06:17:40,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 3.675) internal successors, (147), 40 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:17:40,804 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 290 transitions. [2022-07-23 06:17:40,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-23 06:17:40,805 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:17:40,805 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:17:40,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-23 06:17:41,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:17:41,020 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-07-23 06:17:41,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:17:41,021 INFO L85 PathProgramCache]: Analyzing trace with hash -2048851803, now seen corresponding path program 1 times [2022-07-23 06:17:41,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:17:41,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246320285] [2022-07-23 06:17:41,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:17:41,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:17:41,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:17:41,339 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:17:41,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:17:41,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246320285] [2022-07-23 06:17:41,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246320285] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:17:41,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371286113] [2022-07-23 06:17:41,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:17:41,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:17:41,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:17:41,341 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:17:41,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-23 06:17:41,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:17:41,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 36 conjunts are in the unsatisfiable core [2022-07-23 06:17:41,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:17:41,511 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 6 treesize of output 5 [2022-07-23 06:17:41,608 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-23 06:17:41,609 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-23 06:17:41,645 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:17:41,730 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:17:41,731 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-23 06:17:41,812 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:17:41,812 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 31 treesize of output 29 [2022-07-23 06:17:41,890 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:17:41,891 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-23 06:17:42,095 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:17:42,096 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 25 treesize of output 13 [2022-07-23 06:17:42,155 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:17:42,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:17:42,689 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:17:42,689 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 31 [2022-07-23 06:17:42,698 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:17:42,698 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 144 treesize of output 131 [2022-07-23 06:17:42,710 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:17:42,711 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 114 [2022-07-23 06:17:42,716 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 106 treesize of output 102 [2022-07-23 06:17:47,828 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:17:47,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371286113] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:17:47,828 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:17:47,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 34 [2022-07-23 06:17:47,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102799436] [2022-07-23 06:17:47,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:17:47,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-23 06:17:47,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:17:47,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-23 06:17:47,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=986, Unknown=30, NotChecked=0, Total=1190 [2022-07-23 06:17:47,830 INFO L87 Difference]: Start difference. First operand 259 states and 290 transitions. Second operand has 35 states, 34 states have (on average 4.852941176470588) internal successors, (165), 35 states have internal predecessors, (165), 0 states have call successors, (0), 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-23 06:17:49,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:17:49,133 INFO L93 Difference]: Finished difference Result 425 states and 446 transitions. [2022-07-23 06:17:49,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-23 06:17:49,134 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 4.852941176470588) internal successors, (165), 35 states have internal predecessors, (165), 0 states have call successors, (0), 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 56 [2022-07-23 06:17:49,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:17:49,135 INFO L225 Difference]: With dead ends: 425 [2022-07-23 06:17:49,135 INFO L226 Difference]: Without dead ends: 425 [2022-07-23 06:17:49,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 889 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=585, Invalid=2355, Unknown=30, NotChecked=0, Total=2970 [2022-07-23 06:17:49,137 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 1317 mSDsluCounter, 1727 mSDsCounter, 0 mSdLazyCounter, 937 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1317 SdHoareTripleChecker+Valid, 1835 SdHoareTripleChecker+Invalid, 2367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1291 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-23 06:17:49,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1317 Valid, 1835 Invalid, 2367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 937 Invalid, 0 Unknown, 1291 Unchecked, 0.6s Time] [2022-07-23 06:17:49,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2022-07-23 06:17:49,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 308. [2022-07-23 06:17:49,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 284 states have (on average 1.232394366197183) internal successors, (350), 307 states have internal predecessors, (350), 0 states have call successors, (0), 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-23 06:17:49,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 350 transitions. [2022-07-23 06:17:49,142 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 350 transitions. Word has length 56 [2022-07-23 06:17:49,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:17:49,142 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 350 transitions. [2022-07-23 06:17:49,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 4.852941176470588) internal successors, (165), 35 states have internal predecessors, (165), 0 states have call successors, (0), 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-23 06:17:49,143 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 350 transitions. [2022-07-23 06:17:49,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-23 06:17:49,143 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:17:49,144 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:17:49,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-23 06:17:49,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-07-23 06:17:49,358 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-07-23 06:17:49,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:17:49,358 INFO L85 PathProgramCache]: Analyzing trace with hash -2048851802, now seen corresponding path program 1 times [2022-07-23 06:17:49,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:17:49,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79607459] [2022-07-23 06:17:49,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:17:49,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:17:49,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:17:49,573 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:17:49,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:17:49,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79607459] [2022-07-23 06:17:49,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79607459] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:17:49,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336318282] [2022-07-23 06:17:49,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:17:49,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:17:49,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:17:49,575 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:17:49,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-23 06:17:49,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:17:49,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-23 06:17:49,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:17:49,867 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-23 06:17:49,867 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 19 treesize of output 18 [2022-07-23 06:17:49,900 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-07-23 06:17:49,900 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 19 treesize of output 26 [2022-07-23 06:17:50,071 INFO L356 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2022-07-23 06:17:50,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 94 treesize of output 78 [2022-07-23 06:17:50,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:17:50,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:17:50,083 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-23 06:17:50,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 50 [2022-07-23 06:17:50,470 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:17:50,487 INFO L356 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2022-07-23 06:17:50,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 85 treesize of output 76 [2022-07-23 06:17:50,491 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:17:50,497 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:17:50,498 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 59 [2022-07-23 06:17:50,667 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:17:50,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:17:51,286 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:17:51,287 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 158 treesize of output 204 [2022-07-23 06:18:23,392 WARN L233 SmtUtils]: Spent 24.54s on a formula simplification. DAG size of input: 101 DAG size of output: 68 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-23 06:18:29,960 WARN L233 SmtUtils]: Spent 6.11s on a formula simplification. DAG size of input: 73 DAG size of output: 65 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-23 06:18:30,683 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:18:30,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 551 treesize of output 442 [2022-07-23 06:18:30,723 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:18:30,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 883 treesize of output 692 [2022-07-23 06:18:40,920 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:18:40,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [336318282] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:18:40,920 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:18:40,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 32 [2022-07-23 06:18:40,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688845256] [2022-07-23 06:18:40,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:18:40,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-23 06:18:40,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:18:40,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-23 06:18:40,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=947, Unknown=1, NotChecked=0, Total=1056 [2022-07-23 06:18:40,922 INFO L87 Difference]: Start difference. First operand 308 states and 350 transitions. Second operand has 33 states, 32 states have (on average 5.1875) internal successors, (166), 33 states have internal predecessors, (166), 0 states have call successors, (0), 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-23 06:18:43,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:18:43,585 INFO L93 Difference]: Finished difference Result 478 states and 514 transitions. [2022-07-23 06:18:43,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-07-23 06:18:43,586 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 5.1875) internal successors, (166), 33 states have internal predecessors, (166), 0 states have call successors, (0), 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 56 [2022-07-23 06:18:43,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:18:43,587 INFO L225 Difference]: With dead ends: 478 [2022-07-23 06:18:43,587 INFO L226 Difference]: Without dead ends: 478 [2022-07-23 06:18:43,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 97 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1386 ImplicationChecksByTransitivity, 40.5s TimeCoverageRelationStatistics Valid=760, Invalid=4641, Unknown=1, NotChecked=0, Total=5402 [2022-07-23 06:18:43,589 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 945 mSDsluCounter, 1682 mSDsCounter, 0 mSdLazyCounter, 1511 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 945 SdHoareTripleChecker+Valid, 1809 SdHoareTripleChecker+Invalid, 2253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 1511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 596 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-23 06:18:43,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [945 Valid, 1809 Invalid, 2253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 1511 Invalid, 0 Unknown, 596 Unchecked, 0.8s Time] [2022-07-23 06:18:43,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2022-07-23 06:18:43,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 307. [2022-07-23 06:18:43,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 283 states have (on average 1.2296819787985867) internal successors, (348), 306 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:18:43,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 348 transitions. [2022-07-23 06:18:43,594 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 348 transitions. Word has length 56 [2022-07-23 06:18:43,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:18:43,595 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 348 transitions. [2022-07-23 06:18:43,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 5.1875) internal successors, (166), 33 states have internal predecessors, (166), 0 states have call successors, (0), 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-23 06:18:43,595 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 348 transitions. [2022-07-23 06:18:43,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-23 06:18:43,596 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:18:43,596 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:18:43,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-23 06:18:43,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:18:43,816 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-07-23 06:18:43,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:18:43,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1627380482, now seen corresponding path program 1 times [2022-07-23 06:18:43,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:18:43,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331894331] [2022-07-23 06:18:43,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:18:43,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:18:43,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:18:44,120 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:18:44,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:18:44,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331894331] [2022-07-23 06:18:44,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331894331] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:18:44,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448118796] [2022-07-23 06:18:44,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:18:44,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:18:44,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:18:44,121 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:18:44,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-23 06:18:44,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:18:44,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-23 06:18:44,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:18:44,260 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 6 treesize of output 5 [2022-07-23 06:18:44,282 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:18:44,282 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 06:18:44,290 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:18:44,293 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 13 treesize of output 9 [2022-07-23 06:18:44,327 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:18:44,328 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-07-23 06:18:44,331 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 22 treesize of output 24 [2022-07-23 06:18:44,369 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:18:44,369 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-07-23 06:18:44,372 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 22 treesize of output 24 [2022-07-23 06:18:45,901 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:18:45,902 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:18:45,903 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:18:45,909 INFO L356 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2022-07-23 06:18:45,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 85 treesize of output 48 [2022-07-23 06:18:45,914 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:18:45,918 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-23 06:18:45,919 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2022-07-23 06:18:45,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:18:45,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:18:49,272 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1757 (Array Int Int)) (v_ArrVal_1756 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_86| Int)) (or (forall ((v_ArrVal_1759 (Array Int Int))) (or (not (<= 0 (select (select (let ((.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1757) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1756) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) v_ArrVal_1759))) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |v_ULTIMATE.start_main_~end~0#1.offset_86| 8)))) (forall ((v_ArrVal_1758 (Array Int Int))) (let ((.cse6 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) .cse6))) (let ((.cse12 (store |c_#memory_$Pointer$.base| .cse10 v_ArrVal_1756))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~list~0#1.base|) .cse6))) (let ((.cse8 (store .cse12 .cse11 v_ArrVal_1758)) (.cse2 (store (store |c_#memory_$Pointer$.offset| .cse10 v_ArrVal_1757) .cse11 v_ArrVal_1759))) (let ((.cse7 (select .cse2 |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse5 (select .cse8 |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse9 (+ |v_ULTIMATE.start_main_~end~0#1.offset_86| 8))) (let ((.cse3 (select .cse5 .cse9)) (.cse4 (+ 8 (select .cse7 .cse9)))) (or (not (= (select (select .cse2 .cse3) .cse4) 0)) (= (select (select .cse2 (select .cse5 .cse6)) (+ (select .cse7 .cse6) 8)) 0) (not (= (select (select .cse8 .cse3) .cse4) 0))))))))))))) (not (<= 0 |v_ULTIMATE.start_main_~end~0#1.offset_86|)) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_86| |c_ULTIMATE.start_main_~list~0#1.offset|)))) (forall ((v_ArrVal_1757 (Array Int Int)) (v_ArrVal_1756 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~end~0#1.offset_86|)) (forall ((v_ArrVal_1759 (Array Int Int))) (or (not (<= 0 (select (select (let ((.cse14 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (let ((.cse13 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) .cse14))) (store (store |c_#memory_$Pointer$.offset| .cse13 v_ArrVal_1757) (select (select (store |c_#memory_$Pointer$.base| .cse13 v_ArrVal_1756) |c_ULTIMATE.start_main_~list~0#1.base|) .cse14) v_ArrVal_1759))) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |v_ULTIMATE.start_main_~end~0#1.offset_86| 8)))) (forall ((v_ArrVal_1758 (Array Int Int))) (let ((.cse20 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (let ((.cse23 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) .cse20))) (let ((.cse25 (store |c_#memory_$Pointer$.base| .cse23 v_ArrVal_1756))) (let ((.cse24 (select (select .cse25 |c_ULTIMATE.start_main_~list~0#1.base|) .cse20))) (let ((.cse18 (store .cse25 .cse24 v_ArrVal_1758)) (.cse15 (store (store |c_#memory_$Pointer$.offset| .cse23 v_ArrVal_1757) .cse24 v_ArrVal_1759))) (let ((.cse21 (select .cse15 |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse19 (select .cse18 |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse22 (+ |v_ULTIMATE.start_main_~end~0#1.offset_86| 8))) (let ((.cse16 (select .cse19 .cse22)) (.cse17 (+ 8 (select .cse21 .cse22)))) (or (not (= (select (select .cse15 .cse16) .cse17) 0)) (= (select (select .cse18 (select .cse19 .cse20)) (+ (select .cse21 .cse20) 8)) 0) (not (= (select (select .cse18 .cse16) .cse17) 0))))))))))))) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_86| |c_ULTIMATE.start_main_~list~0#1.offset|))))) is different from false [2022-07-23 06:18:49,336 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:18:49,336 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 426 treesize of output 386 [2022-07-23 06:18:49,342 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:18:49,342 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 376 treesize of output 236 [2022-07-23 06:18:51,094 INFO L356 Elim1Store]: treesize reduction 501, result has 78.1 percent of original size [2022-07-23 06:18:51,095 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 17 new quantified variables, introduced 78 case distinctions, treesize of input 5120 treesize of output 5537 [2022-07-23 06:18:51,544 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:18:52,356 INFO L356 Elim1Store]: treesize reduction 498, result has 52.9 percent of original size [2022-07-23 06:18:52,357 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 1 disjoint index pairs (out of 55 index pairs), introduced 12 new quantified variables, introduced 55 case distinctions, treesize of input 14487 treesize of output 13277 [2022-07-23 06:18:53,600 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:18:53,907 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:18:53,908 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 27 case distinctions, treesize of input 9994 treesize of output 9148 [2022-07-23 06:18:54,380 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:18:54,496 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:18:54,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 11935 treesize of output 10625 [2022-07-23 06:18:55,426 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:18:55,574 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:18:55,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 9886 treesize of output 9482 [2022-07-23 06:18:56,632 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:18:56,887 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:18:56,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 27 case distinctions, treesize of input 10103 treesize of output 8077