./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/sll-01-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/sll-01-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ba1a5c8c8cff607fde50280cfe0e0975858a4c6ed38f8443d26bb1773b66a31d --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 06:07:03,896 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 06:07:03,897 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 06:07:03,921 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 06:07:03,922 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 06:07:03,923 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 06:07:03,926 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 06:07:03,930 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 06:07:03,931 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 06:07:03,934 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 06:07:03,935 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 06:07:03,937 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 06:07:03,937 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 06:07:03,938 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 06:07:03,940 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 06:07:03,941 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 06:07:03,942 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 06:07:03,943 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 06:07:03,945 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 06:07:03,951 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 06:07:03,952 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 06:07:03,953 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 06:07:03,953 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 06:07:03,954 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 06:07:03,955 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 06:07:03,960 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 06:07:03,960 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 06:07:03,961 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 06:07:03,961 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 06:07:03,962 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 06:07:03,962 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 06:07:03,963 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 06:07:03,964 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 06:07:03,964 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 06:07:03,965 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 06:07:03,966 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 06:07:03,966 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 06:07:03,966 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 06:07:03,966 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 06:07:03,967 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 06:07:03,967 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 06:07:03,968 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 06:07:03,970 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-20 06:07:03,992 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 06:07:03,992 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 06:07:03,992 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 06:07:03,992 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 06:07:03,993 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 06:07:03,993 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 06:07:03,993 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 06:07:03,994 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 06:07:03,994 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 06:07:03,994 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 06:07:03,994 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 06:07:03,994 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 06:07:03,994 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 06:07:03,994 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 06:07:03,995 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 06:07:03,995 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 06:07:03,995 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 06:07:03,995 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-20 06:07:03,995 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 06:07:03,995 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 06:07:03,995 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 06:07:03,996 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 06:07:03,996 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 06:07:03,996 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 06:07:03,996 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 06:07:03,996 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 06:07:03,996 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 06:07:03,996 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 06:07:03,997 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 06:07:03,997 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 06:07:03,997 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ba1a5c8c8cff607fde50280cfe0e0975858a4c6ed38f8443d26bb1773b66a31d [2022-07-20 06:07:04,194 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 06:07:04,220 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 06:07:04,222 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 06:07:04,223 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 06:07:04,224 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 06:07:04,225 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-01-1.i [2022-07-20 06:07:04,269 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/062f37e5c/434643a825674c7294a583e146e7c010/FLAG6f4be8528 [2022-07-20 06:07:04,606 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 06:07:04,607 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i [2022-07-20 06:07:04,615 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/062f37e5c/434643a825674c7294a583e146e7c010/FLAG6f4be8528 [2022-07-20 06:07:05,010 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/062f37e5c/434643a825674c7294a583e146e7c010 [2022-07-20 06:07:05,012 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 06:07:05,013 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 06:07:05,014 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 06:07:05,014 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 06:07:05,030 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 06:07:05,031 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:07:05" (1/1) ... [2022-07-20 06:07:05,032 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31d76968 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:07:05, skipping insertion in model container [2022-07-20 06:07:05,032 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:07:05" (1/1) ... [2022-07-20 06:07:05,036 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 06:07:05,073 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 06:07:05,240 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22034,22047] [2022-07-20 06:07:05,244 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22307,22320] [2022-07-20 06:07:05,245 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22516,22529] [2022-07-20 06:07:05,246 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22586,22599] [2022-07-20 06:07:05,248 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22853,22866] [2022-07-20 06:07:05,249 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22961,22974] [2022-07-20 06:07:05,250 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23192,23205] [2022-07-20 06:07:05,250 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23272,23285] [2022-07-20 06:07:05,251 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23351,23364] [2022-07-20 06:07:05,252 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23441,23454] [2022-07-20 06:07:05,254 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23619,23632] [2022-07-20 06:07:05,255 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23697,23710] [2022-07-20 06:07:05,257 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23774,23787] [2022-07-20 06:07:05,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 06:07:05,269 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 06:07:05,294 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22034,22047] [2022-07-20 06:07:05,296 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22307,22320] [2022-07-20 06:07:05,297 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22516,22529] [2022-07-20 06:07:05,298 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22586,22599] [2022-07-20 06:07:05,299 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22853,22866] [2022-07-20 06:07:05,300 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22961,22974] [2022-07-20 06:07:05,301 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23192,23205] [2022-07-20 06:07:05,302 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23272,23285] [2022-07-20 06:07:05,302 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23351,23364] [2022-07-20 06:07:05,303 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23441,23454] [2022-07-20 06:07:05,304 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23619,23632] [2022-07-20 06:07:05,304 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23697,23710] [2022-07-20 06:07:05,305 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23774,23787] [2022-07-20 06:07:05,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 06:07:05,323 INFO L208 MainTranslator]: Completed translation [2022-07-20 06:07:05,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:07:05 WrapperNode [2022-07-20 06:07:05,324 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 06:07:05,325 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 06:07:05,325 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 06:07:05,327 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 06:07:05,332 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:07:05" (1/1) ... [2022-07-20 06:07:05,345 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:07:05" (1/1) ... [2022-07-20 06:07:05,366 INFO L137 Inliner]: procedures = 119, calls = 41, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 227 [2022-07-20 06:07:05,379 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 06:07:05,380 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 06:07:05,381 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 06:07:05,381 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 06:07:05,386 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:07:05" (1/1) ... [2022-07-20 06:07:05,387 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:07:05" (1/1) ... [2022-07-20 06:07:05,393 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:07:05" (1/1) ... [2022-07-20 06:07:05,402 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:07:05" (1/1) ... [2022-07-20 06:07:05,409 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:07:05" (1/1) ... [2022-07-20 06:07:05,422 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:07:05" (1/1) ... [2022-07-20 06:07:05,424 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:07:05" (1/1) ... [2022-07-20 06:07:05,431 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 06:07:05,432 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 06:07:05,432 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 06:07:05,432 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 06:07:05,436 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:07:05" (1/1) ... [2022-07-20 06:07:05,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 06:07:05,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:07:05,459 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-20 06:07:05,460 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-20 06:07:05,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 06:07:05,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 06:07:05,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 06:07:05,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 06:07:05,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 06:07:05,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 06:07:05,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 06:07:05,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 06:07:05,549 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 06:07:05,550 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 06:07:05,870 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 06:07:05,876 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 06:07:05,876 INFO L299 CfgBuilder]: Removed 30 assume(true) statements. [2022-07-20 06:07:05,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:07:05 BoogieIcfgContainer [2022-07-20 06:07:05,878 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 06:07:05,879 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 06:07:05,879 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 06:07:05,882 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 06:07:05,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 06:07:05" (1/3) ... [2022-07-20 06:07:05,882 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2061c15d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:07:05, skipping insertion in model container [2022-07-20 06:07:05,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:07:05" (2/3) ... [2022-07-20 06:07:05,883 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2061c15d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:07:05, skipping insertion in model container [2022-07-20 06:07:05,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:07:05" (3/3) ... [2022-07-20 06:07:05,884 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-01-1.i [2022-07-20 06:07:05,893 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 06:07:05,894 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 78 error locations. [2022-07-20 06:07:05,969 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 06:07:05,974 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@3aef66ae, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@750bb7b1 [2022-07-20 06:07:05,974 INFO L358 AbstractCegarLoop]: Starting to check reachability of 78 error locations. [2022-07-20 06:07:05,979 INFO L276 IsEmpty]: Start isEmpty. Operand has 190 states, 111 states have (on average 2.18018018018018) internal successors, (242), 189 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:05,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-20 06:07:05,992 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:05,992 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-20 06:07:05,992 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:07:05,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:05,998 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-20 06:07:06,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:06,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412331080] [2022-07-20 06:07:06,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:06,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:06,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:06,128 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-20 06:07:06,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:06,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412331080] [2022-07-20 06:07:06,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412331080] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:06,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:06,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:07:06,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265050461] [2022-07-20 06:07:06,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:06,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:07:06,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:06,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:07:06,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:07:06,161 INFO L87 Difference]: Start difference. First operand has 190 states, 111 states have (on average 2.18018018018018) internal successors, (242), 189 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:06,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:06,312 INFO L93 Difference]: Finished difference Result 192 states and 201 transitions. [2022-07-20 06:07:06,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:07:06,314 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-20 06:07:06,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:06,324 INFO L225 Difference]: With dead ends: 192 [2022-07-20 06:07:06,324 INFO L226 Difference]: Without dead ends: 188 [2022-07-20 06:07:06,326 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-20 06:07:06,331 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 182 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:06,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 119 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:07:06,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-07-20 06:07:06,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 183. [2022-07-20 06:07:06,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 113 states have (on average 1.7256637168141593) internal successors, (195), 182 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:06,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 195 transitions. [2022-07-20 06:07:06,370 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 195 transitions. Word has length 3 [2022-07-20 06:07:06,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:06,370 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 195 transitions. [2022-07-20 06:07:06,371 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-20 06:07:06,371 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 195 transitions. [2022-07-20 06:07:06,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-20 06:07:06,371 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:06,371 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-20 06:07:06,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 06:07:06,372 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:07:06,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:06,373 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-20 06:07:06,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:06,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879316939] [2022-07-20 06:07:06,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:06,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:06,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:06,438 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-20 06:07:06,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:06,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879316939] [2022-07-20 06:07:06,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879316939] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:06,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:06,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:07:06,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173721282] [2022-07-20 06:07:06,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:06,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:07:06,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:06,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:07:06,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:07:06,443 INFO L87 Difference]: Start difference. First operand 183 states and 195 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:06,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:06,541 INFO L93 Difference]: Finished difference Result 213 states and 224 transitions. [2022-07-20 06:07:06,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:07:06,542 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-20 06:07:06,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:06,546 INFO L225 Difference]: With dead ends: 213 [2022-07-20 06:07:06,555 INFO L226 Difference]: Without dead ends: 213 [2022-07-20 06:07:06,556 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-20 06:07:06,557 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 172 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:06,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 145 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:07:06,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-07-20 06:07:06,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 193. [2022-07-20 06:07:06,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 130 states have (on average 1.6615384615384616) internal successors, (216), 192 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:06,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 216 transitions. [2022-07-20 06:07:06,571 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 216 transitions. Word has length 3 [2022-07-20 06:07:06,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:06,571 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 216 transitions. [2022-07-20 06:07:06,572 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-20 06:07:06,573 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 216 transitions. [2022-07-20 06:07:06,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-20 06:07:06,574 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:06,574 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-20 06:07:06,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 06:07:06,574 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:07:06,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:06,575 INFO L85 PathProgramCache]: Analyzing trace with hash 28691969, now seen corresponding path program 1 times [2022-07-20 06:07:06,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:06,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672836942] [2022-07-20 06:07:06,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:06,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:06,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:06,605 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-20 06:07:06,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:06,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672836942] [2022-07-20 06:07:06,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672836942] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:06,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:06,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:07:06,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920503530] [2022-07-20 06:07:06,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:06,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:07:06,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:06,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:07:06,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:07:06,608 INFO L87 Difference]: Start difference. First operand 193 states and 216 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:06,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:06,634 INFO L93 Difference]: Finished difference Result 208 states and 219 transitions. [2022-07-20 06:07:06,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:07:06,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-20 06:07:06,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:06,635 INFO L225 Difference]: With dead ends: 208 [2022-07-20 06:07:06,635 INFO L226 Difference]: Without dead ends: 208 [2022-07-20 06:07:06,636 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-20 06:07:06,638 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 169 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:06,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 196 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:07:06,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-07-20 06:07:06,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 191. [2022-07-20 06:07:06,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 129 states have (on average 1.6511627906976745) internal successors, (213), 190 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:06,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 213 transitions. [2022-07-20 06:07:06,658 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 213 transitions. Word has length 5 [2022-07-20 06:07:06,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:06,658 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 213 transitions. [2022-07-20 06:07:06,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:06,658 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 213 transitions. [2022-07-20 06:07:06,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-20 06:07:06,658 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:06,658 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:07:06,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 06:07:06,659 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:07:06,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:06,659 INFO L85 PathProgramCache]: Analyzing trace with hash -618617197, now seen corresponding path program 1 times [2022-07-20 06:07:06,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:06,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745140387] [2022-07-20 06:07:06,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:06,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:06,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:06,724 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-20 06:07:06,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:06,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745140387] [2022-07-20 06:07:06,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745140387] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:06,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:06,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:07:06,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744068142] [2022-07-20 06:07:06,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:06,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:07:06,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:06,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:07:06,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:07:06,728 INFO L87 Difference]: Start difference. First operand 191 states and 213 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:06,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:06,869 INFO L93 Difference]: Finished difference Result 190 states and 212 transitions. [2022-07-20 06:07:06,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:07:06,869 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-20 06:07:06,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:06,870 INFO L225 Difference]: With dead ends: 190 [2022-07-20 06:07:06,870 INFO L226 Difference]: Without dead ends: 190 [2022-07-20 06:07:06,870 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-20 06:07:06,871 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 4 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:06,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 518 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:07:06,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-07-20 06:07:06,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2022-07-20 06:07:06,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 129 states have (on average 1.6434108527131783) internal successors, (212), 189 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:06,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 212 transitions. [2022-07-20 06:07:06,875 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 212 transitions. Word has length 11 [2022-07-20 06:07:06,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:06,875 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 212 transitions. [2022-07-20 06:07:06,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:06,875 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 212 transitions. [2022-07-20 06:07:06,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-20 06:07:06,876 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:06,876 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:07:06,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 06:07:06,876 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:07:06,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:06,877 INFO L85 PathProgramCache]: Analyzing trace with hash -618617196, now seen corresponding path program 1 times [2022-07-20 06:07:06,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:06,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109642648] [2022-07-20 06:07:06,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:06,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:06,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:06,941 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-20 06:07:06,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:06,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109642648] [2022-07-20 06:07:06,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109642648] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:06,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:06,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:07:06,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738040675] [2022-07-20 06:07:06,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:06,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:07:06,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:06,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:07:06,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:07:06,945 INFO L87 Difference]: Start difference. First operand 190 states and 212 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:07,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:07,065 INFO L93 Difference]: Finished difference Result 189 states and 211 transitions. [2022-07-20 06:07:07,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:07:07,065 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-20 06:07:07,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:07,066 INFO L225 Difference]: With dead ends: 189 [2022-07-20 06:07:07,066 INFO L226 Difference]: Without dead ends: 189 [2022-07-20 06:07:07,066 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-20 06:07:07,067 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 2 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:07,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 529 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:07:07,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-07-20 06:07:07,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2022-07-20 06:07:07,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 129 states have (on average 1.6356589147286822) internal successors, (211), 188 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:07,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 211 transitions. [2022-07-20 06:07:07,071 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 211 transitions. Word has length 11 [2022-07-20 06:07:07,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:07,072 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 211 transitions. [2022-07-20 06:07:07,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:07,072 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 211 transitions. [2022-07-20 06:07:07,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-20 06:07:07,072 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:07,072 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:07:07,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-20 06:07:07,073 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:07:07,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:07,073 INFO L85 PathProgramCache]: Analyzing trace with hash -2054096635, now seen corresponding path program 1 times [2022-07-20 06:07:07,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:07,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912170370] [2022-07-20 06:07:07,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:07,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:07,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:07,111 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-20 06:07:07,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:07,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912170370] [2022-07-20 06:07:07,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912170370] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:07,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:07,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:07:07,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977747120] [2022-07-20 06:07:07,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:07,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:07:07,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:07,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:07:07,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:07:07,113 INFO L87 Difference]: Start difference. First operand 189 states and 211 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:07,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:07,118 INFO L93 Difference]: Finished difference Result 190 states and 212 transitions. [2022-07-20 06:07:07,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:07:07,119 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-20 06:07:07,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:07,120 INFO L225 Difference]: With dead ends: 190 [2022-07-20 06:07:07,120 INFO L226 Difference]: Without dead ends: 190 [2022-07-20 06:07:07,120 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-20 06:07:07,120 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 0 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:07,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 348 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:07:07,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-07-20 06:07:07,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2022-07-20 06:07:07,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 130 states have (on average 1.6307692307692307) internal successors, (212), 189 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:07,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 212 transitions. [2022-07-20 06:07:07,123 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 212 transitions. Word has length 13 [2022-07-20 06:07:07,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:07,124 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 212 transitions. [2022-07-20 06:07:07,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:07,124 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 212 transitions. [2022-07-20 06:07:07,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-20 06:07:07,124 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:07,124 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:07:07,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-20 06:07:07,125 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:07:07,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:07,125 INFO L85 PathProgramCache]: Analyzing trace with hash 479764253, now seen corresponding path program 1 times [2022-07-20 06:07:07,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:07,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785336357] [2022-07-20 06:07:07,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:07,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:07,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:07,221 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-20 06:07:07,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:07,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785336357] [2022-07-20 06:07:07,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785336357] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:07,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:07,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 06:07:07,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200318221] [2022-07-20 06:07:07,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:07,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 06:07:07,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:07,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 06:07:07,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:07:07,223 INFO L87 Difference]: Start difference. First operand 190 states and 212 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:07,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:07,411 INFO L93 Difference]: Finished difference Result 190 states and 211 transitions. [2022-07-20 06:07:07,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 06:07:07,412 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-20 06:07:07,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:07,412 INFO L225 Difference]: With dead ends: 190 [2022-07-20 06:07:07,412 INFO L226 Difference]: Without dead ends: 190 [2022-07-20 06:07:07,413 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-20 06:07:07,413 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 168 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:07,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 441 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:07:07,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-07-20 06:07:07,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2022-07-20 06:07:07,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 130 states have (on average 1.623076923076923) internal successors, (211), 188 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:07,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 211 transitions. [2022-07-20 06:07:07,416 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 211 transitions. Word has length 14 [2022-07-20 06:07:07,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:07,417 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 211 transitions. [2022-07-20 06:07:07,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:07,417 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 211 transitions. [2022-07-20 06:07:07,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-20 06:07:07,417 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:07,417 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:07:07,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-20 06:07:07,418 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:07:07,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:07,418 INFO L85 PathProgramCache]: Analyzing trace with hash 479764254, now seen corresponding path program 1 times [2022-07-20 06:07:07,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:07,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156770568] [2022-07-20 06:07:07,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:07,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:07,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:07,501 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-20 06:07:07,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:07,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156770568] [2022-07-20 06:07:07,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156770568] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:07,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:07,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 06:07:07,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713103849] [2022-07-20 06:07:07,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:07,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 06:07:07,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:07,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 06:07:07,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:07:07,503 INFO L87 Difference]: Start difference. First operand 189 states and 211 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:07,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:07,781 INFO L93 Difference]: Finished difference Result 189 states and 210 transitions. [2022-07-20 06:07:07,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 06:07:07,781 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-20 06:07:07,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:07,782 INFO L225 Difference]: With dead ends: 189 [2022-07-20 06:07:07,782 INFO L226 Difference]: Without dead ends: 189 [2022-07-20 06:07:07,782 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-20 06:07:07,783 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 162 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:07,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 479 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:07:07,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-07-20 06:07:07,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 188. [2022-07-20 06:07:07,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 130 states have (on average 1.6153846153846154) internal successors, (210), 187 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:07,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 210 transitions. [2022-07-20 06:07:07,786 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 210 transitions. Word has length 14 [2022-07-20 06:07:07,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:07,787 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 210 transitions. [2022-07-20 06:07:07,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:07,787 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 210 transitions. [2022-07-20 06:07:07,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-20 06:07:07,787 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:07,788 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:07:07,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-20 06:07:07,788 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:07:07,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:07,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1699725866, now seen corresponding path program 1 times [2022-07-20 06:07:07,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:07,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160458615] [2022-07-20 06:07:07,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:07,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:07,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:07,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:07:07,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:07,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160458615] [2022-07-20 06:07:07,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160458615] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:07,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:07,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 06:07:07,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483931129] [2022-07-20 06:07:07,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:07,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 06:07:07,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:07,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 06:07:07,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:07:07,847 INFO L87 Difference]: Start difference. First operand 188 states and 210 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:08,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:08,013 INFO L93 Difference]: Finished difference Result 275 states and 303 transitions. [2022-07-20 06:07:08,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 06:07:08,013 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-20 06:07:08,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:08,014 INFO L225 Difference]: With dead ends: 275 [2022-07-20 06:07:08,014 INFO L226 Difference]: Without dead ends: 275 [2022-07-20 06:07:08,014 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-20 06:07:08,015 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 193 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:08,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 699 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:07:08,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-07-20 06:07:08,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 185. [2022-07-20 06:07:08,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 128 states have (on average 1.6171875) internal successors, (207), 184 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:08,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 207 transitions. [2022-07-20 06:07:08,018 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 207 transitions. Word has length 15 [2022-07-20 06:07:08,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:08,019 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 207 transitions. [2022-07-20 06:07:08,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:08,019 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 207 transitions. [2022-07-20 06:07:08,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-20 06:07:08,019 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:08,019 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:07:08,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-20 06:07:08,020 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:07:08,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:08,020 INFO L85 PathProgramCache]: Analyzing trace with hash -99613104, now seen corresponding path program 1 times [2022-07-20 06:07:08,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:08,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953808158] [2022-07-20 06:07:08,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:08,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:08,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:08,053 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-20 06:07:08,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:08,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953808158] [2022-07-20 06:07:08,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953808158] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:08,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:08,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 06:07:08,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368369873] [2022-07-20 06:07:08,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:08,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:07:08,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:08,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:07:08,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:07:08,055 INFO L87 Difference]: Start difference. First operand 185 states and 207 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:08,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:08,137 INFO L93 Difference]: Finished difference Result 276 states and 303 transitions. [2022-07-20 06:07:08,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 06:07:08,138 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-20 06:07:08,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:08,138 INFO L225 Difference]: With dead ends: 276 [2022-07-20 06:07:08,139 INFO L226 Difference]: Without dead ends: 276 [2022-07-20 06:07:08,139 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-20 06:07:08,139 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 100 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:08,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 582 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:07:08,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2022-07-20 06:07:08,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 188. [2022-07-20 06:07:08,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 131 states have (on average 1.6030534351145038) internal successors, (210), 187 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:08,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 210 transitions. [2022-07-20 06:07:08,143 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 210 transitions. Word has length 17 [2022-07-20 06:07:08,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:08,143 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 210 transitions. [2022-07-20 06:07:08,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:08,143 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 210 transitions. [2022-07-20 06:07:08,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-20 06:07:08,144 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:08,144 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:07:08,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-20 06:07:08,144 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:07:08,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:08,145 INFO L85 PathProgramCache]: Analyzing trace with hash -582241035, now seen corresponding path program 1 times [2022-07-20 06:07:08,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:08,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181861673] [2022-07-20 06:07:08,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:08,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:08,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:08,193 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-20 06:07:08,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:08,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181861673] [2022-07-20 06:07:08,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181861673] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:08,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:08,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 06:07:08,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655367830] [2022-07-20 06:07:08,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:08,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:07:08,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:08,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:07:08,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:07:08,195 INFO L87 Difference]: Start difference. First operand 188 states and 210 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:08,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:08,352 INFO L93 Difference]: Finished difference Result 248 states and 263 transitions. [2022-07-20 06:07:08,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 06:07:08,352 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-20 06:07:08,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:08,353 INFO L225 Difference]: With dead ends: 248 [2022-07-20 06:07:08,353 INFO L226 Difference]: Without dead ends: 248 [2022-07-20 06:07:08,353 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-20 06:07:08,354 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 488 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:08,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 186 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:07:08,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-07-20 06:07:08,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 211. [2022-07-20 06:07:08,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 154 states have (on average 1.603896103896104) internal successors, (247), 210 states have internal predecessors, (247), 0 states have call successors, (0), 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-20 06:07:08,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 247 transitions. [2022-07-20 06:07:08,357 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 247 transitions. Word has length 19 [2022-07-20 06:07:08,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:08,358 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 247 transitions. [2022-07-20 06:07:08,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:08,358 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 247 transitions. [2022-07-20 06:07:08,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-20 06:07:08,358 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:08,358 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:07:08,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-20 06:07:08,359 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:07:08,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:08,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1187837214, now seen corresponding path program 1 times [2022-07-20 06:07:08,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:08,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95027381] [2022-07-20 06:07:08,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:08,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:08,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:08,379 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-20 06:07:08,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:08,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95027381] [2022-07-20 06:07:08,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95027381] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:08,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:08,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:07:08,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498561144] [2022-07-20 06:07:08,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:08,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:07:08,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:08,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:07:08,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:07:08,381 INFO L87 Difference]: Start difference. First operand 211 states and 247 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:08,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:08,452 INFO L93 Difference]: Finished difference Result 243 states and 257 transitions. [2022-07-20 06:07:08,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 06:07:08,452 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-20 06:07:08,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:08,454 INFO L225 Difference]: With dead ends: 243 [2022-07-20 06:07:08,454 INFO L226 Difference]: Without dead ends: 243 [2022-07-20 06:07:08,454 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-20 06:07:08,455 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 228 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:08,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 277 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:07:08,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-07-20 06:07:08,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 209. [2022-07-20 06:07:08,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 153 states have (on average 1.5947712418300655) internal successors, (244), 208 states have internal predecessors, (244), 0 states have call successors, (0), 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-20 06:07:08,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 244 transitions. [2022-07-20 06:07:08,458 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 244 transitions. Word has length 21 [2022-07-20 06:07:08,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:08,459 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 244 transitions. [2022-07-20 06:07:08,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:08,459 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 244 transitions. [2022-07-20 06:07:08,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-20 06:07:08,460 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:08,460 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-20 06:07:08,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-20 06:07:08,460 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:07:08,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:08,460 INFO L85 PathProgramCache]: Analyzing trace with hash 903845878, now seen corresponding path program 1 times [2022-07-20 06:07:08,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:08,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161748783] [2022-07-20 06:07:08,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:08,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:08,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:08,489 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-20 06:07:08,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:08,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161748783] [2022-07-20 06:07:08,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161748783] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:08,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:08,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 06:07:08,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422923681] [2022-07-20 06:07:08,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:08,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:07:08,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:08,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:07:08,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:07:08,491 INFO L87 Difference]: Start difference. First operand 209 states and 244 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:08,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:08,632 INFO L93 Difference]: Finished difference Result 198 states and 231 transitions. [2022-07-20 06:07:08,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 06:07:08,632 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-20 06:07:08,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:08,633 INFO L225 Difference]: With dead ends: 198 [2022-07-20 06:07:08,633 INFO L226 Difference]: Without dead ends: 198 [2022-07-20 06:07:08,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-20 06:07:08,634 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 98 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:08,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 427 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:07:08,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-07-20 06:07:08,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2022-07-20 06:07:08,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 153 states have (on average 1.5032679738562091) internal successors, (230), 196 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:08,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 230 transitions. [2022-07-20 06:07:08,637 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 230 transitions. Word has length 23 [2022-07-20 06:07:08,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:08,637 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 230 transitions. [2022-07-20 06:07:08,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:08,638 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 230 transitions. [2022-07-20 06:07:08,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-20 06:07:08,638 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:08,638 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-20 06:07:08,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-20 06:07:08,639 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:07:08,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:08,639 INFO L85 PathProgramCache]: Analyzing trace with hash 903845879, now seen corresponding path program 1 times [2022-07-20 06:07:08,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:08,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378767541] [2022-07-20 06:07:08,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:08,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:08,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:08,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-20 06:07:08,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:08,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378767541] [2022-07-20 06:07:08,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378767541] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:08,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:08,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 06:07:08,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510498728] [2022-07-20 06:07:08,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:08,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:07:08,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:08,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:07:08,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:07:08,683 INFO L87 Difference]: Start difference. First operand 197 states and 230 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:08,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:08,845 INFO L93 Difference]: Finished difference Result 190 states and 223 transitions. [2022-07-20 06:07:08,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 06:07:08,846 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-20 06:07:08,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:08,846 INFO L225 Difference]: With dead ends: 190 [2022-07-20 06:07:08,847 INFO L226 Difference]: Without dead ends: 190 [2022-07-20 06:07:08,847 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-07-20 06:07:08,847 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 41 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:08,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 488 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:07:08,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-07-20 06:07:08,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 183. [2022-07-20 06:07:08,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 148 states have (on average 1.4527027027027026) internal successors, (215), 182 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:08,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 215 transitions. [2022-07-20 06:07:08,850 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 215 transitions. Word has length 23 [2022-07-20 06:07:08,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:08,850 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 215 transitions. [2022-07-20 06:07:08,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:08,850 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 215 transitions. [2022-07-20 06:07:08,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-20 06:07:08,850 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:08,851 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:07:08,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-20 06:07:08,851 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:07:08,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:08,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1012497526, now seen corresponding path program 1 times [2022-07-20 06:07:08,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:08,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054207096] [2022-07-20 06:07:08,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:08,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:08,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:08,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-20 06:07:08,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:08,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054207096] [2022-07-20 06:07:08,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054207096] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:08,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:08,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 06:07:08,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876335472] [2022-07-20 06:07:08,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:08,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:07:08,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:08,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:07:08,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:07:08,896 INFO L87 Difference]: Start difference. First operand 183 states and 215 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:08,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:08,999 INFO L93 Difference]: Finished difference Result 186 states and 219 transitions. [2022-07-20 06:07:08,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 06:07:08,999 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-07-20 06:07:09,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:09,001 INFO L225 Difference]: With dead ends: 186 [2022-07-20 06:07:09,001 INFO L226 Difference]: Without dead ends: 186 [2022-07-20 06:07:09,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-07-20 06:07:09,003 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 38 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:09,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 592 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:07:09,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-07-20 06:07:09,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 179. [2022-07-20 06:07:09,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 146 states have (on average 1.4452054794520548) internal successors, (211), 178 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:09,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 211 transitions. [2022-07-20 06:07:09,007 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 211 transitions. Word has length 25 [2022-07-20 06:07:09,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:09,007 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 211 transitions. [2022-07-20 06:07:09,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:09,007 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 211 transitions. [2022-07-20 06:07:09,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-20 06:07:09,010 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:09,010 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-20 06:07:09,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-20 06:07:09,010 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:07:09,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:09,011 INFO L85 PathProgramCache]: Analyzing trace with hash 476921454, now seen corresponding path program 1 times [2022-07-20 06:07:09,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:09,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494161613] [2022-07-20 06:07:09,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:09,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:09,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:09,042 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-20 06:07:09,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:09,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494161613] [2022-07-20 06:07:09,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494161613] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:09,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:09,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:07:09,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038845302] [2022-07-20 06:07:09,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:09,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:07:09,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:09,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:07:09,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:07:09,045 INFO L87 Difference]: Start difference. First operand 179 states and 211 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:09,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:09,051 INFO L93 Difference]: Finished difference Result 252 states and 299 transitions. [2022-07-20 06:07:09,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:07:09,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-20 06:07:09,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:09,054 INFO L225 Difference]: With dead ends: 252 [2022-07-20 06:07:09,054 INFO L226 Difference]: Without dead ends: 252 [2022-07-20 06:07:09,054 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-20 06:07:09,055 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 50 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:09,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 283 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:07:09,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2022-07-20 06:07:09,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 185. [2022-07-20 06:07:09,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 152 states have (on average 1.4407894736842106) internal successors, (219), 184 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:09,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 219 transitions. [2022-07-20 06:07:09,059 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 219 transitions. Word has length 27 [2022-07-20 06:07:09,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:09,060 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 219 transitions. [2022-07-20 06:07:09,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:09,060 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 219 transitions. [2022-07-20 06:07:09,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-20 06:07:09,061 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:09,061 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-20 06:07:09,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-20 06:07:09,061 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:07:09,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:09,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1899651814, now seen corresponding path program 1 times [2022-07-20 06:07:09,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:09,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235114455] [2022-07-20 06:07:09,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:09,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:09,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:09,098 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-20 06:07:09,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:09,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235114455] [2022-07-20 06:07:09,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235114455] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:09,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:09,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:07:09,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055571604] [2022-07-20 06:07:09,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:09,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:07:09,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:09,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:07:09,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:07:09,099 INFO L87 Difference]: Start difference. First operand 185 states and 219 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:09,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:09,110 INFO L93 Difference]: Finished difference Result 183 states and 216 transitions. [2022-07-20 06:07:09,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:07:09,110 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-20 06:07:09,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:09,111 INFO L225 Difference]: With dead ends: 183 [2022-07-20 06:07:09,111 INFO L226 Difference]: Without dead ends: 183 [2022-07-20 06:07:09,111 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-20 06:07:09,112 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 20 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:09,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 254 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:07:09,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-07-20 06:07:09,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2022-07-20 06:07:09,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 151 states have (on average 1.4304635761589404) internal successors, (216), 182 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:09,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 216 transitions. [2022-07-20 06:07:09,115 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 216 transitions. Word has length 28 [2022-07-20 06:07:09,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:09,115 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 216 transitions. [2022-07-20 06:07:09,115 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-20 06:07:09,115 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 216 transitions. [2022-07-20 06:07:09,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-20 06:07:09,116 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:09,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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:07:09,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-20 06:07:09,116 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:07:09,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:09,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1240331581, now seen corresponding path program 1 times [2022-07-20 06:07:09,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:09,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869007927] [2022-07-20 06:07:09,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:09,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:09,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:09,200 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-20 06:07:09,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:09,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869007927] [2022-07-20 06:07:09,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869007927] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:09,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:09,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 06:07:09,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28845091] [2022-07-20 06:07:09,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:09,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 06:07:09,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:09,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 06:07:09,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-20 06:07:09,202 INFO L87 Difference]: Start difference. First operand 183 states and 216 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:09,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:09,461 INFO L93 Difference]: Finished difference Result 308 states and 341 transitions. [2022-07-20 06:07:09,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 06:07:09,461 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-20 06:07:09,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:09,462 INFO L225 Difference]: With dead ends: 308 [2022-07-20 06:07:09,462 INFO L226 Difference]: Without dead ends: 308 [2022-07-20 06:07:09,462 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-20 06:07:09,463 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 390 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:09,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 783 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:07:09,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2022-07-20 06:07:09,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 216. [2022-07-20 06:07:09,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 184 states have (on average 1.3804347826086956) internal successors, (254), 215 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:09,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 254 transitions. [2022-07-20 06:07:09,466 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 254 transitions. Word has length 29 [2022-07-20 06:07:09,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:09,466 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 254 transitions. [2022-07-20 06:07:09,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:09,466 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 254 transitions. [2022-07-20 06:07:09,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-20 06:07:09,466 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:09,467 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:07:09,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-20 06:07:09,467 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:07:09,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:09,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1786976426, now seen corresponding path program 1 times [2022-07-20 06:07:09,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:09,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801097658] [2022-07-20 06:07:09,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:09,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:09,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:09,509 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-20 06:07:09,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:09,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801097658] [2022-07-20 06:07:09,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801097658] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:07:09,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52098920] [2022-07-20 06:07:09,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:09,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:07:09,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:07:09,512 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-20 06:07:09,547 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-20 06:07:09,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:09,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-20 06:07:09,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:07:09,672 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-20 06:07:09,677 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-20 06:07:09,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:07:09,716 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-20 06:07:09,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:07:09,721 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-20 06:07:09,811 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:07:09,812 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-20 06:07:09,816 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:07:09,818 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:07:09,818 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-20 06:07:09,825 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-20 06:07:09,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:07:10,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2022-07-20 06:07:10,825 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:07:10,827 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-20 06:07:10,839 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2022-07-20 06:07:10,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:07:10,842 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:07:10,852 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-20 06:07:10,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52098920] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:07:10,852 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:07:10,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 8] total 13 [2022-07-20 06:07:10,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467664615] [2022-07-20 06:07:10,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:07:10,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-20 06:07:10,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:10,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-20 06:07:10,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=123, Unknown=1, NotChecked=0, Total=156 [2022-07-20 06:07:10,854 INFO L87 Difference]: Start difference. First operand 216 states and 254 transitions. Second operand has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:11,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:11,344 INFO L93 Difference]: Finished difference Result 481 states and 540 transitions. [2022-07-20 06:07:11,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-20 06:07:11,345 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-20 06:07:11,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:11,347 INFO L225 Difference]: With dead ends: 481 [2022-07-20 06:07:11,347 INFO L226 Difference]: Without dead ends: 481 [2022-07-20 06:07:11,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=148, Invalid=451, Unknown=1, NotChecked=0, Total=600 [2022-07-20 06:07:11,348 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 812 mSDsluCounter, 1075 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 812 SdHoareTripleChecker+Valid, 1240 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:11,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [812 Valid, 1240 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 428 Invalid, 0 Unknown, 105 Unchecked, 0.2s Time] [2022-07-20 06:07:11,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2022-07-20 06:07:11,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 251. [2022-07-20 06:07:11,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 219 states have (on average 1.3789954337899544) internal successors, (302), 250 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:11,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 302 transitions. [2022-07-20 06:07:11,353 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 302 transitions. Word has length 31 [2022-07-20 06:07:11,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:11,354 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 302 transitions. [2022-07-20 06:07:11,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:11,354 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 302 transitions. [2022-07-20 06:07:11,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-20 06:07:11,354 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:11,354 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:07:11,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-20 06:07:11,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:07:11,567 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:07:11,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:11,568 INFO L85 PathProgramCache]: Analyzing trace with hash 883081196, now seen corresponding path program 1 times [2022-07-20 06:07:11,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:11,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848144151] [2022-07-20 06:07:11,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:11,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:11,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:11,609 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-20 06:07:11,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:11,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848144151] [2022-07-20 06:07:11,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848144151] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:11,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:11,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:07:11,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219626991] [2022-07-20 06:07:11,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:11,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:07:11,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:11,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:07:11,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:07:11,611 INFO L87 Difference]: Start difference. First operand 251 states and 302 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:11,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:11,704 INFO L93 Difference]: Finished difference Result 250 states and 301 transitions. [2022-07-20 06:07:11,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:07:11,704 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-07-20 06:07:11,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:11,705 INFO L225 Difference]: With dead ends: 250 [2022-07-20 06:07:11,705 INFO L226 Difference]: Without dead ends: 250 [2022-07-20 06:07:11,705 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-20 06:07:11,706 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 4 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:11,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 408 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:07:11,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-07-20 06:07:11,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2022-07-20 06:07:11,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 219 states have (on average 1.3744292237442923) internal successors, (301), 249 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:11,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 301 transitions. [2022-07-20 06:07:11,714 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 301 transitions. Word has length 33 [2022-07-20 06:07:11,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:11,714 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 301 transitions. [2022-07-20 06:07:11,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:11,714 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 301 transitions. [2022-07-20 06:07:11,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-20 06:07:11,715 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:11,715 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:07:11,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-20 06:07:11,715 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:07:11,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:11,716 INFO L85 PathProgramCache]: Analyzing trace with hash 883081197, now seen corresponding path program 1 times [2022-07-20 06:07:11,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:11,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386476485] [2022-07-20 06:07:11,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:11,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:11,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:11,763 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-20 06:07:11,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:11,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386476485] [2022-07-20 06:07:11,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386476485] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:11,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:11,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:07:11,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539798025] [2022-07-20 06:07:11,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:11,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:07:11,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:11,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:07:11,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:07:11,766 INFO L87 Difference]: Start difference. First operand 250 states and 301 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:11,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:11,872 INFO L93 Difference]: Finished difference Result 249 states and 300 transitions. [2022-07-20 06:07:11,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:07:11,872 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-07-20 06:07:11,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:11,873 INFO L225 Difference]: With dead ends: 249 [2022-07-20 06:07:11,873 INFO L226 Difference]: Without dead ends: 249 [2022-07-20 06:07:11,873 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-20 06:07:11,874 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 2 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:11,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 411 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:07:11,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-07-20 06:07:11,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2022-07-20 06:07:11,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 219 states have (on average 1.36986301369863) internal successors, (300), 248 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:11,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 300 transitions. [2022-07-20 06:07:11,877 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 300 transitions. Word has length 33 [2022-07-20 06:07:11,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:11,877 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 300 transitions. [2022-07-20 06:07:11,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:11,878 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 300 transitions. [2022-07-20 06:07:11,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-20 06:07:11,878 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:11,878 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:07:11,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-20 06:07:11,878 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:07:11,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:11,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1776374941, now seen corresponding path program 1 times [2022-07-20 06:07:11,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:11,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257371138] [2022-07-20 06:07:11,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:11,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:11,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:11,974 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-20 06:07:11,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:11,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257371138] [2022-07-20 06:07:11,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257371138] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:11,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:11,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-20 06:07:11,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636817283] [2022-07-20 06:07:11,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:11,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 06:07:11,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:11,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 06:07:11,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-07-20 06:07:11,977 INFO L87 Difference]: Start difference. First operand 249 states and 300 transitions. Second operand has 11 states, 10 states have (on average 3.4) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:12,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:12,402 INFO L93 Difference]: Finished difference Result 364 states and 406 transitions. [2022-07-20 06:07:12,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-20 06:07:12,404 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-20 06:07:12,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:12,405 INFO L225 Difference]: With dead ends: 364 [2022-07-20 06:07:12,405 INFO L226 Difference]: Without dead ends: 364 [2022-07-20 06:07:12,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2022-07-20 06:07:12,406 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 491 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:12,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 973 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 06:07:12,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2022-07-20 06:07:12,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 250. [2022-07-20 06:07:12,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 222 states have (on average 1.3423423423423424) internal successors, (298), 249 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:12,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 298 transitions. [2022-07-20 06:07:12,409 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 298 transitions. Word has length 34 [2022-07-20 06:07:12,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:12,409 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 298 transitions. [2022-07-20 06:07:12,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:12,410 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 298 transitions. [2022-07-20 06:07:12,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-20 06:07:12,410 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:12,410 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:07:12,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-20 06:07:12,410 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:07:12,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:12,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1776374942, now seen corresponding path program 1 times [2022-07-20 06:07:12,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:12,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072500710] [2022-07-20 06:07:12,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:12,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:12,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:12,543 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-20 06:07:12,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:12,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072500710] [2022-07-20 06:07:12,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072500710] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:12,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:12,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-20 06:07:12,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305365099] [2022-07-20 06:07:12,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:12,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-20 06:07:12,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:12,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-20 06:07:12,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-07-20 06:07:12,545 INFO L87 Difference]: Start difference. First operand 250 states and 298 transitions. Second operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:13,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:13,064 INFO L93 Difference]: Finished difference Result 428 states and 464 transitions. [2022-07-20 06:07:13,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-20 06:07:13,064 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-20 06:07:13,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:13,066 INFO L225 Difference]: With dead ends: 428 [2022-07-20 06:07:13,066 INFO L226 Difference]: Without dead ends: 428 [2022-07-20 06:07:13,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2022-07-20 06:07:13,066 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 739 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 739 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:13,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [739 Valid, 922 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-20 06:07:13,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2022-07-20 06:07:13,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 256. [2022-07-20 06:07:13,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 228 states have (on average 1.337719298245614) internal successors, (305), 255 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:13,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 305 transitions. [2022-07-20 06:07:13,071 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 305 transitions. Word has length 34 [2022-07-20 06:07:13,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:13,071 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 305 transitions. [2022-07-20 06:07:13,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:13,071 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 305 transitions. [2022-07-20 06:07:13,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-20 06:07:13,071 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:13,072 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-20 06:07:13,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-20 06:07:13,072 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:07:13,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:13,072 INFO L85 PathProgramCache]: Analyzing trace with hash -2030948706, now seen corresponding path program 1 times [2022-07-20 06:07:13,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:13,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500587669] [2022-07-20 06:07:13,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:13,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:13,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:13,090 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-20 06:07:13,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:13,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500587669] [2022-07-20 06:07:13,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500587669] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:13,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:13,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:07:13,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565953215] [2022-07-20 06:07:13,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:13,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:07:13,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:13,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:07:13,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:07:13,092 INFO L87 Difference]: Start difference. First operand 256 states and 305 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:13,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:13,098 INFO L93 Difference]: Finished difference Result 258 states and 307 transitions. [2022-07-20 06:07:13,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:07:13,098 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-07-20 06:07:13,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:13,099 INFO L225 Difference]: With dead ends: 258 [2022-07-20 06:07:13,099 INFO L226 Difference]: Without dead ends: 258 [2022-07-20 06:07:13,099 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-20 06:07:13,100 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:13,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 274 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:07:13,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-07-20 06:07:13,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2022-07-20 06:07:13,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 230 states have (on average 1.3347826086956522) internal successors, (307), 257 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:13,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 307 transitions. [2022-07-20 06:07:13,103 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 307 transitions. Word has length 35 [2022-07-20 06:07:13,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:13,103 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 307 transitions. [2022-07-20 06:07:13,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:13,104 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 307 transitions. [2022-07-20 06:07:13,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-20 06:07:13,104 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:13,104 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:07:13,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-20 06:07:13,105 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:07:13,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:13,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1994309533, now seen corresponding path program 1 times [2022-07-20 06:07:13,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:13,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952912829] [2022-07-20 06:07:13,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:13,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:13,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:13,258 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-20 06:07:13,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:13,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952912829] [2022-07-20 06:07:13,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952912829] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:13,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:13,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-20 06:07:13,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367481479] [2022-07-20 06:07:13,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:13,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-20 06:07:13,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:13,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-20 06:07:13,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-07-20 06:07:13,260 INFO L87 Difference]: Start difference. First operand 258 states and 307 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:13,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:13,867 INFO L93 Difference]: Finished difference Result 420 states and 456 transitions. [2022-07-20 06:07:13,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-20 06:07:13,868 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-20 06:07:13,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:13,869 INFO L225 Difference]: With dead ends: 420 [2022-07-20 06:07:13,869 INFO L226 Difference]: Without dead ends: 420 [2022-07-20 06:07:13,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2022-07-20 06:07:13,870 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 553 mSDsluCounter, 1100 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 1234 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:13,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 1234 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-20 06:07:13,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2022-07-20 06:07:13,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 258. [2022-07-20 06:07:13,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 230 states have (on average 1.3304347826086957) internal successors, (306), 257 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:13,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 306 transitions. [2022-07-20 06:07:13,873 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 306 transitions. Word has length 36 [2022-07-20 06:07:13,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:13,873 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 306 transitions. [2022-07-20 06:07:13,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:13,873 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 306 transitions. [2022-07-20 06:07:13,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-20 06:07:13,874 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:13,874 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:07:13,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-20 06:07:13,874 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:07:13,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:13,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1529477485, now seen corresponding path program 1 times [2022-07-20 06:07:13,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:13,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491180820] [2022-07-20 06:07:13,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:13,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:13,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:13,938 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-20 06:07:13,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:13,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491180820] [2022-07-20 06:07:13,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491180820] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:13,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:13,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 06:07:13,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085615977] [2022-07-20 06:07:13,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:13,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 06:07:13,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:13,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 06:07:13,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:07:13,941 INFO L87 Difference]: Start difference. First operand 258 states and 306 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:14,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:14,086 INFO L93 Difference]: Finished difference Result 273 states and 321 transitions. [2022-07-20 06:07:14,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 06:07:14,097 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-20 06:07:14,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:14,098 INFO L225 Difference]: With dead ends: 273 [2022-07-20 06:07:14,098 INFO L226 Difference]: Without dead ends: 273 [2022-07-20 06:07:14,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-07-20 06:07:14,098 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 49 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:14,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 608 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:07:14,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-07-20 06:07:14,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 267. [2022-07-20 06:07:14,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 239 states have (on average 1.3179916317991631) internal successors, (315), 266 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:14,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 315 transitions. [2022-07-20 06:07:14,102 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 315 transitions. Word has length 36 [2022-07-20 06:07:14,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:14,102 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 315 transitions. [2022-07-20 06:07:14,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:14,102 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 315 transitions. [2022-07-20 06:07:14,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-20 06:07:14,102 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:14,102 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:07:14,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-20 06:07:14,103 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:07:14,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:14,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1197350168, now seen corresponding path program 1 times [2022-07-20 06:07:14,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:14,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675299173] [2022-07-20 06:07:14,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:14,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:14,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:14,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:07:14,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:14,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675299173] [2022-07-20 06:07:14,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675299173] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:14,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:14,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-20 06:07:14,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228752661] [2022-07-20 06:07:14,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:14,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 06:07:14,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:14,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 06:07:14,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-07-20 06:07:14,194 INFO L87 Difference]: Start difference. First operand 267 states and 315 transitions. Second operand has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:14,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:14,465 INFO L93 Difference]: Finished difference Result 267 states and 315 transitions. [2022-07-20 06:07:14,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-20 06:07:14,466 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-20 06:07:14,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:14,467 INFO L225 Difference]: With dead ends: 267 [2022-07-20 06:07:14,467 INFO L226 Difference]: Without dead ends: 267 [2022-07-20 06:07:14,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2022-07-20 06:07:14,468 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 78 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:14,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 721 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:07:14,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-07-20 06:07:14,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 266. [2022-07-20 06:07:14,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 239 states have (on average 1.3138075313807531) internal successors, (314), 265 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:14,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 314 transitions. [2022-07-20 06:07:14,471 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 314 transitions. Word has length 36 [2022-07-20 06:07:14,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:14,472 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 314 transitions. [2022-07-20 06:07:14,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:14,472 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 314 transitions. [2022-07-20 06:07:14,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-20 06:07:14,472 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:14,472 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:07:14,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-20 06:07:14,473 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:07:14,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:14,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1197350169, now seen corresponding path program 1 times [2022-07-20 06:07:14,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:14,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337290419] [2022-07-20 06:07:14,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:14,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:14,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:14,565 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-20 06:07:14,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:14,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337290419] [2022-07-20 06:07:14,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337290419] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:14,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:14,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-20 06:07:14,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233928882] [2022-07-20 06:07:14,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:14,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 06:07:14,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:14,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 06:07:14,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-07-20 06:07:14,567 INFO L87 Difference]: Start difference. First operand 266 states and 314 transitions. Second operand has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:14,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:14,867 INFO L93 Difference]: Finished difference Result 266 states and 314 transitions. [2022-07-20 06:07:14,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-20 06:07:14,867 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-20 06:07:14,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:14,868 INFO L225 Difference]: With dead ends: 266 [2022-07-20 06:07:14,868 INFO L226 Difference]: Without dead ends: 266 [2022-07-20 06:07:14,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2022-07-20 06:07:14,869 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 72 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:14,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 786 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:07:14,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-07-20 06:07:14,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265. [2022-07-20 06:07:14,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 239 states have (on average 1.3096234309623431) internal successors, (313), 264 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:14,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 313 transitions. [2022-07-20 06:07:14,872 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 313 transitions. Word has length 36 [2022-07-20 06:07:14,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:14,872 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 313 transitions. [2022-07-20 06:07:14,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:14,872 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 313 transitions. [2022-07-20 06:07:14,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-20 06:07:14,872 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:14,872 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-20 06:07:14,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-20 06:07:14,873 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:07:14,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:14,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1824914429, now seen corresponding path program 1 times [2022-07-20 06:07:14,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:14,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318087614] [2022-07-20 06:07:14,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:14,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:14,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:14,932 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-20 06:07:14,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:14,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318087614] [2022-07-20 06:07:14,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318087614] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:14,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:14,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 06:07:14,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794181694] [2022-07-20 06:07:14,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:14,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 06:07:14,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:14,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 06:07:14,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:07:14,935 INFO L87 Difference]: Start difference. First operand 265 states and 313 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:15,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:15,084 INFO L93 Difference]: Finished difference Result 275 states and 324 transitions. [2022-07-20 06:07:15,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 06:07:15,084 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-20 06:07:15,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:15,085 INFO L225 Difference]: With dead ends: 275 [2022-07-20 06:07:15,085 INFO L226 Difference]: Without dead ends: 275 [2022-07-20 06:07:15,086 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-20 06:07:15,086 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 31 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:15,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 564 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:07:15,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-07-20 06:07:15,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 261. [2022-07-20 06:07:15,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 236 states have (on average 1.305084745762712) internal successors, (308), 260 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:15,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 308 transitions. [2022-07-20 06:07:15,090 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 308 transitions. Word has length 37 [2022-07-20 06:07:15,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:15,090 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 308 transitions. [2022-07-20 06:07:15,091 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-20 06:07:15,091 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 308 transitions. [2022-07-20 06:07:15,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-20 06:07:15,091 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:15,091 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:07:15,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-20 06:07:15,091 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:07:15,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:15,092 INFO L85 PathProgramCache]: Analyzing trace with hash -886173384, now seen corresponding path program 1 times [2022-07-20 06:07:15,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:15,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063788879] [2022-07-20 06:07:15,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:15,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:15,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:15,112 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-20 06:07:15,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:15,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063788879] [2022-07-20 06:07:15,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063788879] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:15,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:15,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:07:15,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832626807] [2022-07-20 06:07:15,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:15,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:07:15,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:15,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:07:15,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:07:15,114 INFO L87 Difference]: Start difference. First operand 261 states and 308 transitions. Second operand has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:15,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:15,139 INFO L93 Difference]: Finished difference Result 274 states and 312 transitions. [2022-07-20 06:07:15,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:07:15,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-20 06:07:15,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:15,145 INFO L225 Difference]: With dead ends: 274 [2022-07-20 06:07:15,145 INFO L226 Difference]: Without dead ends: 274 [2022-07-20 06:07:15,145 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-20 06:07:15,146 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 91 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:15,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 144 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:07:15,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2022-07-20 06:07:15,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 262. [2022-07-20 06:07:15,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 237 states have (on average 1.3037974683544304) internal successors, (309), 261 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:15,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 309 transitions. [2022-07-20 06:07:15,149 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 309 transitions. Word has length 38 [2022-07-20 06:07:15,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:15,150 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 309 transitions. [2022-07-20 06:07:15,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:15,150 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 309 transitions. [2022-07-20 06:07:15,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-20 06:07:15,150 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:15,150 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-20 06:07:15,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-20 06:07:15,151 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:07:15,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:15,151 INFO L85 PathProgramCache]: Analyzing trace with hash 196879808, now seen corresponding path program 1 times [2022-07-20 06:07:15,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:15,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416475023] [2022-07-20 06:07:15,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:15,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:15,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:15,328 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-20 06:07:15,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:15,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416475023] [2022-07-20 06:07:15,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416475023] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:15,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:15,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-20 06:07:15,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488873404] [2022-07-20 06:07:15,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:15,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-20 06:07:15,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:15,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-20 06:07:15,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-07-20 06:07:15,331 INFO L87 Difference]: Start difference. First operand 262 states and 309 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:15,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:15,892 INFO L93 Difference]: Finished difference Result 422 states and 457 transitions. [2022-07-20 06:07:15,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-20 06:07:15,892 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-07-20 06:07:15,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:15,894 INFO L225 Difference]: With dead ends: 422 [2022-07-20 06:07:15,894 INFO L226 Difference]: Without dead ends: 422 [2022-07-20 06:07:15,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=586, Unknown=0, NotChecked=0, Total=756 [2022-07-20 06:07:15,894 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 818 mSDsluCounter, 946 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 818 SdHoareTripleChecker+Valid, 1059 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:15,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [818 Valid, 1059 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 06:07:15,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2022-07-20 06:07:15,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 262. [2022-07-20 06:07:15,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 237 states have (on average 1.2995780590717299) internal successors, (308), 261 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:15,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 308 transitions. [2022-07-20 06:07:15,898 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 308 transitions. Word has length 39 [2022-07-20 06:07:15,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:15,898 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 308 transitions. [2022-07-20 06:07:15,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:15,899 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 308 transitions. [2022-07-20 06:07:15,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-20 06:07:15,899 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:15,899 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-20 06:07:15,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-20 06:07:15,900 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:07:15,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:15,900 INFO L85 PathProgramCache]: Analyzing trace with hash -2051878023, now seen corresponding path program 1 times [2022-07-20 06:07:15,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:15,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324428153] [2022-07-20 06:07:15,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:15,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:15,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:15,919 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-20 06:07:15,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:15,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324428153] [2022-07-20 06:07:15,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324428153] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:15,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:15,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:07:15,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125988829] [2022-07-20 06:07:15,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:15,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:07:15,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:15,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:07:15,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:07:15,921 INFO L87 Difference]: Start difference. First operand 262 states and 308 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:15,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:15,952 INFO L93 Difference]: Finished difference Result 264 states and 309 transitions. [2022-07-20 06:07:15,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:07:15,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-07-20 06:07:15,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:15,954 INFO L225 Difference]: With dead ends: 264 [2022-07-20 06:07:15,954 INFO L226 Difference]: Without dead ends: 264 [2022-07-20 06:07:15,954 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-20 06:07:15,954 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 82 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:15,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 159 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:07:15,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2022-07-20 06:07:15,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 260. [2022-07-20 06:07:15,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 236 states have (on average 1.2923728813559323) internal successors, (305), 259 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:15,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 305 transitions. [2022-07-20 06:07:15,957 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 305 transitions. Word has length 41 [2022-07-20 06:07:15,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:15,958 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 305 transitions. [2022-07-20 06:07:15,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:15,958 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 305 transitions. [2022-07-20 06:07:15,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-20 06:07:15,958 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:15,958 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:07:15,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-20 06:07:15,959 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:07:15,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:15,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1173136884, now seen corresponding path program 1 times [2022-07-20 06:07:15,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:15,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503462468] [2022-07-20 06:07:15,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:15,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:15,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:16,041 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-20 06:07:16,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:16,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503462468] [2022-07-20 06:07:16,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503462468] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:07:16,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422290063] [2022-07-20 06:07:16,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:16,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:07:16,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:07:16,043 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-20 06:07:16,044 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-20 06:07:16,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:16,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-20 06:07:16,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:07:16,133 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-20 06:07:16,139 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-20 06:07:16,159 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-20 06:07:16,160 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-20 06:07:16,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:07:16,163 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-20 06:07:16,216 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-20 06:07:16,219 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-20 06:07:16,244 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-20 06:07:16,245 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:07:16,324 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-20 06:07:16,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422290063] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:07:16,324 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:07:16,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 9 [2022-07-20 06:07:16,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274228030] [2022-07-20 06:07:16,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:07:16,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 06:07:16,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:16,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 06:07:16,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-20 06:07:16,326 INFO L87 Difference]: Start difference. First operand 260 states and 305 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:16,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:16,595 INFO L93 Difference]: Finished difference Result 352 states and 387 transitions. [2022-07-20 06:07:16,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 06:07:16,596 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-07-20 06:07:16,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:16,597 INFO L225 Difference]: With dead ends: 352 [2022-07-20 06:07:16,597 INFO L226 Difference]: Without dead ends: 352 [2022-07-20 06:07:16,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-07-20 06:07:16,598 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 176 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:16,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 802 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:07:16,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2022-07-20 06:07:16,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 284. [2022-07-20 06:07:16,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 260 states have (on average 1.3038461538461539) internal successors, (339), 283 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:16,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 339 transitions. [2022-07-20 06:07:16,601 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 339 transitions. Word has length 41 [2022-07-20 06:07:16,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:16,601 INFO L495 AbstractCegarLoop]: Abstraction has 284 states and 339 transitions. [2022-07-20 06:07:16,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:16,602 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 339 transitions. [2022-07-20 06:07:16,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-20 06:07:16,602 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:16,602 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-20 06:07:16,619 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-20 06:07:16,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-07-20 06:07:16,819 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:07:16,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:16,820 INFO L85 PathProgramCache]: Analyzing trace with hash 816295160, now seen corresponding path program 1 times [2022-07-20 06:07:16,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:16,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933137435] [2022-07-20 06:07:16,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:16,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:16,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:16,893 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-20 06:07:16,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:16,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933137435] [2022-07-20 06:07:16,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933137435] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:16,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:16,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 06:07:16,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746765964] [2022-07-20 06:07:16,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:16,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 06:07:16,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:16,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 06:07:16,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-20 06:07:16,895 INFO L87 Difference]: Start difference. First operand 284 states and 339 transitions. Second operand has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:17,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:17,133 INFO L93 Difference]: Finished difference Result 348 states and 397 transitions. [2022-07-20 06:07:17,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 06:07:17,134 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-07-20 06:07:17,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:17,135 INFO L225 Difference]: With dead ends: 348 [2022-07-20 06:07:17,135 INFO L226 Difference]: Without dead ends: 348 [2022-07-20 06:07:17,135 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-20 06:07:17,135 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 405 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:17,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 461 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:07:17,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2022-07-20 06:07:17,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 291. [2022-07-20 06:07:17,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 267 states have (on average 1.303370786516854) internal successors, (348), 290 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:17,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 348 transitions. [2022-07-20 06:07:17,159 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 348 transitions. Word has length 42 [2022-07-20 06:07:17,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:17,160 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 348 transitions. [2022-07-20 06:07:17,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:17,160 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 348 transitions. [2022-07-20 06:07:17,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-20 06:07:17,160 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:17,160 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-20 06:07:17,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-07-20 06:07:17,161 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:07:17,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:17,161 INFO L85 PathProgramCache]: Analyzing trace with hash 816295161, now seen corresponding path program 1 times [2022-07-20 06:07:17,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:17,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358074821] [2022-07-20 06:07:17,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:17,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:17,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:17,268 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-20 06:07:17,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:17,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358074821] [2022-07-20 06:07:17,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358074821] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:17,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:17,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 06:07:17,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826110757] [2022-07-20 06:07:17,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:17,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 06:07:17,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:17,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 06:07:17,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-20 06:07:17,270 INFO L87 Difference]: Start difference. First operand 291 states and 348 transitions. Second operand has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:17,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:17,582 INFO L93 Difference]: Finished difference Result 348 states and 397 transitions. [2022-07-20 06:07:17,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 06:07:17,583 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-07-20 06:07:17,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:17,584 INFO L225 Difference]: With dead ends: 348 [2022-07-20 06:07:17,584 INFO L226 Difference]: Without dead ends: 348 [2022-07-20 06:07:17,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2022-07-20 06:07:17,584 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 248 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:17,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 632 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:07:17,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2022-07-20 06:07:17,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 297. [2022-07-20 06:07:17,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 273 states have (on average 1.3003663003663004) internal successors, (355), 296 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:17,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 355 transitions. [2022-07-20 06:07:17,588 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 355 transitions. Word has length 42 [2022-07-20 06:07:17,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:17,588 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 355 transitions. [2022-07-20 06:07:17,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:17,588 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 355 transitions. [2022-07-20 06:07:17,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-20 06:07:17,588 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:17,588 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-20 06:07:17,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-07-20 06:07:17,588 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:07:17,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:17,589 INFO L85 PathProgramCache]: Analyzing trace with hash 2007506213, now seen corresponding path program 1 times [2022-07-20 06:07:17,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:17,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972557570] [2022-07-20 06:07:17,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:17,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:17,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:17,611 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-20 06:07:17,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:17,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972557570] [2022-07-20 06:07:17,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972557570] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:07:17,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054045412] [2022-07-20 06:07:17,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:17,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:07:17,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:07:17,614 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-20 06:07:17,615 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-20 06:07:17,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:17,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-20 06:07:17,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:07:17,739 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-20 06:07:17,756 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-20 06:07:17,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:07:17,798 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-20 06:07:17,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1054045412] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:07:17,798 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:07:17,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2022-07-20 06:07:17,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460757668] [2022-07-20 06:07:17,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:07:17,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:07:17,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:17,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:07:17,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:07:17,799 INFO L87 Difference]: Start difference. First operand 297 states and 355 transitions. Second operand has 5 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:17,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:17,857 INFO L93 Difference]: Finished difference Result 328 states and 386 transitions. [2022-07-20 06:07:17,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 06:07:17,866 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-07-20 06:07:17,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:17,867 INFO L225 Difference]: With dead ends: 328 [2022-07-20 06:07:17,867 INFO L226 Difference]: Without dead ends: 304 [2022-07-20 06:07:17,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:07:17,868 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:17,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 288 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 1 Unchecked, 0.1s Time] [2022-07-20 06:07:17,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-07-20 06:07:17,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2022-07-20 06:07:17,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 280 states have (on average 1.292857142857143) internal successors, (362), 303 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:17,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 362 transitions. [2022-07-20 06:07:17,871 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 362 transitions. Word has length 42 [2022-07-20 06:07:17,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:17,872 INFO L495 AbstractCegarLoop]: Abstraction has 304 states and 362 transitions. [2022-07-20 06:07:17,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:17,872 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 362 transitions. [2022-07-20 06:07:17,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-20 06:07:17,872 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:17,872 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] [2022-07-20 06:07:17,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-20 06:07:18,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:07:18,087 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:07:18,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:18,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1167718218, now seen corresponding path program 1 times [2022-07-20 06:07:18,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:18,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861127781] [2022-07-20 06:07:18,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:18,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:18,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:18,111 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-20 06:07:18,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:18,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861127781] [2022-07-20 06:07:18,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861127781] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:18,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:18,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:07:18,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507598097] [2022-07-20 06:07:18,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:18,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:07:18,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:18,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:07:18,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:07:18,115 INFO L87 Difference]: Start difference. First operand 304 states and 362 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:18,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:18,122 INFO L93 Difference]: Finished difference Result 458 states and 556 transitions. [2022-07-20 06:07:18,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:07:18,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-07-20 06:07:18,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:18,123 INFO L225 Difference]: With dead ends: 458 [2022-07-20 06:07:18,123 INFO L226 Difference]: Without dead ends: 458 [2022-07-20 06:07:18,124 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-20 06:07:18,124 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 54 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:18,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 318 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:07:18,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2022-07-20 06:07:18,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 340. [2022-07-20 06:07:18,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 316 states have (on average 1.3259493670886076) internal successors, (419), 339 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:18,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 419 transitions. [2022-07-20 06:07:18,131 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 419 transitions. Word has length 44 [2022-07-20 06:07:18,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:18,131 INFO L495 AbstractCegarLoop]: Abstraction has 340 states and 419 transitions. [2022-07-20 06:07:18,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:18,131 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 419 transitions. [2022-07-20 06:07:18,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-20 06:07:18,134 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:18,134 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] [2022-07-20 06:07:18,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-07-20 06:07:18,134 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:07:18,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:18,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1519355336, now seen corresponding path program 1 times [2022-07-20 06:07:18,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:18,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111514525] [2022-07-20 06:07:18,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:18,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:18,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:18,269 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-20 06:07:18,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:18,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111514525] [2022-07-20 06:07:18,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111514525] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:18,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:18,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 06:07:18,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764087048] [2022-07-20 06:07:18,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:18,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 06:07:18,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:18,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 06:07:18,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:07:18,272 INFO L87 Difference]: Start difference. First operand 340 states and 419 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:18,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:18,532 INFO L93 Difference]: Finished difference Result 370 states and 439 transitions. [2022-07-20 06:07:18,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 06:07:18,532 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-07-20 06:07:18,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:18,533 INFO L225 Difference]: With dead ends: 370 [2022-07-20 06:07:18,533 INFO L226 Difference]: Without dead ends: 370 [2022-07-20 06:07:18,533 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-20 06:07:18,534 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 131 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:18,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 514 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:07:18,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2022-07-20 06:07:18,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 340. [2022-07-20 06:07:18,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 316 states have (on average 1.3227848101265822) internal successors, (418), 339 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:18,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 418 transitions. [2022-07-20 06:07:18,538 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 418 transitions. Word has length 44 [2022-07-20 06:07:18,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:18,538 INFO L495 AbstractCegarLoop]: Abstraction has 340 states and 418 transitions. [2022-07-20 06:07:18,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:18,538 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 418 transitions. [2022-07-20 06:07:18,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-20 06:07:18,539 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:18,539 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] [2022-07-20 06:07:18,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-07-20 06:07:18,539 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:07:18,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:18,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1190454621, now seen corresponding path program 1 times [2022-07-20 06:07:18,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:18,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342371474] [2022-07-20 06:07:18,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:18,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:18,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:18,578 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-20 06:07:18,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:18,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342371474] [2022-07-20 06:07:18,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342371474] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:18,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:18,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 06:07:18,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333046383] [2022-07-20 06:07:18,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:18,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:07:18,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:18,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:07:18,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:07:18,580 INFO L87 Difference]: Start difference. First operand 340 states and 418 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:18,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:18,645 INFO L93 Difference]: Finished difference Result 287 states and 330 transitions. [2022-07-20 06:07:18,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 06:07:18,646 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-07-20 06:07:18,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:18,646 INFO L225 Difference]: With dead ends: 287 [2022-07-20 06:07:18,647 INFO L226 Difference]: Without dead ends: 287 [2022-07-20 06:07:18,647 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-20 06:07:18,647 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 54 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:18,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 504 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:07:18,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-07-20 06:07:18,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 286. [2022-07-20 06:07:18,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 263 states have (on average 1.2509505703422052) internal successors, (329), 285 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:18,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 329 transitions. [2022-07-20 06:07:18,652 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 329 transitions. Word has length 46 [2022-07-20 06:07:18,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:18,653 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 329 transitions. [2022-07-20 06:07:18,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:18,653 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 329 transitions. [2022-07-20 06:07:18,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-20 06:07:18,653 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:18,653 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] [2022-07-20 06:07:18,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-07-20 06:07:18,654 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:07:18,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:18,654 INFO L85 PathProgramCache]: Analyzing trace with hash 120277254, now seen corresponding path program 1 times [2022-07-20 06:07:18,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:18,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286044467] [2022-07-20 06:07:18,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:18,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:18,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:18,727 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-20 06:07:18,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:18,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286044467] [2022-07-20 06:07:18,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286044467] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:18,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:18,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-20 06:07:18,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274671769] [2022-07-20 06:07:18,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:18,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 06:07:18,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:18,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 06:07:18,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-20 06:07:18,729 INFO L87 Difference]: Start difference. First operand 286 states and 329 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:19,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:19,025 INFO L93 Difference]: Finished difference Result 279 states and 317 transitions. [2022-07-20 06:07:19,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 06:07:19,025 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-07-20 06:07:19,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:19,026 INFO L225 Difference]: With dead ends: 279 [2022-07-20 06:07:19,026 INFO L226 Difference]: Without dead ends: 279 [2022-07-20 06:07:19,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2022-07-20 06:07:19,027 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 406 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:19,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 639 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:07:19,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-07-20 06:07:19,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 263. [2022-07-20 06:07:19,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 240 states have (on average 1.2666666666666666) internal successors, (304), 262 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:19,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 304 transitions. [2022-07-20 06:07:19,030 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 304 transitions. Word has length 49 [2022-07-20 06:07:19,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:19,030 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 304 transitions. [2022-07-20 06:07:19,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:19,031 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 304 transitions. [2022-07-20 06:07:19,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-20 06:07:19,031 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:19,031 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] [2022-07-20 06:07:19,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-07-20 06:07:19,031 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:07:19,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:19,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1590511077, now seen corresponding path program 1 times [2022-07-20 06:07:19,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:19,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882251096] [2022-07-20 06:07:19,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:19,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:19,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:19,062 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 06:07:19,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:19,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882251096] [2022-07-20 06:07:19,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882251096] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:19,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:19,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 06:07:19,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212361414] [2022-07-20 06:07:19,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:19,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:07:19,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:19,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:07:19,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:07:19,064 INFO L87 Difference]: Start difference. First operand 263 states and 304 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:19,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:19,131 INFO L93 Difference]: Finished difference Result 277 states and 318 transitions. [2022-07-20 06:07:19,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 06:07:19,131 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-07-20 06:07:19,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:19,132 INFO L225 Difference]: With dead ends: 277 [2022-07-20 06:07:19,132 INFO L226 Difference]: Without dead ends: 277 [2022-07-20 06:07:19,132 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-20 06:07:19,133 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 19 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:19,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 474 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:07:19,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2022-07-20 06:07:19,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 266. [2022-07-20 06:07:19,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 243 states have (on average 1.2592592592592593) internal successors, (306), 265 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:19,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 306 transitions. [2022-07-20 06:07:19,136 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 306 transitions. Word has length 50 [2022-07-20 06:07:19,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:19,136 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 306 transitions. [2022-07-20 06:07:19,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:19,136 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 306 transitions. [2022-07-20 06:07:19,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-20 06:07:19,137 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:19,137 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] [2022-07-20 06:07:19,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-07-20 06:07:19,137 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:07:19,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:19,138 INFO L85 PathProgramCache]: Analyzing trace with hash -97333738, now seen corresponding path program 1 times [2022-07-20 06:07:19,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:19,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343100011] [2022-07-20 06:07:19,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:19,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:19,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:19,228 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-20 06:07:19,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:19,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343100011] [2022-07-20 06:07:19,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343100011] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:07:19,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386476860] [2022-07-20 06:07:19,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:19,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:07:19,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:07:19,230 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-20 06:07:19,231 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-20 06:07:19,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:19,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-20 06:07:19,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:07:19,335 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-20 06:07:19,400 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-20 06:07:19,401 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-20 06:07:19,427 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-20 06:07:19,508 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:07:19,508 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-20 06:07:19,558 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:07:19,559 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-20 06:07:19,688 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:07:19,689 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-20 06:07:19,731 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-20 06:07:19,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:07:19,995 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:07:19,995 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 20 treesize of output 21 [2022-07-20 06:07:20,001 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:07:20,002 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 34 treesize of output 37 [2022-07-20 06:07:20,006 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 11 treesize of output 9 [2022-07-20 06:07:24,440 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-20 06:07:24,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386476860] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:07:24,440 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:07:24,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-07-20 06:07:24,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634448515] [2022-07-20 06:07:24,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:07:24,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-20 06:07:24,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:24,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-20 06:07:24,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=734, Unknown=7, NotChecked=0, Total=870 [2022-07-20 06:07:24,442 INFO L87 Difference]: Start difference. First operand 266 states and 306 transitions. Second operand has 30 states, 29 states have (on average 5.206896551724138) internal successors, (151), 30 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:24,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:24,984 INFO L93 Difference]: Finished difference Result 550 states and 621 transitions. [2022-07-20 06:07:24,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-20 06:07:24,984 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 5.206896551724138) internal successors, (151), 30 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-07-20 06:07:24,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:24,986 INFO L225 Difference]: With dead ends: 550 [2022-07-20 06:07:24,986 INFO L226 Difference]: Without dead ends: 550 [2022-07-20 06:07:24,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=254, Invalid=1145, Unknown=7, NotChecked=0, Total=1406 [2022-07-20 06:07:24,987 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 918 mSDsluCounter, 1550 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 918 SdHoareTripleChecker+Valid, 1660 SdHoareTripleChecker+Invalid, 1980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 883 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:24,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [918 Valid, 1660 Invalid, 1980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1034 Invalid, 0 Unknown, 883 Unchecked, 0.4s Time] [2022-07-20 06:07:24,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2022-07-20 06:07:24,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 312. [2022-07-20 06:07:24,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 289 states have (on average 1.2560553633217992) internal successors, (363), 311 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:24,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 363 transitions. [2022-07-20 06:07:24,990 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 363 transitions. Word has length 52 [2022-07-20 06:07:24,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:24,991 INFO L495 AbstractCegarLoop]: Abstraction has 312 states and 363 transitions. [2022-07-20 06:07:24,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 5.206896551724138) internal successors, (151), 30 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:24,991 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 363 transitions. [2022-07-20 06:07:24,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-20 06:07:24,991 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:24,992 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] [2022-07-20 06:07:25,022 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-20 06:07:25,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:07:25,205 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:07:25,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:25,206 INFO L85 PathProgramCache]: Analyzing trace with hash -97333737, now seen corresponding path program 1 times [2022-07-20 06:07:25,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:25,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68247290] [2022-07-20 06:07:25,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:25,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:25,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:25,333 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-20 06:07:25,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:25,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68247290] [2022-07-20 06:07:25,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68247290] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:07:25,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059914287] [2022-07-20 06:07:25,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:25,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:07:25,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:07:25,340 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-20 06:07:25,341 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-20 06:07:25,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:25,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-20 06:07:25,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:07:25,447 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-20 06:07:25,516 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:07:25,516 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-20 06:07:25,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:07:25,549 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-20 06:07:25,555 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-20 06:07:25,645 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:07:25,646 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 14 treesize of output 20 [2022-07-20 06:07:25,651 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 5 treesize of output 3 [2022-07-20 06:07:25,660 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:07:25,660 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-20 06:07:25,727 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:07:25,727 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 38 treesize of output 37 [2022-07-20 06:07:25,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 18 treesize of output 20 [2022-07-20 06:07:25,884 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:07:25,884 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-20 06:07:25,887 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:07:25,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 06:07:25,927 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-20 06:07:25,927 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:07:26,263 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1129 (Array Int Int)) (v_ArrVal_1128 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_73| Int)) (or (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1129) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_73|))) (and (<= 0 (+ 4 .cse0)) (<= (+ 8 .cse0) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1128) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_73|))))) (not (<= 0 |v_ULTIMATE.start_main_~end~0#1.offset_73|)) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_73| |c_ULTIMATE.start_main_~list~0#1.offset|)))) is different from false [2022-07-20 06:07:26,673 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:07:26,674 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 20 treesize of output 21 [2022-07-20 06:07:26,679 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:07:26,680 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 34 treesize of output 37 [2022-07-20 06:07:26,683 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 11 treesize of output 9 [2022-07-20 06:07:26,699 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:07:26,699 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 37 treesize of output 38 [2022-07-20 06:07:26,703 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:07:26,704 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-07-20 06:07:26,705 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:07:26,708 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-07-20 06:07:26,712 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:07:26,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2022-07-20 06:07:27,000 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-20 06:07:27,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059914287] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:07:27,000 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:07:27,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 32 [2022-07-20 06:07:27,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258302126] [2022-07-20 06:07:27,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:07:27,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-20 06:07:27,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:27,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-20 06:07:27,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=892, Unknown=6, NotChecked=60, Total=1056 [2022-07-20 06:07:27,001 INFO L87 Difference]: Start difference. First operand 312 states and 363 transitions. Second operand has 33 states, 32 states have (on average 4.8125) internal successors, (154), 33 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:28,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:28,624 INFO L93 Difference]: Finished difference Result 456 states and 506 transitions. [2022-07-20 06:07:28,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-07-20 06:07:28,625 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 4.8125) internal successors, (154), 33 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-07-20 06:07:28,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:28,626 INFO L225 Difference]: With dead ends: 456 [2022-07-20 06:07:28,626 INFO L226 Difference]: Without dead ends: 456 [2022-07-20 06:07:28,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 83 SyntacticMatches, 6 SemanticMatches, 58 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 628 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=456, Invalid=2964, Unknown=6, NotChecked=114, Total=3540 [2022-07-20 06:07:28,627 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 717 mSDsluCounter, 1783 mSDsCounter, 0 mSdLazyCounter, 1490 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 1906 SdHoareTripleChecker+Invalid, 2459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 880 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:28,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [717 Valid, 1906 Invalid, 2459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1490 Invalid, 0 Unknown, 880 Unchecked, 0.6s Time] [2022-07-20 06:07:28,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2022-07-20 06:07:28,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 329. [2022-07-20 06:07:28,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 306 states have (on average 1.261437908496732) internal successors, (386), 328 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:28,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 386 transitions. [2022-07-20 06:07:28,631 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 386 transitions. Word has length 52 [2022-07-20 06:07:28,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:28,631 INFO L495 AbstractCegarLoop]: Abstraction has 329 states and 386 transitions. [2022-07-20 06:07:28,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 4.8125) internal successors, (154), 33 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:28,631 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 386 transitions. [2022-07-20 06:07:28,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-20 06:07:28,632 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:28,632 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, 1] [2022-07-20 06:07:28,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-20 06:07:28,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:07:28,847 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:07:28,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:28,848 INFO L85 PathProgramCache]: Analyzing trace with hash 2084299753, now seen corresponding path program 1 times [2022-07-20 06:07:28,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:28,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260464793] [2022-07-20 06:07:28,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:28,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:28,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:29,102 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-20 06:07:29,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:29,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260464793] [2022-07-20 06:07:29,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260464793] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:07:29,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074589353] [2022-07-20 06:07:29,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:29,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:07:29,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:07:29,104 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-20 06:07:29,105 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-20 06:07:29,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:29,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-20 06:07:29,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:07:29,240 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-20 06:07:29,257 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-20 06:07:29,258 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-20 06:07:29,280 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-20 06:07:29,322 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:07:29,322 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 34 treesize of output 35 [2022-07-20 06:07:29,371 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:07:29,371 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 34 treesize of output 35 [2022-07-20 06:07:29,462 INFO L356 Elim1Store]: treesize reduction 54, result has 36.5 percent of original size [2022-07-20 06:07:29,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 45 [2022-07-20 06:07:29,509 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-07-20 06:07:29,510 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 43 treesize of output 36 [2022-07-20 06:07:29,741 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:07:29,742 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 118 treesize of output 100 [2022-07-20 06:07:29,929 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:07:29,929 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 118 treesize of output 100 [2022-07-20 06:07:30,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 33 treesize of output 17 [2022-07-20 06:07:30,274 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-20 06:07:30,274 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:07:30,341 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1236 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1236) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) 1)) is different from false [2022-07-20 06:07:30,344 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1236 (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_1236) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) 1)) is different from false [2022-07-20 06:07:31,560 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1236 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc10#1.base_14| Int)) (or (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_14| 1) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| |v_ULTIMATE.start_main_#t~malloc10#1.base_14|)) |v_ULTIMATE.start_main_#t~malloc10#1.base_14| v_ArrVal_1236) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_14|) 0)))) is different from false [2022-07-20 06:07:31,586 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1236 (Array Int Int)) (v_ArrVal_1231 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc10#1.base_14| Int)) (or (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_14| 1) (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1231))) (store .cse0 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| |v_ULTIMATE.start_main_#t~malloc10#1.base_14|))) |v_ULTIMATE.start_main_#t~malloc10#1.base_14| v_ArrVal_1236) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_14|) 0)))) is different from false [2022-07-20 06:07:32,365 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:07:32,366 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 95 treesize of output 66 [2022-07-20 06:07:32,368 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:07:32,370 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 546 treesize of output 524 [2022-07-20 06:07:32,375 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 596 treesize of output 564 [2022-07-20 06:07:32,383 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 548 treesize of output 508 [2022-07-20 06:07:32,390 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 528 treesize of output 484 [2022-07-20 06:07:33,525 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-20 06:07:33,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074589353] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:07:33,525 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:07:33,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 17] total 42 [2022-07-20 06:07:33,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741102650] [2022-07-20 06:07:33,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:07:33,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-07-20 06:07:33,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:33,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-07-20 06:07:33,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=1237, Unknown=38, NotChecked=308, Total=1806 [2022-07-20 06:07:33,527 INFO L87 Difference]: Start difference. First operand 329 states and 386 transitions. Second operand has 43 states, 42 states have (on average 3.3095238095238093) internal successors, (139), 43 states have internal predecessors, (139), 0 states have call successors, (0), 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-20 06:07:49,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:49,470 INFO L93 Difference]: Finished difference Result 622 states and 711 transitions. [2022-07-20 06:07:49,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-07-20 06:07:49,471 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 3.3095238095238093) internal successors, (139), 43 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-07-20 06:07:49,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:49,472 INFO L225 Difference]: With dead ends: 622 [2022-07-20 06:07:49,472 INFO L226 Difference]: Without dead ends: 622 [2022-07-20 06:07:49,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 87 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 967 ImplicationChecksByTransitivity, 18.7s TimeCoverageRelationStatistics Valid=534, Invalid=3145, Unknown=119, NotChecked=492, Total=4290 [2022-07-20 06:07:49,473 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 595 mSDsluCounter, 2860 mSDsCounter, 0 mSdLazyCounter, 1389 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 595 SdHoareTripleChecker+Valid, 2998 SdHoareTripleChecker+Invalid, 4287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2855 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:49,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [595 Valid, 2998 Invalid, 4287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1389 Invalid, 0 Unknown, 2855 Unchecked, 0.6s Time] [2022-07-20 06:07:49,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2022-07-20 06:07:49,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 361. [2022-07-20 06:07:49,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 338 states have (on average 1.2455621301775148) internal successors, (421), 360 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:49,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 421 transitions. [2022-07-20 06:07:49,478 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 421 transitions. Word has length 55 [2022-07-20 06:07:49,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:49,478 INFO L495 AbstractCegarLoop]: Abstraction has 361 states and 421 transitions. [2022-07-20 06:07:49,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 3.3095238095238093) internal successors, (139), 43 states have internal predecessors, (139), 0 states have call successors, (0), 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-20 06:07:49,478 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 421 transitions. [2022-07-20 06:07:49,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-20 06:07:49,479 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:49,479 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, 1] [2022-07-20 06:07:49,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-20 06:07:49,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:07:49,680 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:07:49,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:49,680 INFO L85 PathProgramCache]: Analyzing trace with hash 2084299754, now seen corresponding path program 1 times [2022-07-20 06:07:49,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:49,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789215233] [2022-07-20 06:07:49,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:49,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:49,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:50,042 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-20 06:07:50,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:50,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789215233] [2022-07-20 06:07:50,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789215233] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:07:50,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849224836] [2022-07-20 06:07:50,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:50,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:07:50,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:07:50,043 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-20 06:07:50,044 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-20 06:07:50,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:50,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 69 conjunts are in the unsatisfiable core [2022-07-20 06:07:50,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:07:50,177 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-20 06:07:50,204 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-20 06:07:50,205 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-20 06:07:50,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:07:50,239 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-20 06:07:50,243 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-20 06:07:50,290 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:07:50,290 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 57 treesize of output 54 [2022-07-20 06:07:50,294 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-20 06:07:50,368 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:07:50,368 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 57 treesize of output 54 [2022-07-20 06:07:50,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-20 06:07:50,502 INFO L356 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2022-07-20 06:07:50,502 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2022-07-20 06:07:50,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 06:07:50,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:07:50,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-07-20 06:07:50,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:07:50,566 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 06:07:50,736 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:07:50,737 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 57 treesize of output 49 [2022-07-20 06:07:50,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:07:50,742 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 23 treesize of output 23 [2022-07-20 06:07:50,886 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:07:50,887 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 64 treesize of output 57 [2022-07-20 06:07:50,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2022-07-20 06:07:51,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:07:51,151 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-07-20 06:07:51,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:07:51,155 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:07:51,155 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 21 [2022-07-20 06:07:51,168 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-20 06:07:51,168 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:07:51,307 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1351 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1352) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0))))) (forall ((v_ArrVal_1351 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) 4)))) is different from false [2022-07-20 06:07:51,344 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1351 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) 4))) (forall ((v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1351 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1352) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0)))))) is different from false [2022-07-20 06:07:51,361 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1351 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1351) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) 4))) (forall ((v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1351 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1351) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1352) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))))) is different from false [2022-07-20 06:07:51,373 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1351 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (<= (+ 8 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_#t~malloc10#1.offset|)) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_#t~malloc10#1.base|)) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1352) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0))))) (forall ((v_ArrVal_1351 (Array Int Int))) (<= 0 (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_#t~malloc10#1.offset|)) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))))) is different from false [2022-07-20 06:07:51,394 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1344 Int) (|v_ULTIMATE.start_main_#t~malloc10#1.base_17| Int)) (or (and (forall ((v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1351 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (<= (+ 8 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| 0)) |v_ULTIMATE.start_main_#t~malloc10#1.base_17| v_ArrVal_1351) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc10#1.base_17| v_ArrVal_1344) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| |v_ULTIMATE.start_main_#t~malloc10#1.base_17|)) |v_ULTIMATE.start_main_#t~malloc10#1.base_17| v_ArrVal_1352) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0))))) (forall ((v_ArrVal_1351 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| 0)) |v_ULTIMATE.start_main_#t~malloc10#1.base_17| v_ArrVal_1351) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) 4)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_17|) 0)))) is different from false [2022-07-20 06:07:51,470 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_84| Int) (|v_ULTIMATE.start_main_#t~malloc10#1.base_17| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_17|) 0)) (and (forall ((v_ArrVal_1351 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_84| 0)) |v_ULTIMATE.start_main_#t~malloc10#1.base_17| v_ArrVal_1351) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) 4))) (forall ((v_ArrVal_1344 Int) (v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1351 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_84| 0)) |v_ULTIMATE.start_main_#t~malloc10#1.base_17| v_ArrVal_1351) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 8) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc10#1.base_17| v_ArrVal_1344) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_84| |v_ULTIMATE.start_main_#t~malloc10#1.base_17|)) |v_ULTIMATE.start_main_#t~malloc10#1.base_17| v_ArrVal_1352) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0)))))) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_84| |c_ULTIMATE.start_main_~list~0#1.offset|)))) is different from false [2022-07-20 06:07:51,778 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_84| Int) (v_ArrVal_1343 (Array Int Int)) (v_ArrVal_1342 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc10#1.base_17| Int)) (or (and (forall ((v_ArrVal_1344 Int) (v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1351 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (<= (+ 8 (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1342))) (store .cse0 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_84| 0))) |v_ULTIMATE.start_main_#t~malloc10#1.base_17| v_ArrVal_1351) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc10#1.base_17| v_ArrVal_1344) (select (select (store (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1343))) (store .cse2 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_84| |v_ULTIMATE.start_main_#t~malloc10#1.base_17|))) |v_ULTIMATE.start_main_#t~malloc10#1.base_17| v_ArrVal_1352) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))))) (forall ((v_ArrVal_1351 (Array Int Int))) (<= 0 (+ 4 (select (select (store (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1342))) (store .cse3 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_84| 0))) |v_ULTIMATE.start_main_#t~malloc10#1.base_17| v_ArrVal_1351) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_17|) 0)) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_84| |c_ULTIMATE.start_main_~list~0#1.offset|)))) is different from false [2022-07-20 06:07:54,887 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:07:54,887 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 92 treesize of output 83 [2022-07-20 06:07:54,892 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:07:54,892 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 72 treesize of output 63 [2022-07-20 06:07:54,895 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 108 treesize of output 90 [2022-07-20 06:07:54,898 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:07:54,900 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 250 treesize of output 242 [2022-07-20 06:07:54,903 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:07:54,905 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 188 treesize of output 180 [2022-07-20 06:07:54,907 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:07:54,909 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 219 treesize of output 203 [2022-07-20 06:07:54,912 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:07:54,913 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 184 treesize of output 164 [2022-07-20 06:07:54,916 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 138 treesize of output 114 [2022-07-20 06:07:54,936 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:07:54,937 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 184 treesize of output 175 [2022-07-20 06:07:54,942 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:07:54,943 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 164 treesize of output 115 [2022-07-20 06:07:54,945 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:07:54,946 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:07:54,948 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 150 treesize of output 134 [2022-07-20 06:07:54,950 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:07:54,950 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:07:54,951 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:07:54,953 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 80 treesize of output 74 [2022-07-20 06:07:54,955 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:07:54,957 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 29 treesize of output 25 [2022-07-20 06:07:54,959 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:07:54,961 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 61 treesize of output 49 [2022-07-20 06:07:54,963 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:07:54,964 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 34 [2022-07-20 06:07:55,015 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:07:55,072 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-20 06:07:55,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849224836] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:07:55,073 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:07:55,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 17] total 42 [2022-07-20 06:07:55,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535385916] [2022-07-20 06:07:55,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:07:55,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-07-20 06:07:55,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:55,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-07-20 06:07:55,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1083, Unknown=16, NotChecked=518, Total=1806 [2022-07-20 06:07:55,079 INFO L87 Difference]: Start difference. First operand 361 states and 421 transitions. Second operand has 43 states, 42 states have (on average 3.5714285714285716) internal successors, (150), 43 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:58,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:58,995 INFO L93 Difference]: Finished difference Result 406 states and 460 transitions. [2022-07-20 06:07:58,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-20 06:07:58,995 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 3.5714285714285716) internal successors, (150), 43 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-07-20 06:07:58,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:58,996 INFO L225 Difference]: With dead ends: 406 [2022-07-20 06:07:58,996 INFO L226 Difference]: Without dead ends: 406 [2022-07-20 06:07:58,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 86 SyntacticMatches, 6 SemanticMatches, 47 ConstructedPredicates, 7 IntricatePredicates, 1 DeprecatedPredicates, 586 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=250, Invalid=1482, Unknown=18, NotChecked=602, Total=2352 [2022-07-20 06:07:58,997 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 182 mSDsluCounter, 2233 mSDsCounter, 0 mSdLazyCounter, 1014 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 2391 SdHoareTripleChecker+Invalid, 2593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1014 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1571 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:58,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 2391 Invalid, 2593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1014 Invalid, 0 Unknown, 1571 Unchecked, 0.5s Time] [2022-07-20 06:07:58,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2022-07-20 06:07:59,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 360. [2022-07-20 06:07:59,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 338 states have (on average 1.227810650887574) internal successors, (415), 359 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:59,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 415 transitions. [2022-07-20 06:07:59,001 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 415 transitions. Word has length 55 [2022-07-20 06:07:59,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:59,001 INFO L495 AbstractCegarLoop]: Abstraction has 360 states and 415 transitions. [2022-07-20 06:07:59,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 3.5714285714285716) internal successors, (150), 43 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:59,002 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 415 transitions. [2022-07-20 06:07:59,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-20 06:07:59,002 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:59,002 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, 1] [2022-07-20 06:07:59,022 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-07-20 06:07:59,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:07:59,225 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:07:59,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:59,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1738644409, now seen corresponding path program 1 times [2022-07-20 06:07:59,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:59,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126669344] [2022-07-20 06:07:59,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:59,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:59,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:59,624 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-20 06:07:59,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:59,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126669344] [2022-07-20 06:07:59,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126669344] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:07:59,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424162948] [2022-07-20 06:07:59,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:59,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:07:59,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:07:59,626 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:07:59,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-20 06:07:59,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:59,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 69 conjunts are in the unsatisfiable core [2022-07-20 06:07:59,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:07:59,753 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-20 06:07:59,770 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-20 06:07:59,773 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-20 06:07:59,872 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-20 06:07:59,873 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-20 06:07:59,922 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-07-20 06:07:59,923 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-20 06:07:59,938 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-07-20 06:07:59,938 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-20 06:08:00,166 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:08:00,166 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-20 06:08:00,181 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:08:00,181 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-20 06:08:00,343 INFO L356 Elim1Store]: treesize reduction 4, result has 94.9 percent of original size [2022-07-20 06:08:00,343 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 84 treesize of output 140 [2022-07-20 06:08:00,880 INFO L356 Elim1Store]: treesize reduction 118, result has 16.9 percent of original size [2022-07-20 06:08:00,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 141 treesize of output 96 [2022-07-20 06:08:00,891 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:08:00,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 109 [2022-07-20 06:08:00,895 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-20 06:08:00,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-20 06:08:01,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-07-20 06:08:01,109 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Should have been eliminated by DER at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:353) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:650) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:611) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:529) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:333) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:269) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-20 06:08:01,111 INFO L158 Benchmark]: Toolchain (without parser) took 56098.35ms. Allocated memory was 81.8MB in the beginning and 192.9MB in the end (delta: 111.1MB). Free memory was 42.1MB in the beginning and 138.1MB in the end (delta: -96.0MB). Peak memory consumption was 102.9MB. Max. memory is 16.1GB. [2022-07-20 06:08:01,111 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 81.8MB. Free memory was 59.8MB in the beginning and 59.8MB in the end (delta: 57.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 06:08:01,111 INFO L158 Benchmark]: CACSL2BoogieTranslator took 310.46ms. Allocated memory was 81.8MB in the beginning and 109.1MB in the end (delta: 27.3MB). Free memory was 41.9MB in the beginning and 74.2MB in the end (delta: -32.3MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. [2022-07-20 06:08:01,111 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.59ms. Allocated memory is still 109.1MB. Free memory was 74.2MB in the beginning and 71.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-20 06:08:01,112 INFO L158 Benchmark]: Boogie Preprocessor took 51.57ms. Allocated memory is still 109.1MB. Free memory was 71.6MB in the beginning and 69.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-20 06:08:01,112 INFO L158 Benchmark]: RCFGBuilder took 445.67ms. Allocated memory is still 109.1MB. Free memory was 69.5MB in the beginning and 45.2MB in the end (delta: 24.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-07-20 06:08:01,112 INFO L158 Benchmark]: TraceAbstraction took 55231.86ms. Allocated memory was 109.1MB in the beginning and 192.9MB in the end (delta: 83.9MB). Free memory was 44.8MB in the beginning and 138.1MB in the end (delta: -93.3MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2022-07-20 06:08:01,112 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34ms. Allocated memory is still 81.8MB. Free memory was 59.8MB in the beginning and 59.8MB in the end (delta: 57.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 310.46ms. Allocated memory was 81.8MB in the beginning and 109.1MB in the end (delta: 27.3MB). Free memory was 41.9MB in the beginning and 74.2MB in the end (delta: -32.3MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.59ms. Allocated memory is still 109.1MB. Free memory was 74.2MB in the beginning and 71.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.57ms. Allocated memory is still 109.1MB. Free memory was 71.6MB in the beginning and 69.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 445.67ms. Allocated memory is still 109.1MB. Free memory was 69.5MB in the beginning and 45.2MB in the end (delta: 24.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 55231.86ms. Allocated memory was 109.1MB in the beginning and 192.9MB in the end (delta: 83.9MB). Free memory was 44.8MB in the beginning and 138.1MB in the end (delta: -93.3MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Should have been eliminated by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Should have been eliminated by DER: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-20 06:08:01,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/sll-01-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ba1a5c8c8cff607fde50280cfe0e0975858a4c6ed38f8443d26bb1773b66a31d --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 06:08:02,749 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 06:08:02,751 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 06:08:02,784 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 06:08:02,786 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 06:08:02,787 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 06:08:02,788 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 06:08:02,792 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 06:08:02,793 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 06:08:02,794 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 06:08:02,795 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 06:08:02,797 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 06:08:02,798 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 06:08:02,800 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 06:08:02,802 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 06:08:02,804 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 06:08:02,805 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 06:08:02,807 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 06:08:02,808 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 06:08:02,809 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 06:08:02,810 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 06:08:02,811 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 06:08:02,811 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 06:08:02,812 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 06:08:02,812 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 06:08:02,814 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 06:08:02,814 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 06:08:02,815 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 06:08:02,815 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 06:08:02,816 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 06:08:02,816 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 06:08:02,816 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 06:08:02,817 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 06:08:02,817 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 06:08:02,818 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 06:08:02,819 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 06:08:02,819 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 06:08:02,819 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 06:08:02,819 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 06:08:02,820 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 06:08:02,820 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 06:08:02,826 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 06:08:02,828 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-20 06:08:02,861 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 06:08:02,862 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 06:08:02,862 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 06:08:02,862 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 06:08:02,863 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 06:08:02,863 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 06:08:02,864 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 06:08:02,864 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 06:08:02,864 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 06:08:02,865 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 06:08:02,865 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 06:08:02,865 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 06:08:02,865 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 06:08:02,865 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 06:08:02,865 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 06:08:02,866 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 06:08:02,866 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 06:08:02,866 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-20 06:08:02,866 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 06:08:02,866 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 06:08:02,866 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-20 06:08:02,866 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-20 06:08:02,867 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 06:08:02,867 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 06:08:02,867 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 06:08:02,867 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 06:08:02,867 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 06:08:02,867 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 06:08:02,868 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 06:08:02,868 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 06:08:02,868 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-20 06:08:02,868 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-20 06:08:02,868 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-20 06:08:02,869 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ba1a5c8c8cff607fde50280cfe0e0975858a4c6ed38f8443d26bb1773b66a31d [2022-07-20 06:08:03,099 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 06:08:03,121 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 06:08:03,123 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 06:08:03,124 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 06:08:03,125 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 06:08:03,126 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-01-1.i [2022-07-20 06:08:03,177 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62d55ad2c/438c7a430bf940e5a24c97d86eba4b05/FLAG237313aa8 [2022-07-20 06:08:03,571 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 06:08:03,572 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i [2022-07-20 06:08:03,583 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62d55ad2c/438c7a430bf940e5a24c97d86eba4b05/FLAG237313aa8 [2022-07-20 06:08:03,593 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62d55ad2c/438c7a430bf940e5a24c97d86eba4b05 [2022-07-20 06:08:03,595 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 06:08:03,597 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 06:08:03,598 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 06:08:03,598 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 06:08:03,601 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 06:08:03,601 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:08:03" (1/1) ... [2022-07-20 06:08:03,603 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@760080ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:08:03, skipping insertion in model container [2022-07-20 06:08:03,603 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:08:03" (1/1) ... [2022-07-20 06:08:03,608 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 06:08:03,644 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 06:08:03,852 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22034,22047] [2022-07-20 06:08:03,864 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22307,22320] [2022-07-20 06:08:03,865 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22516,22529] [2022-07-20 06:08:03,866 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22586,22599] [2022-07-20 06:08:03,868 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22853,22866] [2022-07-20 06:08:03,869 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22961,22974] [2022-07-20 06:08:03,870 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23192,23205] [2022-07-20 06:08:03,871 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23272,23285] [2022-07-20 06:08:03,872 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23351,23364] [2022-07-20 06:08:03,873 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23441,23454] [2022-07-20 06:08:03,874 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23619,23632] [2022-07-20 06:08:03,875 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23697,23710] [2022-07-20 06:08:03,876 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23774,23787] [2022-07-20 06:08:03,883 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 06:08:03,890 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 06:08:03,917 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22034,22047] [2022-07-20 06:08:03,918 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22307,22320] [2022-07-20 06:08:03,919 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22516,22529] [2022-07-20 06:08:03,920 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22586,22599] [2022-07-20 06:08:03,921 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22853,22866] [2022-07-20 06:08:03,922 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22961,22974] [2022-07-20 06:08:03,923 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23192,23205] [2022-07-20 06:08:03,924 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23272,23285] [2022-07-20 06:08:03,924 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23351,23364] [2022-07-20 06:08:03,925 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23441,23454] [2022-07-20 06:08:03,926 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23619,23632] [2022-07-20 06:08:03,926 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23697,23710] [2022-07-20 06:08:03,927 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23774,23787] [2022-07-20 06:08:03,928 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 06:08:03,953 INFO L208 MainTranslator]: Completed translation [2022-07-20 06:08:03,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:08:03 WrapperNode [2022-07-20 06:08:03,955 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 06:08:03,956 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 06:08:03,956 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 06:08:03,956 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 06:08:03,961 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:08:03" (1/1) ... [2022-07-20 06:08:03,973 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:08:03" (1/1) ... [2022-07-20 06:08:03,992 INFO L137 Inliner]: procedures = 120, calls = 41, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 225 [2022-07-20 06:08:03,992 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 06:08:03,993 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 06:08:03,993 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 06:08:03,993 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 06:08:03,998 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:08:03" (1/1) ... [2022-07-20 06:08:03,999 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:08:03" (1/1) ... [2022-07-20 06:08:04,001 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:08:03" (1/1) ... [2022-07-20 06:08:04,002 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:08:03" (1/1) ... [2022-07-20 06:08:04,010 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:08:03" (1/1) ... [2022-07-20 06:08:04,015 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:08:03" (1/1) ... [2022-07-20 06:08:04,017 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:08:03" (1/1) ... [2022-07-20 06:08:04,026 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 06:08:04,027 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 06:08:04,027 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 06:08:04,027 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 06:08:04,031 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:08:03" (1/1) ... [2022-07-20 06:08:04,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 06:08:04,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:08:04,054 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-20 06:08:04,061 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-20 06:08:04,078 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 06:08:04,078 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 06:08:04,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 06:08:04,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 06:08:04,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 06:08:04,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-20 06:08:04,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 06:08:04,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 06:08:04,215 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 06:08:04,226 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 06:08:04,762 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 06:08:04,767 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 06:08:04,767 INFO L299 CfgBuilder]: Removed 30 assume(true) statements. [2022-07-20 06:08:04,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:08:04 BoogieIcfgContainer [2022-07-20 06:08:04,769 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 06:08:04,770 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 06:08:04,770 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 06:08:04,772 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 06:08:04,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 06:08:03" (1/3) ... [2022-07-20 06:08:04,774 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20b7b3d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:08:04, skipping insertion in model container [2022-07-20 06:08:04,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:08:03" (2/3) ... [2022-07-20 06:08:04,774 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20b7b3d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:08:04, skipping insertion in model container [2022-07-20 06:08:04,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:08:04" (3/3) ... [2022-07-20 06:08:04,776 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-01-1.i [2022-07-20 06:08:04,786 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 06:08:04,786 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 78 error locations. [2022-07-20 06:08:04,826 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 06:08:04,832 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@6aee3b68, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2df0a7cc [2022-07-20 06:08:04,832 INFO L358 AbstractCegarLoop]: Starting to check reachability of 78 error locations. [2022-07-20 06:08:04,836 INFO L276 IsEmpty]: Start isEmpty. Operand has 187 states, 108 states have (on average 2.212962962962963) internal successors, (239), 186 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-20 06:08:04,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-20 06:08:04,840 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:04,840 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-20 06:08:04,841 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:08:04,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:04,845 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-20 06:08:04,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:04,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1255461687] [2022-07-20 06:08:04,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:04,854 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:04,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:04,869 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:08:04,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-20 06:08:04,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:04,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 06:08:04,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:04,988 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-20 06:08:04,997 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-20 06:08:04,997 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:04,997 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:04,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1255461687] [2022-07-20 06:08:04,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1255461687] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:04,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:04,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:08:05,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282219700] [2022-07-20 06:08:05,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:05,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:08:05,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:05,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:08:05,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:08:05,034 INFO L87 Difference]: Start difference. First operand has 187 states, 108 states have (on average 2.212962962962963) internal successors, (239), 186 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) 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-20 06:08:05,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:05,254 INFO L93 Difference]: Finished difference Result 189 states and 198 transitions. [2022-07-20 06:08:05,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:08:05,256 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-20 06:08:05,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:05,262 INFO L225 Difference]: With dead ends: 189 [2022-07-20 06:08:05,262 INFO L226 Difference]: Without dead ends: 185 [2022-07-20 06:08:05,265 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-20 06:08:05,269 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 179 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:05,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 116 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:08:05,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-07-20 06:08:05,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 180. [2022-07-20 06:08:05,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 110 states have (on average 1.7454545454545454) internal successors, (192), 179 states have internal predecessors, (192), 0 states have call successors, (0), 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-20 06:08:05,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 192 transitions. [2022-07-20 06:08:05,308 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 192 transitions. Word has length 3 [2022-07-20 06:08:05,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:05,308 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 192 transitions. [2022-07-20 06:08:05,308 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-20 06:08:05,308 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 192 transitions. [2022-07-20 06:08:05,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-20 06:08:05,308 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:05,308 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-20 06:08:05,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-20 06:08:05,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:08:05,517 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:08:05,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:05,518 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-20 06:08:05,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:05,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1597496125] [2022-07-20 06:08:05,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:05,519 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:05,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:05,520 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:08:05,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-20 06:08:05,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:05,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 06:08:05,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:05,562 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-20 06:08:05,569 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-20 06:08:05,570 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:05,570 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:05,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1597496125] [2022-07-20 06:08:05,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1597496125] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:05,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:05,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:08:05,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530097869] [2022-07-20 06:08:05,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:05,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:08:05,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:05,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:08:05,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:08:05,572 INFO L87 Difference]: Start difference. First operand 180 states and 192 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-20 06:08:05,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:05,779 INFO L93 Difference]: Finished difference Result 210 states and 221 transitions. [2022-07-20 06:08:05,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:08:05,780 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-20 06:08:05,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:05,781 INFO L225 Difference]: With dead ends: 210 [2022-07-20 06:08:05,781 INFO L226 Difference]: Without dead ends: 210 [2022-07-20 06:08:05,781 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-20 06:08:05,782 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 169 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:05,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 142 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:08:05,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-07-20 06:08:05,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 190. [2022-07-20 06:08:05,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 127 states have (on average 1.6771653543307086) internal successors, (213), 189 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:05,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 213 transitions. [2022-07-20 06:08:05,789 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 213 transitions. Word has length 3 [2022-07-20 06:08:05,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:05,789 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 213 transitions. [2022-07-20 06:08:05,789 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-20 06:08:05,789 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 213 transitions. [2022-07-20 06:08:05,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-20 06:08:05,790 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:05,790 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-20 06:08:05,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-20 06:08:05,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:08:05,997 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:08:06,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:06,001 INFO L85 PathProgramCache]: Analyzing trace with hash 28691969, now seen corresponding path program 1 times [2022-07-20 06:08:06,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:06,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [652645347] [2022-07-20 06:08:06,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:06,002 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:06,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:06,003 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:08:06,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-20 06:08:06,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:06,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 06:08:06,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:06,048 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-20 06:08:06,048 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:06,048 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:06,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [652645347] [2022-07-20 06:08:06,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [652645347] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:06,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:06,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:08:06,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335975137] [2022-07-20 06:08:06,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:06,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:08:06,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:06,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:08:06,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:08:06,049 INFO L87 Difference]: Start difference. First operand 190 states and 213 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:06,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:06,098 INFO L93 Difference]: Finished difference Result 205 states and 216 transitions. [2022-07-20 06:08:06,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:08:06,098 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-20 06:08:06,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:06,099 INFO L225 Difference]: With dead ends: 205 [2022-07-20 06:08:06,099 INFO L226 Difference]: Without dead ends: 205 [2022-07-20 06:08:06,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-20 06:08:06,100 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 166 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:06,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 193 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:08:06,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-07-20 06:08:06,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 188. [2022-07-20 06:08:06,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 126 states have (on average 1.6666666666666667) internal successors, (210), 187 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:06,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 210 transitions. [2022-07-20 06:08:06,105 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 210 transitions. Word has length 5 [2022-07-20 06:08:06,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:06,105 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 210 transitions. [2022-07-20 06:08:06,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:06,106 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 210 transitions. [2022-07-20 06:08:06,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-20 06:08:06,106 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:06,106 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:06,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-20 06:08:06,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:08:06,314 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:08:06,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:06,315 INFO L85 PathProgramCache]: Analyzing trace with hash 817795170, now seen corresponding path program 1 times [2022-07-20 06:08:06,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:06,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1336143322] [2022-07-20 06:08:06,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:06,315 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:06,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:06,316 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:08:06,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-20 06:08:06,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:06,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-20 06:08:06,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:06,367 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-20 06:08:06,380 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-20 06:08:06,396 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 21 treesize of output 9 [2022-07-20 06:08:06,402 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-20 06:08:06,402 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:06,402 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:06,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1336143322] [2022-07-20 06:08:06,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1336143322] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:06,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:06,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:08:06,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468396571] [2022-07-20 06:08:06,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:06,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:08:06,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:06,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:08:06,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:08:06,404 INFO L87 Difference]: Start difference. First operand 188 states and 210 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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-20 06:08:06,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:06,702 INFO L93 Difference]: Finished difference Result 187 states and 209 transitions. [2022-07-20 06:08:06,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:08:06,702 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-07-20 06:08:06,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:06,703 INFO L225 Difference]: With dead ends: 187 [2022-07-20 06:08:06,703 INFO L226 Difference]: Without dead ends: 187 [2022-07-20 06:08:06,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 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-20 06:08:06,704 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 4 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:06,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 506 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 06:08:06,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-07-20 06:08:06,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2022-07-20 06:08:06,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 126 states have (on average 1.6587301587301588) internal successors, (209), 186 states have internal predecessors, (209), 0 states have call successors, (0), 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-20 06:08:06,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 209 transitions. [2022-07-20 06:08:06,710 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 209 transitions. Word has length 10 [2022-07-20 06:08:06,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:06,710 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 209 transitions. [2022-07-20 06:08:06,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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-20 06:08:06,710 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 209 transitions. [2022-07-20 06:08:06,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-20 06:08:06,710 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:06,710 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:06,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-20 06:08:06,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:08:06,919 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:08:06,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:06,920 INFO L85 PathProgramCache]: Analyzing trace with hash 817795171, now seen corresponding path program 1 times [2022-07-20 06:08:06,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:06,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1541578549] [2022-07-20 06:08:06,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:06,920 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:06,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:06,921 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:08:06,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-20 06:08:06,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:06,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-20 06:08:06,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:06,982 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-20 06:08:07,017 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-20 06:08:07,023 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-20 06:08:07,048 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 19 treesize of output 7 [2022-07-20 06:08:07,052 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 21 treesize of output 9 [2022-07-20 06:08:07,063 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-20 06:08:07,064 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:07,064 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:07,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1541578549] [2022-07-20 06:08:07,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1541578549] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:07,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:07,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:08:07,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716425883] [2022-07-20 06:08:07,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:07,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:08:07,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:07,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:08:07,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:08:07,066 INFO L87 Difference]: Start difference. First operand 187 states and 209 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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-20 06:08:07,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:07,395 INFO L93 Difference]: Finished difference Result 186 states and 208 transitions. [2022-07-20 06:08:07,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:08:07,395 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-07-20 06:08:07,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:07,396 INFO L225 Difference]: With dead ends: 186 [2022-07-20 06:08:07,396 INFO L226 Difference]: Without dead ends: 186 [2022-07-20 06:08:07,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:08:07,397 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 2 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:07,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 517 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 06:08:07,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-07-20 06:08:07,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2022-07-20 06:08:07,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 126 states have (on average 1.6507936507936507) internal successors, (208), 185 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-20 06:08:07,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 208 transitions. [2022-07-20 06:08:07,401 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 208 transitions. Word has length 10 [2022-07-20 06:08:07,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:07,401 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 208 transitions. [2022-07-20 06:08:07,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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-20 06:08:07,401 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 208 transitions. [2022-07-20 06:08:07,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-20 06:08:07,401 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:07,401 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:07,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-07-20 06:08:07,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:08:07,610 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:08:07,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:07,610 INFO L85 PathProgramCache]: Analyzing trace with hash -346313996, now seen corresponding path program 1 times [2022-07-20 06:08:07,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:07,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1413373891] [2022-07-20 06:08:07,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:07,611 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:07,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:07,612 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:08:07,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-20 06:08:07,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:07,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-20 06:08:07,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:07,659 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-20 06:08:07,663 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-20 06:08:07,678 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 19 treesize of output 7 [2022-07-20 06:08:07,681 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 19 treesize of output 7 [2022-07-20 06:08:07,696 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-20 06:08:07,696 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:07,696 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:07,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1413373891] [2022-07-20 06:08:07,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1413373891] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:07,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:07,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 06:08:07,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282424066] [2022-07-20 06:08:07,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:07,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:08:07,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:07,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:08:07,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:08:07,698 INFO L87 Difference]: Start difference. First operand 186 states and 208 transitions. Second operand has 5 states, 5 states have (on average 2.4) 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-20 06:08:07,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:07,908 INFO L93 Difference]: Finished difference Result 278 states and 305 transitions. [2022-07-20 06:08:07,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 06:08:07,909 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) 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-20 06:08:07,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:07,909 INFO L225 Difference]: With dead ends: 278 [2022-07-20 06:08:07,909 INFO L226 Difference]: Without dead ends: 278 [2022-07-20 06:08:07,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 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-20 06:08:07,910 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 101 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:07,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 584 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:08:07,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-07-20 06:08:07,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 189. [2022-07-20 06:08:07,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 129 states have (on average 1.6356589147286822) internal successors, (211), 188 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:07,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 211 transitions. [2022-07-20 06:08:07,914 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 211 transitions. Word has length 12 [2022-07-20 06:08:07,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:07,914 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 211 transitions. [2022-07-20 06:08:07,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) 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-20 06:08:07,914 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 211 transitions. [2022-07-20 06:08:07,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-20 06:08:07,914 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:07,914 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:07,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-20 06:08:08,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:08:08,121 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:08:08,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:08,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1881418510, now seen corresponding path program 1 times [2022-07-20 06:08:08,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:08,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1319222600] [2022-07-20 06:08:08,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:08,122 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:08,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:08,123 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:08:08,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-20 06:08:08,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:08,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-20 06:08:08,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:08,190 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-20 06:08:08,252 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-20 06:08:08,261 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:08:08,261 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-20 06:08:08,286 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-20 06:08:08,309 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-20 06:08:08,396 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:08:08,396 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 46 treesize of output 45 [2022-07-20 06:08:08,403 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-20 06:08:08,428 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 25 treesize of output 13 [2022-07-20 06:08:08,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2022-07-20 06:08:08,446 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-20 06:08:08,446 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:08,446 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:08,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1319222600] [2022-07-20 06:08:08,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1319222600] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:08,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:08,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 06:08:08,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558245589] [2022-07-20 06:08:08,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:08,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 06:08:08,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:08,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 06:08:08,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:08:08,447 INFO L87 Difference]: Start difference. First operand 189 states and 211 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:08,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:08,979 INFO L93 Difference]: Finished difference Result 206 states and 218 transitions. [2022-07-20 06:08:08,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 06:08:08,979 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-20 06:08:08,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:08,980 INFO L225 Difference]: With dead ends: 206 [2022-07-20 06:08:08,980 INFO L226 Difference]: Without dead ends: 206 [2022-07-20 06:08:08,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-07-20 06:08:08,981 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 159 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:08,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 398 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-20 06:08:08,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-07-20 06:08:08,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 188. [2022-07-20 06:08:08,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 129 states have (on average 1.627906976744186) internal successors, (210), 187 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:08,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 210 transitions. [2022-07-20 06:08:08,984 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 210 transitions. Word has length 13 [2022-07-20 06:08:08,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:08,984 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 210 transitions. [2022-07-20 06:08:08,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:08,984 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 210 transitions. [2022-07-20 06:08:08,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-20 06:08:08,984 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:08,984 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:09,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-20 06:08:09,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:08:09,190 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:08:09,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:09,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1881418509, now seen corresponding path program 1 times [2022-07-20 06:08:09,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:09,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [377496946] [2022-07-20 06:08:09,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:09,191 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:09,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:09,192 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:08:09,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-20 06:08:09,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:09,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-20 06:08:09,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:09,288 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-20 06:08:09,289 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 21 [2022-07-20 06:08:09,347 INFO L356 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2022-07-20 06:08:09,347 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2022-07-20 06:08:09,408 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-20 06:08:09,519 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:08:09,519 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 55 treesize of output 54 [2022-07-20 06:08:09,552 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 52 treesize of output 28 [2022-07-20 06:08:09,601 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-20 06:08:09,601 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:09,601 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:09,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [377496946] [2022-07-20 06:08:09,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [377496946] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:09,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:09,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 06:08:09,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967271136] [2022-07-20 06:08:09,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:09,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 06:08:09,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:09,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 06:08:09,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:08:09,602 INFO L87 Difference]: Start difference. First operand 188 states and 210 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:10,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:10,152 INFO L93 Difference]: Finished difference Result 188 states and 209 transitions. [2022-07-20 06:08:10,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 06:08:10,153 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-20 06:08:10,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:10,154 INFO L225 Difference]: With dead ends: 188 [2022-07-20 06:08:10,154 INFO L226 Difference]: Without dead ends: 188 [2022-07-20 06:08:10,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2022-07-20 06:08:10,154 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 326 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 67 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:10,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 529 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 273 Invalid, 0 Unknown, 67 Unchecked, 0.4s Time] [2022-07-20 06:08:10,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-07-20 06:08:10,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 187. [2022-07-20 06:08:10,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 129 states have (on average 1.62015503875969) internal successors, (209), 186 states have internal predecessors, (209), 0 states have call successors, (0), 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-20 06:08:10,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 209 transitions. [2022-07-20 06:08:10,157 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 209 transitions. Word has length 13 [2022-07-20 06:08:10,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:10,157 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 209 transitions. [2022-07-20 06:08:10,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:10,157 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 209 transitions. [2022-07-20 06:08:10,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-20 06:08:10,158 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:10,158 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:10,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-20 06:08:10,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:08:10,364 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:08:10,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:10,365 INFO L85 PathProgramCache]: Analyzing trace with hash -2093632455, now seen corresponding path program 1 times [2022-07-20 06:08:10,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:10,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [890813308] [2022-07-20 06:08:10,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:10,365 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:10,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:10,366 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:08:10,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-20 06:08:10,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:10,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-20 06:08:10,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:10,435 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-20 06:08:10,439 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-20 06:08:10,460 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 19 treesize of output 7 [2022-07-20 06:08:10,462 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 19 treesize of output 7 [2022-07-20 06:08:10,489 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-20 06:08:10,490 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:10,490 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:10,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [890813308] [2022-07-20 06:08:10,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [890813308] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:10,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:10,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 06:08:10,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471659553] [2022-07-20 06:08:10,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:10,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:08:10,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:10,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:08:10,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:08:10,491 INFO L87 Difference]: Start difference. First operand 187 states and 209 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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-20 06:08:10,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:10,706 INFO L93 Difference]: Finished difference Result 275 states and 302 transitions. [2022-07-20 06:08:10,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 06:08:10,706 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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-20 06:08:10,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:10,707 INFO L225 Difference]: With dead ends: 275 [2022-07-20 06:08:10,707 INFO L226 Difference]: Without dead ends: 275 [2022-07-20 06:08:10,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 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-20 06:08:10,708 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 89 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:10,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 574 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:08:10,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-07-20 06:08:10,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 190. [2022-07-20 06:08:10,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 132 states have (on average 1.606060606060606) internal successors, (212), 189 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:10,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 212 transitions. [2022-07-20 06:08:10,711 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 212 transitions. Word has length 14 [2022-07-20 06:08:10,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:10,711 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 212 transitions. [2022-07-20 06:08:10,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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-20 06:08:10,711 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 212 transitions. [2022-07-20 06:08:10,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-20 06:08:10,711 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:10,711 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:10,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-20 06:08:10,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:08:10,917 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:08:10,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:10,918 INFO L85 PathProgramCache]: Analyzing trace with hash 114589944, now seen corresponding path program 1 times [2022-07-20 06:08:10,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:10,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1321204590] [2022-07-20 06:08:10,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:10,918 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:10,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:10,923 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:08:10,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-20 06:08:10,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:10,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 06:08:10,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:10,982 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-20 06:08:11,012 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-20 06:08:11,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 17 [2022-07-20 06:08:11,019 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-20 06:08:11,019 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:11,020 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:11,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1321204590] [2022-07-20 06:08:11,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1321204590] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:11,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:11,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:08:11,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610271393] [2022-07-20 06:08:11,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:11,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:08:11,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:11,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:08:11,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:08:11,021 INFO L87 Difference]: Start difference. First operand 190 states and 212 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:11,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:11,234 INFO L93 Difference]: Finished difference Result 186 states and 206 transitions. [2022-07-20 06:08:11,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 06:08:11,235 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-20 06:08:11,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:11,236 INFO L225 Difference]: With dead ends: 186 [2022-07-20 06:08:11,236 INFO L226 Difference]: Without dead ends: 186 [2022-07-20 06:08:11,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:08:11,236 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 244 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:11,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 113 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:08:11,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-07-20 06:08:11,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 181. [2022-07-20 06:08:11,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 134 states have (on average 1.5149253731343284) internal successors, (203), 180 states have internal predecessors, (203), 0 states have call successors, (0), 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-20 06:08:11,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 203 transitions. [2022-07-20 06:08:11,239 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 203 transitions. Word has length 17 [2022-07-20 06:08:11,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:11,240 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 203 transitions. [2022-07-20 06:08:11,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:11,240 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 203 transitions. [2022-07-20 06:08:11,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-20 06:08:11,240 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:11,240 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:11,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-20 06:08:11,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:08:11,447 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:08:11,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:11,448 INFO L85 PathProgramCache]: Analyzing trace with hash 114589945, now seen corresponding path program 1 times [2022-07-20 06:08:11,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:11,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [429388327] [2022-07-20 06:08:11,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:11,448 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:11,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:11,449 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:08:11,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-20 06:08:11,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:11,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 06:08:11,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:11,522 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-20 06:08:11,586 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:08:11,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-07-20 06:08:11,597 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-20 06:08:11,597 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:11,597 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:11,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [429388327] [2022-07-20 06:08:11,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [429388327] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:11,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:11,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:08:11,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107051251] [2022-07-20 06:08:11,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:11,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:08:11,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:11,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:08:11,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:08:11,598 INFO L87 Difference]: Start difference. First operand 181 states and 203 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:11,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:11,889 INFO L93 Difference]: Finished difference Result 236 states and 251 transitions. [2022-07-20 06:08:11,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 06:08:11,889 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-20 06:08:11,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:11,890 INFO L225 Difference]: With dead ends: 236 [2022-07-20 06:08:11,890 INFO L226 Difference]: Without dead ends: 236 [2022-07-20 06:08:11,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:08:11,891 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 226 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:11,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 196 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 06:08:11,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-07-20 06:08:11,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 201. [2022-07-20 06:08:11,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 154 states have (on average 1.525974025974026) internal successors, (235), 200 states have internal predecessors, (235), 0 states have call successors, (0), 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-20 06:08:11,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 235 transitions. [2022-07-20 06:08:11,894 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 235 transitions. Word has length 17 [2022-07-20 06:08:11,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:11,894 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 235 transitions. [2022-07-20 06:08:11,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:11,894 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 235 transitions. [2022-07-20 06:08:11,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-20 06:08:11,895 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:11,895 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:11,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-20 06:08:12,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:08:12,095 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:08:12,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:12,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1548164667, now seen corresponding path program 1 times [2022-07-20 06:08:12,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:12,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2056759660] [2022-07-20 06:08:12,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:12,096 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:12,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:12,097 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:08:12,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-20 06:08:12,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:12,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 06:08:12,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:12,182 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-20 06:08:12,183 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:12,183 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:12,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2056759660] [2022-07-20 06:08:12,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2056759660] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:12,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:12,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:08:12,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483267369] [2022-07-20 06:08:12,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:12,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:08:12,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:12,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:08:12,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:08:12,184 INFO L87 Difference]: Start difference. First operand 201 states and 235 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:12,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:12,342 INFO L93 Difference]: Finished difference Result 231 states and 245 transitions. [2022-07-20 06:08:12,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 06:08:12,342 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-20 06:08:12,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:12,343 INFO L225 Difference]: With dead ends: 231 [2022-07-20 06:08:12,343 INFO L226 Difference]: Without dead ends: 231 [2022-07-20 06:08:12,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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-20 06:08:12,343 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 217 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:12,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 262 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:08:12,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-07-20 06:08:12,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 199. [2022-07-20 06:08:12,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 153 states have (on average 1.5163398692810457) internal successors, (232), 198 states have internal predecessors, (232), 0 states have call successors, (0), 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-20 06:08:12,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 232 transitions. [2022-07-20 06:08:12,346 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 232 transitions. Word has length 19 [2022-07-20 06:08:12,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:12,346 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 232 transitions. [2022-07-20 06:08:12,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:12,346 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 232 transitions. [2022-07-20 06:08:12,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-20 06:08:12,346 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:12,346 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:12,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-20 06:08:12,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:08:12,553 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:08:12,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:12,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1772498566, now seen corresponding path program 1 times [2022-07-20 06:08:12,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:12,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [257845536] [2022-07-20 06:08:12,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:12,554 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:12,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:12,555 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:08:12,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-20 06:08:12,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:12,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 06:08:12,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:12,620 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-20 06:08:12,626 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-20 06:08:12,635 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 17 treesize of output 9 [2022-07-20 06:08:12,645 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-20 06:08:12,645 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:12,646 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:12,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [257845536] [2022-07-20 06:08:12,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [257845536] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:12,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:12,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 06:08:12,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558629153] [2022-07-20 06:08:12,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:12,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:08:12,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:12,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:08:12,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:08:12,647 INFO L87 Difference]: Start difference. First operand 199 states and 232 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:12,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:12,991 INFO L93 Difference]: Finished difference Result 199 states and 232 transitions. [2022-07-20 06:08:12,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 06:08:12,991 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-20 06:08:12,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:12,992 INFO L225 Difference]: With dead ends: 199 [2022-07-20 06:08:12,992 INFO L226 Difference]: Without dead ends: 199 [2022-07-20 06:08:12,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-20 06:08:12,992 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 96 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:12,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 419 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 06:08:12,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-07-20 06:08:12,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 198. [2022-07-20 06:08:12,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 153 states have (on average 1.5098039215686274) internal successors, (231), 197 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:12,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 231 transitions. [2022-07-20 06:08:12,995 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 231 transitions. Word has length 21 [2022-07-20 06:08:12,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:12,995 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 231 transitions. [2022-07-20 06:08:12,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:12,995 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 231 transitions. [2022-07-20 06:08:12,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-20 06:08:12,996 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:12,996 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:13,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-20 06:08:13,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:08:13,196 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:08:13,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:13,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1772498565, now seen corresponding path program 1 times [2022-07-20 06:08:13,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:13,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [528507093] [2022-07-20 06:08:13,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:13,197 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:13,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:13,199 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:08:13,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-20 06:08:13,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:13,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-20 06:08:13,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:13,263 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-20 06:08:13,278 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-20 06:08:13,283 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-20 06:08:13,306 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 17 treesize of output 9 [2022-07-20 06:08:13,309 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-20 06:08:13,335 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-20 06:08:13,336 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:13,336 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:13,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [528507093] [2022-07-20 06:08:13,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [528507093] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:13,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:13,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 06:08:13,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566989773] [2022-07-20 06:08:13,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:13,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:08:13,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:13,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:08:13,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:08:13,337 INFO L87 Difference]: Start difference. First operand 198 states and 231 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:13,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:13,754 INFO L93 Difference]: Finished difference Result 191 states and 224 transitions. [2022-07-20 06:08:13,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 06:08:13,754 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-20 06:08:13,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:13,755 INFO L225 Difference]: With dead ends: 191 [2022-07-20 06:08:13,755 INFO L226 Difference]: Without dead ends: 191 [2022-07-20 06:08:13,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-07-20 06:08:13,756 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 39 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:13,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 480 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 06:08:13,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-07-20 06:08:13,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 185. [2022-07-20 06:08:13,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 149 states have (on average 1.4563758389261745) internal successors, (217), 184 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:13,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 217 transitions. [2022-07-20 06:08:13,758 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 217 transitions. Word has length 21 [2022-07-20 06:08:13,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:13,758 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 217 transitions. [2022-07-20 06:08:13,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:13,759 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 217 transitions. [2022-07-20 06:08:13,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-20 06:08:13,759 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:13,759 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:13,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-20 06:08:13,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:08:13,959 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:08:13,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:13,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1228250535, now seen corresponding path program 1 times [2022-07-20 06:08:13,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:13,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1425216079] [2022-07-20 06:08:13,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:13,960 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:13,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:13,961 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:08:13,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-20 06:08:14,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:14,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 06:08:14,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:14,106 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 19 treesize of output 7 [2022-07-20 06:08:14,109 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 19 treesize of output 7 [2022-07-20 06:08:14,134 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-20 06:08:14,134 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:14,134 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:14,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1425216079] [2022-07-20 06:08:14,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1425216079] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:14,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:14,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 06:08:14,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616351173] [2022-07-20 06:08:14,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:14,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 06:08:14,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:14,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 06:08:14,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:08:14,135 INFO L87 Difference]: Start difference. First operand 185 states and 217 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:14,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:14,569 INFO L93 Difference]: Finished difference Result 279 states and 328 transitions. [2022-07-20 06:08:14,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 06:08:14,569 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-20 06:08:14,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:14,570 INFO L225 Difference]: With dead ends: 279 [2022-07-20 06:08:14,570 INFO L226 Difference]: Without dead ends: 279 [2022-07-20 06:08:14,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-07-20 06:08:14,571 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 92 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:14,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 664 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 06:08:14,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-07-20 06:08:14,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 180. [2022-07-20 06:08:14,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 145 states have (on average 1.4620689655172414) internal successors, (212), 179 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:14,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 212 transitions. [2022-07-20 06:08:14,574 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 212 transitions. Word has length 21 [2022-07-20 06:08:14,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:14,574 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 212 transitions. [2022-07-20 06:08:14,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:14,574 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 212 transitions. [2022-07-20 06:08:14,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-20 06:08:14,574 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:14,574 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-20 06:08:14,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-20 06:08:14,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:08:14,775 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:08:14,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:14,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1730897082, now seen corresponding path program 1 times [2022-07-20 06:08:14,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:14,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1614764728] [2022-07-20 06:08:14,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:14,776 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:14,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:14,776 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:08:14,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-20 06:08:14,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:14,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-20 06:08:14,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:14,852 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-20 06:08:14,865 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 16 treesize of output 8 [2022-07-20 06:08:14,880 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-20 06:08:14,880 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:14,880 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:14,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1614764728] [2022-07-20 06:08:14,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1614764728] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:14,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:14,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 06:08:14,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224991235] [2022-07-20 06:08:14,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:14,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:08:14,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:14,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:08:14,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:08:14,882 INFO L87 Difference]: Start difference. First operand 180 states and 212 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:15,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:15,129 INFO L93 Difference]: Finished difference Result 182 states and 215 transitions. [2022-07-20 06:08:15,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 06:08:15,130 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-20 06:08:15,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:15,130 INFO L225 Difference]: With dead ends: 182 [2022-07-20 06:08:15,130 INFO L226 Difference]: Without dead ends: 182 [2022-07-20 06:08:15,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-07-20 06:08:15,131 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 36 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:15,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 574 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:08:15,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-07-20 06:08:15,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 176. [2022-07-20 06:08:15,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 143 states have (on average 1.4545454545454546) internal successors, (208), 175 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-20 06:08:15,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 208 transitions. [2022-07-20 06:08:15,134 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 208 transitions. Word has length 23 [2022-07-20 06:08:15,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:15,134 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 208 transitions. [2022-07-20 06:08:15,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:15,134 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 208 transitions. [2022-07-20 06:08:15,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-20 06:08:15,134 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:15,134 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:15,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-20 06:08:15,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:08:15,335 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:08:15,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:15,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1483282959, now seen corresponding path program 1 times [2022-07-20 06:08:15,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:15,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [594012277] [2022-07-20 06:08:15,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:15,336 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:15,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:15,337 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:08:15,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-20 06:08:15,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:15,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 06:08:15,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:15,407 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-20 06:08:15,408 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:15,408 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:15,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [594012277] [2022-07-20 06:08:15,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [594012277] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:15,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:15,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:08:15,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553998250] [2022-07-20 06:08:15,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:15,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:08:15,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:15,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:08:15,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:08:15,410 INFO L87 Difference]: Start difference. First operand 176 states and 208 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:15,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:15,417 INFO L93 Difference]: Finished difference Result 249 states and 296 transitions. [2022-07-20 06:08:15,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:08:15,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-07-20 06:08:15,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:15,419 INFO L225 Difference]: With dead ends: 249 [2022-07-20 06:08:15,419 INFO L226 Difference]: Without dead ends: 249 [2022-07-20 06:08:15,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 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-20 06:08:15,420 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 50 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 277 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-20 06:08:15,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 277 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:08:15,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-07-20 06:08:15,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 182. [2022-07-20 06:08:15,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 149 states have (on average 1.4496644295302012) internal successors, (216), 181 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:15,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 216 transitions. [2022-07-20 06:08:15,423 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 216 transitions. Word has length 25 [2022-07-20 06:08:15,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:15,423 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 216 transitions. [2022-07-20 06:08:15,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:15,423 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 216 transitions. [2022-07-20 06:08:15,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-20 06:08:15,424 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:15,424 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] [2022-07-20 06:08:15,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-20 06:08:15,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:08:15,631 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:08:15,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:15,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1262857152, now seen corresponding path program 1 times [2022-07-20 06:08:15,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:15,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1392864934] [2022-07-20 06:08:15,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:15,631 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:15,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:15,632 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:08:15,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-20 06:08:15,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:15,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-20 06:08:15,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:15,701 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-20 06:08:15,705 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-20 06:08:15,780 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 19 treesize of output 7 [2022-07-20 06:08:15,783 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 19 treesize of output 7 [2022-07-20 06:08:15,804 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-20 06:08:15,804 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:15,804 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:15,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1392864934] [2022-07-20 06:08:15,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1392864934] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:15,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:15,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 06:08:15,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975563465] [2022-07-20 06:08:15,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:15,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:08:15,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:15,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:08:15,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:08:15,805 INFO L87 Difference]: Start difference. First operand 182 states and 216 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 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-20 06:08:16,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:16,237 INFO L93 Difference]: Finished difference Result 288 states and 330 transitions. [2022-07-20 06:08:16,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 06:08:16,237 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2022-07-20 06:08:16,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:16,238 INFO L225 Difference]: With dead ends: 288 [2022-07-20 06:08:16,238 INFO L226 Difference]: Without dead ends: 288 [2022-07-20 06:08:16,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-20 06:08:16,239 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 201 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:16,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 580 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-20 06:08:16,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2022-07-20 06:08:16,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 195. [2022-07-20 06:08:16,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 162 states have (on average 1.4197530864197532) internal successors, (230), 194 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:16,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 230 transitions. [2022-07-20 06:08:16,242 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 230 transitions. Word has length 26 [2022-07-20 06:08:16,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:16,242 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 230 transitions. [2022-07-20 06:08:16,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 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-20 06:08:16,242 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 230 transitions. [2022-07-20 06:08:16,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-20 06:08:16,242 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:16,242 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] [2022-07-20 06:08:16,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-07-20 06:08:16,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:08:16,443 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:08:16,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:16,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1666208615, now seen corresponding path program 1 times [2022-07-20 06:08:16,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:16,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1411976365] [2022-07-20 06:08:16,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:16,444 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:16,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:16,445 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:08:16,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-07-20 06:08:16,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:16,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-20 06:08:16,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:16,528 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-20 06:08:16,531 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-20 06:08:16,567 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-20 06:08:16,567 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-20 06:08:16,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:08:16,573 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-20 06:08:16,639 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-20 06:08:16,641 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-20 06:08:16,659 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-20 06:08:16,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:08:16,740 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-20 06:08:16,740 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:16,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1411976365] [2022-07-20 06:08:16,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1411976365] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:08:16,741 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:08:16,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2022-07-20 06:08:16,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594290732] [2022-07-20 06:08:16,741 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:08:16,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:08:16,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:16,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:08:16,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:08:16,742 INFO L87 Difference]: Start difference. First operand 195 states and 230 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 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-20 06:08:17,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:17,144 INFO L93 Difference]: Finished difference Result 271 states and 311 transitions. [2022-07-20 06:08:17,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 06:08:17,153 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 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-20 06:08:17,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:17,154 INFO L225 Difference]: With dead ends: 271 [2022-07-20 06:08:17,154 INFO L226 Difference]: Without dead ends: 271 [2022-07-20 06:08:17,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-20 06:08:17,154 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 147 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:17,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 434 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-20 06:08:17,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-07-20 06:08:17,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 222. [2022-07-20 06:08:17,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 189 states have (on average 1.433862433862434) internal successors, (271), 221 states have internal predecessors, (271), 0 states have call successors, (0), 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-20 06:08:17,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 271 transitions. [2022-07-20 06:08:17,158 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 271 transitions. Word has length 29 [2022-07-20 06:08:17,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:17,158 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 271 transitions. [2022-07-20 06:08:17,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 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-20 06:08:17,159 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 271 transitions. [2022-07-20 06:08:17,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-20 06:08:17,159 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:17,159 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-20 06:08:17,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-07-20 06:08:17,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:08:17,379 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:08:17,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:17,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1829307095, now seen corresponding path program 1 times [2022-07-20 06:08:17,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:17,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [522149486] [2022-07-20 06:08:17,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:17,380 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:17,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:17,381 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:08:17,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-20 06:08:17,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:17,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-20 06:08:17,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:17,468 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-20 06:08:17,476 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-20 06:08:17,487 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 21 treesize of output 9 [2022-07-20 06:08:17,493 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-20 06:08:17,493 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:17,494 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:17,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [522149486] [2022-07-20 06:08:17,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [522149486] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:17,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:17,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:08:17,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655147522] [2022-07-20 06:08:17,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:17,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:08:17,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:17,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:08:17,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:08:17,495 INFO L87 Difference]: Start difference. First operand 222 states and 271 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 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-20 06:08:17,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:17,753 INFO L93 Difference]: Finished difference Result 221 states and 270 transitions. [2022-07-20 06:08:17,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:08:17,754 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 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-20 06:08:17,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:17,754 INFO L225 Difference]: With dead ends: 221 [2022-07-20 06:08:17,754 INFO L226 Difference]: Without dead ends: 221 [2022-07-20 06:08:17,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 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-20 06:08:17,755 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 4 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:17,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 404 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:08:17,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-07-20 06:08:17,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2022-07-20 06:08:17,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 189 states have (on average 1.4285714285714286) internal successors, (270), 220 states have internal predecessors, (270), 0 states have call successors, (0), 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-20 06:08:17,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 270 transitions. [2022-07-20 06:08:17,758 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 270 transitions. Word has length 30 [2022-07-20 06:08:17,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:17,758 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 270 transitions. [2022-07-20 06:08:17,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 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-20 06:08:17,758 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 270 transitions. [2022-07-20 06:08:17,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-20 06:08:17,759 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:17,759 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-20 06:08:17,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-07-20 06:08:17,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:08:17,966 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:08:17,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:17,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1829307096, now seen corresponding path program 1 times [2022-07-20 06:08:17,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:17,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [151267081] [2022-07-20 06:08:17,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:17,967 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:17,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:17,968 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:08:17,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-20 06:08:18,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:18,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-20 06:08:18,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:18,058 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-20 06:08:18,078 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-20 06:08:18,085 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-20 06:08:18,104 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 21 treesize of output 9 [2022-07-20 06:08:18,107 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 19 treesize of output 7 [2022-07-20 06:08:18,117 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-20 06:08:18,117 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:18,117 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:18,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [151267081] [2022-07-20 06:08:18,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [151267081] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:18,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:18,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:08:18,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487363081] [2022-07-20 06:08:18,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:18,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:08:18,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:18,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:08:18,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:08:18,119 INFO L87 Difference]: Start difference. First operand 221 states and 270 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 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-20 06:08:18,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:18,401 INFO L93 Difference]: Finished difference Result 220 states and 269 transitions. [2022-07-20 06:08:18,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:08:18,401 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 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-20 06:08:18,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:18,402 INFO L225 Difference]: With dead ends: 220 [2022-07-20 06:08:18,402 INFO L226 Difference]: Without dead ends: 220 [2022-07-20 06:08:18,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 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-20 06:08:18,403 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 2 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:18,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 407 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 06:08:18,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-07-20 06:08:18,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2022-07-20 06:08:18,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 189 states have (on average 1.4232804232804233) internal successors, (269), 219 states have internal predecessors, (269), 0 states have call successors, (0), 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-20 06:08:18,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 269 transitions. [2022-07-20 06:08:18,406 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 269 transitions. Word has length 30 [2022-07-20 06:08:18,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:18,406 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 269 transitions. [2022-07-20 06:08:18,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 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-20 06:08:18,406 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 269 transitions. [2022-07-20 06:08:18,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-20 06:08:18,406 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:18,406 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] [2022-07-20 06:08:18,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-07-20 06:08:18,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:08:18,607 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:08:18,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:18,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1635129317, now seen corresponding path program 1 times [2022-07-20 06:08:18,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:18,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [118251833] [2022-07-20 06:08:18,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:18,607 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:18,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:18,608 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:08:18,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-07-20 06:08:18,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:18,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 06:08:18,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:18,698 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-20 06:08:18,698 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:18,698 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:18,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [118251833] [2022-07-20 06:08:18,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [118251833] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:18,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:18,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:08:18,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118823866] [2022-07-20 06:08:18,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:18,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:08:18,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:18,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:08:18,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:08:18,699 INFO L87 Difference]: Start difference. First operand 220 states and 269 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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-20 06:08:18,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:18,720 INFO L93 Difference]: Finished difference Result 218 states and 265 transitions. [2022-07-20 06:08:18,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:08:18,722 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-20 06:08:18,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:18,723 INFO L225 Difference]: With dead ends: 218 [2022-07-20 06:08:18,723 INFO L226 Difference]: Without dead ends: 218 [2022-07-20 06:08:18,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 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-20 06:08:18,723 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 20 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 244 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-20 06:08:18,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 244 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:08:18,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-07-20 06:08:18,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2022-07-20 06:08:18,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 188 states have (on average 1.4095744680851063) internal successors, (265), 217 states have internal predecessors, (265), 0 states have call successors, (0), 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-20 06:08:18,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 265 transitions. [2022-07-20 06:08:18,726 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 265 transitions. Word has length 31 [2022-07-20 06:08:18,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:18,726 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 265 transitions. [2022-07-20 06:08:18,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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-20 06:08:18,726 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 265 transitions. [2022-07-20 06:08:18,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-20 06:08:18,727 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:18,727 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] [2022-07-20 06:08:18,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-07-20 06:08:18,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:08:18,934 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:08:18,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:18,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1054040681, now seen corresponding path program 1 times [2022-07-20 06:08:18,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:18,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [785650532] [2022-07-20 06:08:18,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:18,935 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:18,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:18,936 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:08:18,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-07-20 06:08:19,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:19,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-20 06:08:19,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:19,018 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-20 06:08:19,022 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-20 06:08:19,037 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 19 treesize of output 7 [2022-07-20 06:08:19,040 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 19 treesize of output 7 [2022-07-20 06:08:19,054 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-20 06:08:19,054 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:19,054 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:19,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [785650532] [2022-07-20 06:08:19,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [785650532] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:19,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:19,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 06:08:19,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003164637] [2022-07-20 06:08:19,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:19,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:08:19,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:19,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:08:19,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:08:19,056 INFO L87 Difference]: Start difference. First operand 218 states and 265 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 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-20 06:08:19,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:19,254 INFO L93 Difference]: Finished difference Result 233 states and 281 transitions. [2022-07-20 06:08:19,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 06:08:19,255 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 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-20 06:08:19,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:19,256 INFO L225 Difference]: With dead ends: 233 [2022-07-20 06:08:19,256 INFO L226 Difference]: Without dead ends: 233 [2022-07-20 06:08:19,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 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-20 06:08:19,256 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 20 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:19,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 500 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:08:19,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-07-20 06:08:19,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 221. [2022-07-20 06:08:19,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 191 states have (on average 1.4031413612565444) internal successors, (268), 220 states have internal predecessors, (268), 0 states have call successors, (0), 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-20 06:08:19,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 268 transitions. [2022-07-20 06:08:19,260 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 268 transitions. Word has length 32 [2022-07-20 06:08:19,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:19,260 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 268 transitions. [2022-07-20 06:08:19,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 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-20 06:08:19,260 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 268 transitions. [2022-07-20 06:08:19,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-20 06:08:19,260 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:19,261 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:19,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Ended with exit code 0 [2022-07-20 06:08:19,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:08:19,468 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:08:19,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:19,469 INFO L85 PathProgramCache]: Analyzing trace with hash 850603051, now seen corresponding path program 1 times [2022-07-20 06:08:19,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:19,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [208289122] [2022-07-20 06:08:19,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:19,469 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:19,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:19,470 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:08:19,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-07-20 06:08:19,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:19,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-20 06:08:19,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:19,603 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-20 06:08:19,621 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-20 06:08:19,622 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 24 [2022-07-20 06:08:19,638 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-20 06:08:19,686 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:08:19,686 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 34 treesize of output 35 [2022-07-20 06:08:19,726 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:08:19,727 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 34 treesize of output 35 [2022-07-20 06:08:19,803 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 31 treesize of output 13 [2022-07-20 06:08:19,865 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-20 06:08:19,865 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:19,866 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:19,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [208289122] [2022-07-20 06:08:19,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [208289122] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:19,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:19,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 06:08:19,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570451111] [2022-07-20 06:08:19,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:19,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 06:08:19,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:19,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 06:08:19,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-07-20 06:08:19,867 INFO L87 Difference]: Start difference. First operand 221 states and 268 transitions. Second operand has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 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-20 06:08:20,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:20,587 INFO L93 Difference]: Finished difference Result 297 states and 335 transitions. [2022-07-20 06:08:20,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 06:08:20,588 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 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-20 06:08:20,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:20,589 INFO L225 Difference]: With dead ends: 297 [2022-07-20 06:08:20,589 INFO L226 Difference]: Without dead ends: 297 [2022-07-20 06:08:20,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-07-20 06:08:20,589 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 340 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 169 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:20,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 737 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 376 Invalid, 0 Unknown, 169 Unchecked, 0.5s Time] [2022-07-20 06:08:20,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-07-20 06:08:20,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 230. [2022-07-20 06:08:20,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 200 states have (on average 1.41) internal successors, (282), 229 states have internal predecessors, (282), 0 states have call successors, (0), 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-20 06:08:20,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 282 transitions. [2022-07-20 06:08:20,593 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 282 transitions. Word has length 32 [2022-07-20 06:08:20,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:20,593 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 282 transitions. [2022-07-20 06:08:20,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 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-20 06:08:20,593 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 282 transitions. [2022-07-20 06:08:20,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-20 06:08:20,593 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:20,593 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] [2022-07-20 06:08:20,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Ended with exit code 0 [2022-07-20 06:08:20,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:08:20,794 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:08:20,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:20,794 INFO L85 PathProgramCache]: Analyzing trace with hash 850603052, now seen corresponding path program 1 times [2022-07-20 06:08:20,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:20,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [37387729] [2022-07-20 06:08:20,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:20,794 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:20,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:20,795 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:08:20,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-07-20 06:08:20,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:20,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-20 06:08:20,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:20,889 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-20 06:08:20,915 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:08:20,916 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-20 06:08:20,920 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:08:20,933 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-20 06:08:20,938 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-20 06:08:21,015 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:08:21,015 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 46 treesize of output 45 [2022-07-20 06:08:21,019 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-20 06:08:21,084 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:08:21,084 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 46 treesize of output 45 [2022-07-20 06:08:21,088 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-20 06:08:21,226 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 31 treesize of output 13 [2022-07-20 06:08:21,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 19 treesize of output 7 [2022-07-20 06:08:21,280 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-20 06:08:21,280 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:21,280 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:21,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [37387729] [2022-07-20 06:08:21,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [37387729] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:21,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:21,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 06:08:21,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146228310] [2022-07-20 06:08:21,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:21,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 06:08:21,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:21,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 06:08:21,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-20 06:08:21,282 INFO L87 Difference]: Start difference. First operand 230 states and 282 transitions. Second operand has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 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-20 06:08:22,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:22,487 INFO L93 Difference]: Finished difference Result 371 states and 411 transitions. [2022-07-20 06:08:22,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-20 06:08:22,488 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 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-20 06:08:22,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:22,489 INFO L225 Difference]: With dead ends: 371 [2022-07-20 06:08:22,489 INFO L226 Difference]: Without dead ends: 371 [2022-07-20 06:08:22,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2022-07-20 06:08:22,490 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 436 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:22,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 806 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-20 06:08:22,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2022-07-20 06:08:22,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 230. [2022-07-20 06:08:22,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 200 states have (on average 1.395) internal successors, (279), 229 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-20 06:08:22,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 279 transitions. [2022-07-20 06:08:22,493 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 279 transitions. Word has length 32 [2022-07-20 06:08:22,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:22,494 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 279 transitions. [2022-07-20 06:08:22,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 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-20 06:08:22,494 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 279 transitions. [2022-07-20 06:08:22,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-20 06:08:22,494 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:22,494 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:22,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2022-07-20 06:08:22,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:08:22,701 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:08:22,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:22,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1952226646, now seen corresponding path program 1 times [2022-07-20 06:08:22,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:22,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [781638571] [2022-07-20 06:08:22,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:22,702 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:22,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:22,703 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:08:22,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-07-20 06:08:22,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:22,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-20 06:08:22,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:22,826 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-20 06:08:22,832 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-20 06:08:22,843 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 17 treesize of output 9 [2022-07-20 06:08:22,873 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-20 06:08:22,873 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 24 [2022-07-20 06:08:22,890 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-20 06:08:22,951 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:08:22,951 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 34 treesize of output 35 [2022-07-20 06:08:22,963 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 31 treesize of output 13 [2022-07-20 06:08:22,985 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-20 06:08:22,985 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:22,985 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:22,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [781638571] [2022-07-20 06:08:22,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [781638571] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:22,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:22,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 06:08:22,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110358107] [2022-07-20 06:08:22,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:22,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 06:08:22,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:22,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 06:08:22,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-20 06:08:22,987 INFO L87 Difference]: Start difference. First operand 230 states and 279 transitions. Second operand has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:23,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:23,481 INFO L93 Difference]: Finished difference Result 230 states and 279 transitions. [2022-07-20 06:08:23,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 06:08:23,482 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-07-20 06:08:23,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:23,483 INFO L225 Difference]: With dead ends: 230 [2022-07-20 06:08:23,484 INFO L226 Difference]: Without dead ends: 230 [2022-07-20 06:08:23,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-07-20 06:08:23,484 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 71 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:23,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 592 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 341 Invalid, 0 Unknown, 52 Unchecked, 0.4s Time] [2022-07-20 06:08:23,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-07-20 06:08:23,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2022-07-20 06:08:23,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 200 states have (on average 1.39) internal successors, (278), 228 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-20 06:08:23,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 278 transitions. [2022-07-20 06:08:23,494 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 278 transitions. Word has length 33 [2022-07-20 06:08:23,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:23,495 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 278 transitions. [2022-07-20 06:08:23,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:23,500 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 278 transitions. [2022-07-20 06:08:23,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-20 06:08:23,500 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:23,500 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:23,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2022-07-20 06:08:23,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:08:23,707 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:08:23,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:23,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1952226645, now seen corresponding path program 1 times [2022-07-20 06:08:23,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:23,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [81030167] [2022-07-20 06:08:23,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:23,708 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:23,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:23,709 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:08:23,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-07-20 06:08:23,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:23,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-20 06:08:23,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:23,833 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-20 06:08:23,840 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-20 06:08:23,849 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 17 treesize of output 9 [2022-07-20 06:08:23,871 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:08:23,871 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-20 06:08:23,876 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:08:23,891 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-20 06:08:23,897 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-20 06:08:23,963 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:08:23,964 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 46 treesize of output 45 [2022-07-20 06:08:23,968 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-20 06:08:23,986 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 31 treesize of output 13 [2022-07-20 06:08:23,989 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 19 treesize of output 7 [2022-07-20 06:08:24,004 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-20 06:08:24,005 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:24,005 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:24,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [81030167] [2022-07-20 06:08:24,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [81030167] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:24,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:24,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 06:08:24,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214238472] [2022-07-20 06:08:24,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:24,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 06:08:24,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:24,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 06:08:24,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-20 06:08:24,006 INFO L87 Difference]: Start difference. First operand 229 states and 278 transitions. Second operand has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:24,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:24,762 INFO L93 Difference]: Finished difference Result 229 states and 278 transitions. [2022-07-20 06:08:24,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-20 06:08:24,763 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-07-20 06:08:24,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:24,763 INFO L225 Difference]: With dead ends: 229 [2022-07-20 06:08:24,763 INFO L226 Difference]: Without dead ends: 229 [2022-07-20 06:08:24,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2022-07-20 06:08:24,764 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 71 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:24,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 680 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-20 06:08:24,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-07-20 06:08:24,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 228. [2022-07-20 06:08:24,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 200 states have (on average 1.385) internal successors, (277), 227 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-20 06:08:24,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 277 transitions. [2022-07-20 06:08:24,767 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 277 transitions. Word has length 33 [2022-07-20 06:08:24,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:24,767 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 277 transitions. [2022-07-20 06:08:24,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:24,767 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 277 transitions. [2022-07-20 06:08:24,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-20 06:08:24,767 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:24,767 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:24,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2022-07-20 06:08:24,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:08:24,974 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:08:24,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:24,974 INFO L85 PathProgramCache]: Analyzing trace with hash -373333011, now seen corresponding path program 1 times [2022-07-20 06:08:24,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:24,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [247442529] [2022-07-20 06:08:24,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:24,975 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:24,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:24,976 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:08:24,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-07-20 06:08:25,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:25,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-20 06:08:25,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:25,050 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-20 06:08:25,054 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-20 06:08:25,152 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 19 treesize of output 7 [2022-07-20 06:08:25,155 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 19 treesize of output 7 [2022-07-20 06:08:25,172 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-20 06:08:25,172 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:25,172 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:25,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [247442529] [2022-07-20 06:08:25,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [247442529] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:25,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:25,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 06:08:25,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095687580] [2022-07-20 06:08:25,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:25,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:08:25,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:25,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:08:25,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:08:25,173 INFO L87 Difference]: Start difference. First operand 228 states and 277 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:25,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:25,393 INFO L93 Difference]: Finished difference Result 244 states and 293 transitions. [2022-07-20 06:08:25,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 06:08:25,393 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-20 06:08:25,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:25,394 INFO L225 Difference]: With dead ends: 244 [2022-07-20 06:08:25,394 INFO L226 Difference]: Without dead ends: 244 [2022-07-20 06:08:25,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 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-20 06:08:25,395 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 18 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:25,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 425 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:08:25,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-07-20 06:08:25,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 237. [2022-07-20 06:08:25,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 209 states have (on average 1.368421052631579) internal successors, (286), 236 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-20 06:08:25,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 286 transitions. [2022-07-20 06:08:25,398 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 286 transitions. Word has length 34 [2022-07-20 06:08:25,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:25,398 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 286 transitions. [2022-07-20 06:08:25,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:25,398 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 286 transitions. [2022-07-20 06:08:25,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-20 06:08:25,398 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:25,398 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:25,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Ended with exit code 0 [2022-07-20 06:08:25,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:08:25,605 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:08:25,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:25,605 INFO L85 PathProgramCache]: Analyzing trace with hash -677547858, now seen corresponding path program 1 times [2022-07-20 06:08:25,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:25,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [827651373] [2022-07-20 06:08:25,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:25,606 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:25,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:25,607 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:08:25,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2022-07-20 06:08:25,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:25,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-20 06:08:25,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:25,718 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-20 06:08:25,722 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-20 06:08:25,746 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 19 treesize of output 7 [2022-07-20 06:08:25,748 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 19 treesize of output 7 [2022-07-20 06:08:25,763 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-20 06:08:25,764 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:25,764 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:25,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [827651373] [2022-07-20 06:08:25,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [827651373] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:25,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:25,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 06:08:25,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036564265] [2022-07-20 06:08:25,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:25,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:08:25,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:25,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:08:25,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:08:25,766 INFO L87 Difference]: Start difference. First operand 237 states and 286 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:25,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:25,950 INFO L93 Difference]: Finished difference Result 248 states and 298 transitions. [2022-07-20 06:08:25,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 06:08:25,951 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-20 06:08:25,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:25,951 INFO L225 Difference]: With dead ends: 248 [2022-07-20 06:08:25,952 INFO L226 Difference]: Without dead ends: 248 [2022-07-20 06:08:25,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 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-20 06:08:25,952 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 8 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:25,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 490 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:08:25,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-07-20 06:08:25,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 240. [2022-07-20 06:08:25,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 212 states have (on average 1.3632075471698113) internal successors, (289), 239 states have internal predecessors, (289), 0 states have call successors, (0), 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-20 06:08:25,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 289 transitions. [2022-07-20 06:08:25,955 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 289 transitions. Word has length 34 [2022-07-20 06:08:25,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:25,955 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 289 transitions. [2022-07-20 06:08:25,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:25,955 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 289 transitions. [2022-07-20 06:08:25,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-20 06:08:25,955 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:25,955 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:25,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Ended with exit code 0 [2022-07-20 06:08:26,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:08:26,162 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:08:26,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:26,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1385753419, now seen corresponding path program 1 times [2022-07-20 06:08:26,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:26,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2069375434] [2022-07-20 06:08:26,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:26,163 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:26,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:26,164 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:08:26,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2022-07-20 06:08:26,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:26,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-20 06:08:26,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:26,273 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-20 06:08:26,291 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:08:26,291 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-20 06:08:26,308 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-20 06:08:26,316 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-20 06:08:26,365 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:08:26,366 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-20 06:08:26,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, 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-20 06:08:26,409 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:08:26,419 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-20 06:08:26,420 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 73 treesize of output 51 [2022-07-20 06:08:26,424 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 46 [2022-07-20 06:08:26,722 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:08:26,728 INFO L356 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2022-07-20 06:08:26,728 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 37 [2022-07-20 06:08:26,735 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 06:08:26,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2022-07-20 06:08:26,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:26,756 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:26,756 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:26,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2069375434] [2022-07-20 06:08:26,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2069375434] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:26,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:26,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-20 06:08:26,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188594589] [2022-07-20 06:08:26,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:26,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-20 06:08:26,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:26,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-20 06:08:26,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-07-20 06:08:26,757 INFO L87 Difference]: Start difference. First operand 240 states and 289 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:27,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:27,592 INFO L93 Difference]: Finished difference Result 294 states and 348 transitions. [2022-07-20 06:08:27,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-20 06:08:27,592 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-20 06:08:27,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:27,593 INFO L225 Difference]: With dead ends: 294 [2022-07-20 06:08:27,593 INFO L226 Difference]: Without dead ends: 294 [2022-07-20 06:08:27,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2022-07-20 06:08:27,594 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 129 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 207 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:27,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 963 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 410 Invalid, 0 Unknown, 207 Unchecked, 0.6s Time] [2022-07-20 06:08:27,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-07-20 06:08:27,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 240. [2022-07-20 06:08:27,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 212 states have (on average 1.3584905660377358) internal successors, (288), 239 states have internal predecessors, (288), 0 states have call successors, (0), 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-20 06:08:27,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 288 transitions. [2022-07-20 06:08:27,597 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 288 transitions. Word has length 34 [2022-07-20 06:08:27,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:27,598 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 288 transitions. [2022-07-20 06:08:27,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:27,598 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 288 transitions. [2022-07-20 06:08:27,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-20 06:08:27,598 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:27,598 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:27,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2022-07-20 06:08:27,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:08:27,806 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:08:27,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:27,806 INFO L85 PathProgramCache]: Analyzing trace with hash 2067103666, now seen corresponding path program 1 times [2022-07-20 06:08:27,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:27,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [641522850] [2022-07-20 06:08:27,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:27,806 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:27,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:27,808 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:08:27,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2022-07-20 06:08:27,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:27,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 06:08:27,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:27,933 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-20 06:08:27,934 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:27,934 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:27,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [641522850] [2022-07-20 06:08:27,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [641522850] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:27,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:27,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:08:27,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432020723] [2022-07-20 06:08:27,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:27,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:08:27,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:27,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:08:27,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:08:27,935 INFO L87 Difference]: Start difference. First operand 240 states and 288 transitions. Second operand has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:27,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:27,989 INFO L93 Difference]: Finished difference Result 253 states and 292 transitions. [2022-07-20 06:08:27,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:08:27,990 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-20 06:08:27,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:27,991 INFO L225 Difference]: With dead ends: 253 [2022-07-20 06:08:27,991 INFO L226 Difference]: Without dead ends: 253 [2022-07-20 06:08:27,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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-20 06:08:27,991 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 94 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:27,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 145 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:08:27,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-07-20 06:08:27,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 241. [2022-07-20 06:08:27,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 213 states have (on average 1.3568075117370892) internal successors, (289), 240 states have internal predecessors, (289), 0 states have call successors, (0), 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-20 06:08:27,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 289 transitions. [2022-07-20 06:08:27,994 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 289 transitions. Word has length 36 [2022-07-20 06:08:27,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:27,995 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 289 transitions. [2022-07-20 06:08:27,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:27,995 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 289 transitions. [2022-07-20 06:08:27,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-20 06:08:27,995 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:27,995 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-20 06:08:28,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2022-07-20 06:08:28,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:08:28,199 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:08:28,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:28,200 INFO L85 PathProgramCache]: Analyzing trace with hash -241358929, now seen corresponding path program 1 times [2022-07-20 06:08:28,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:28,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1790205011] [2022-07-20 06:08:28,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:28,200 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:28,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:28,201 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:08:28,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2022-07-20 06:08:28,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:28,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-20 06:08:28,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:28,330 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-20 06:08:28,352 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:08:28,353 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-20 06:08:28,364 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-20 06:08:28,370 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-20 06:08:28,430 INFO L356 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2022-07-20 06:08:28,431 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 69 treesize of output 47 [2022-07-20 06:08:28,435 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 42 [2022-07-20 06:08:28,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:08:28,525 INFO L356 Elim1Store]: treesize reduction 67, result has 11.8 percent of original size [2022-07-20 06:08:28,525 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 111 treesize of output 80 [2022-07-20 06:08:28,537 INFO L356 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-07-20 06:08:28,537 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 63 [2022-07-20 06:08:28,881 INFO L356 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-07-20 06:08:28,881 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 40 [2022-07-20 06:08:28,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2022-07-20 06:08:28,905 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-20 06:08:28,905 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:28,905 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:28,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1790205011] [2022-07-20 06:08:28,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1790205011] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:28,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:28,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-20 06:08:28,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988243720] [2022-07-20 06:08:28,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:28,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-20 06:08:28,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:28,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-20 06:08:28,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-07-20 06:08:28,906 INFO L87 Difference]: Start difference. First operand 241 states and 289 transitions. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 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-20 06:08:29,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:29,626 INFO L93 Difference]: Finished difference Result 265 states and 313 transitions. [2022-07-20 06:08:29,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-20 06:08:29,627 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 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-20 06:08:29,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:29,627 INFO L225 Difference]: With dead ends: 265 [2022-07-20 06:08:29,627 INFO L226 Difference]: Without dead ends: 265 [2022-07-20 06:08:29,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2022-07-20 06:08:29,628 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 126 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 115 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:29,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 692 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 314 Invalid, 0 Unknown, 115 Unchecked, 0.4s Time] [2022-07-20 06:08:29,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2022-07-20 06:08:29,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 241. [2022-07-20 06:08:29,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 213 states have (on average 1.352112676056338) internal successors, (288), 240 states have internal predecessors, (288), 0 states have call successors, (0), 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-20 06:08:29,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 288 transitions. [2022-07-20 06:08:29,631 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 288 transitions. Word has length 37 [2022-07-20 06:08:29,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:29,631 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 288 transitions. [2022-07-20 06:08:29,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 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-20 06:08:29,632 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 288 transitions. [2022-07-20 06:08:29,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-20 06:08:29,632 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:29,632 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] [2022-07-20 06:08:29,655 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Ended with exit code 0 [2022-07-20 06:08:29,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:08:29,840 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:08:29,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:29,840 INFO L85 PathProgramCache]: Analyzing trace with hash -155328105, now seen corresponding path program 1 times [2022-07-20 06:08:29,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:29,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1048940908] [2022-07-20 06:08:29,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:29,841 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:29,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:29,842 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:08:29,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2022-07-20 06:08:29,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:29,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-20 06:08:29,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:30,019 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-20 06:08:30,026 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-20 06:08:30,069 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-20 06:08:30,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:08:30,159 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-20 06:08:30,160 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 24 treesize of output 23 [2022-07-20 06:08:30,167 INFO L356 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-07-20 06:08:30,167 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 20 treesize of output 12 [2022-07-20 06:08:30,202 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-20 06:08:30,203 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:30,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1048940908] [2022-07-20 06:08:30,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1048940908] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:08:30,203 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:08:30,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2022-07-20 06:08:30,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656034383] [2022-07-20 06:08:30,203 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:08:30,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 06:08:30,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:30,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 06:08:30,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-20 06:08:30,204 INFO L87 Difference]: Start difference. First operand 241 states and 288 transitions. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 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-20 06:08:30,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:30,934 INFO L93 Difference]: Finished difference Result 344 states and 380 transitions. [2022-07-20 06:08:30,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-20 06:08:30,934 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 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 39 [2022-07-20 06:08:30,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:30,935 INFO L225 Difference]: With dead ends: 344 [2022-07-20 06:08:30,935 INFO L226 Difference]: Without dead ends: 344 [2022-07-20 06:08:30,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2022-07-20 06:08:30,936 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 436 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:30,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 884 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-20 06:08:30,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2022-07-20 06:08:30,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 265. [2022-07-20 06:08:30,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 237 states have (on average 1.3628691983122363) internal successors, (323), 264 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:30,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 323 transitions. [2022-07-20 06:08:30,950 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 323 transitions. Word has length 39 [2022-07-20 06:08:30,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:30,950 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 323 transitions. [2022-07-20 06:08:30,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 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-20 06:08:30,951 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 323 transitions. [2022-07-20 06:08:30,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-20 06:08:30,952 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:30,952 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-20 06:08:30,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2022-07-20 06:08:31,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:08:31,160 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:08:31,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:31,160 INFO L85 PathProgramCache]: Analyzing trace with hash 2002457928, now seen corresponding path program 1 times [2022-07-20 06:08:31,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:31,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [585292224] [2022-07-20 06:08:31,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:31,161 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:31,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:31,162 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:08:31,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2022-07-20 06:08:31,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:31,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-20 06:08:31,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:31,393 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 31 treesize of output 19 [2022-07-20 06:08:31,395 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 25 treesize of output 13 [2022-07-20 06:08:31,424 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-20 06:08:31,424 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:31,424 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:31,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [585292224] [2022-07-20 06:08:31,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [585292224] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:31,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:31,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 06:08:31,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097458996] [2022-07-20 06:08:31,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:31,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 06:08:31,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:31,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 06:08:31,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:08:31,425 INFO L87 Difference]: Start difference. First operand 265 states and 323 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 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-20 06:08:32,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:32,117 INFO L93 Difference]: Finished difference Result 352 states and 414 transitions. [2022-07-20 06:08:32,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 06:08:32,117 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 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-20 06:08:32,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:32,118 INFO L225 Difference]: With dead ends: 352 [2022-07-20 06:08:32,118 INFO L226 Difference]: Without dead ends: 352 [2022-07-20 06:08:32,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-07-20 06:08:32,118 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 155 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:32,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 855 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-20 06:08:32,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2022-07-20 06:08:32,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 276. [2022-07-20 06:08:32,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 248 states have (on average 1.3508064516129032) internal successors, (335), 275 states have internal predecessors, (335), 0 states have call successors, (0), 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-20 06:08:32,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 335 transitions. [2022-07-20 06:08:32,122 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 335 transitions. Word has length 39 [2022-07-20 06:08:32,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:32,122 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 335 transitions. [2022-07-20 06:08:32,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 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-20 06:08:32,122 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 335 transitions. [2022-07-20 06:08:32,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-20 06:08:32,122 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:32,122 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-20 06:08:32,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Forceful destruction successful, exit code 0 [2022-07-20 06:08:32,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:08:32,332 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:08:32,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:32,332 INFO L85 PathProgramCache]: Analyzing trace with hash -520202785, now seen corresponding path program 1 times [2022-07-20 06:08:32,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:32,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1682027645] [2022-07-20 06:08:32,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:32,333 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:32,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:32,334 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:08:32,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2022-07-20 06:08:32,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:32,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 06:08:32,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:32,539 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-20 06:08:32,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:08:32,593 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-20 06:08:32,593 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:32,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1682027645] [2022-07-20 06:08:32,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1682027645] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:08:32,594 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:08:32,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2022-07-20 06:08:32,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285830652] [2022-07-20 06:08:32,594 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:08:32,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:08:32,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:32,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:08:32,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:08:32,594 INFO L87 Difference]: Start difference. First operand 276 states and 335 transitions. Second operand has 6 states, 5 states have (on average 15.8) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 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-20 06:08:32,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:32,765 INFO L93 Difference]: Finished difference Result 284 states and 342 transitions. [2022-07-20 06:08:32,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 06:08:32,766 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.8) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 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-20 06:08:32,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:32,766 INFO L225 Difference]: With dead ends: 284 [2022-07-20 06:08:32,766 INFO L226 Difference]: Without dead ends: 260 [2022-07-20 06:08:32,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:08:32,767 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 50 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:32,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 383 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 50 Unchecked, 0.2s Time] [2022-07-20 06:08:32,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-07-20 06:08:32,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2022-07-20 06:08:32,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 232 states have (on average 1.3706896551724137) internal successors, (318), 259 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:32,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 318 transitions. [2022-07-20 06:08:32,770 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 318 transitions. Word has length 40 [2022-07-20 06:08:32,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:32,770 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 318 transitions. [2022-07-20 06:08:32,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.8) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 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-20 06:08:32,770 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 318 transitions. [2022-07-20 06:08:32,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-20 06:08:32,770 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:32,771 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-20 06:08:32,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Ended with exit code 0 [2022-07-20 06:08:32,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:08:32,978 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:08:32,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:32,978 INFO L85 PathProgramCache]: Analyzing trace with hash 518751734, now seen corresponding path program 1 times [2022-07-20 06:08:32,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:32,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1124749280] [2022-07-20 06:08:32,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:32,979 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:32,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:32,980 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:08:32,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2022-07-20 06:08:33,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:33,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 06:08:33,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:33,154 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 19 treesize of output 7 [2022-07-20 06:08:33,156 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 19 treesize of output 7 [2022-07-20 06:08:33,176 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-20 06:08:33,176 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:33,176 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:33,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1124749280] [2022-07-20 06:08:33,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1124749280] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:33,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:33,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 06:08:33,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151103453] [2022-07-20 06:08:33,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:33,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 06:08:33,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:33,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 06:08:33,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:08:33,178 INFO L87 Difference]: Start difference. First operand 260 states and 318 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-20 06:08:33,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:33,632 INFO L93 Difference]: Finished difference Result 266 states and 325 transitions. [2022-07-20 06:08:33,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 06:08:33,633 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-20 06:08:33,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:33,633 INFO L225 Difference]: With dead ends: 266 [2022-07-20 06:08:33,634 INFO L226 Difference]: Without dead ends: 266 [2022-07-20 06:08:33,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-07-20 06:08:33,634 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 18 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:33,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 628 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 06:08:33,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-07-20 06:08:33,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 255. [2022-07-20 06:08:33,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 228 states have (on average 1.3728070175438596) internal successors, (313), 254 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:33,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 313 transitions. [2022-07-20 06:08:33,637 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 313 transitions. Word has length 41 [2022-07-20 06:08:33,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:33,638 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 313 transitions. [2022-07-20 06:08:33,638 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-20 06:08:33,638 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 313 transitions. [2022-07-20 06:08:33,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-20 06:08:33,638 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:33,638 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-20 06:08:33,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Forceful destruction successful, exit code 0 [2022-07-20 06:08:33,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:08:33,847 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:08:33,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:33,847 INFO L85 PathProgramCache]: Analyzing trace with hash 357548557, now seen corresponding path program 1 times [2022-07-20 06:08:33,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:33,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [907643404] [2022-07-20 06:08:33,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:33,848 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:33,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:33,852 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:08:33,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2022-07-20 06:08:33,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:33,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-20 06:08:33,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:34,064 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 19 treesize of output 7 [2022-07-20 06:08:34,066 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 19 treesize of output 7 [2022-07-20 06:08:34,088 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-20 06:08:34,088 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:34,088 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:34,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [907643404] [2022-07-20 06:08:34,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [907643404] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:34,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:34,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 06:08:34,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741176984] [2022-07-20 06:08:34,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:34,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 06:08:34,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:34,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 06:08:34,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:08:34,089 INFO L87 Difference]: Start difference. First operand 255 states and 313 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-20 06:08:34,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:34,532 INFO L93 Difference]: Finished difference Result 304 states and 364 transitions. [2022-07-20 06:08:34,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 06:08:34,532 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-20 06:08:34,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:34,533 INFO L225 Difference]: With dead ends: 304 [2022-07-20 06:08:34,533 INFO L226 Difference]: Without dead ends: 304 [2022-07-20 06:08:34,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-07-20 06:08:34,534 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 55 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:34,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 713 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 06:08:34,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-07-20 06:08:34,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 286. [2022-07-20 06:08:34,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 259 states have (on average 1.3706563706563706) internal successors, (355), 285 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:34,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 355 transitions. [2022-07-20 06:08:34,538 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 355 transitions. Word has length 41 [2022-07-20 06:08:34,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:34,538 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 355 transitions. [2022-07-20 06:08:34,538 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-20 06:08:34,538 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 355 transitions. [2022-07-20 06:08:34,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-20 06:08:34,538 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:34,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:34,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (38)] Forceful destruction successful, exit code 0 [2022-07-20 06:08:34,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:08:34,746 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:08:34,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:34,747 INFO L85 PathProgramCache]: Analyzing trace with hash 819733368, now seen corresponding path program 1 times [2022-07-20 06:08:34,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:34,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [385121564] [2022-07-20 06:08:34,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:34,747 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:34,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:34,749 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:08:34,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2022-07-20 06:08:34,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:34,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 06:08:34,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:34,861 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-20 06:08:34,861 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:34,861 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:34,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [385121564] [2022-07-20 06:08:34,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [385121564] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:34,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:34,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:08:34,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738177202] [2022-07-20 06:08:34,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:34,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:08:34,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:34,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:08:34,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:08:34,864 INFO L87 Difference]: Start difference. First operand 286 states and 355 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-20 06:08:34,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:34,874 INFO L93 Difference]: Finished difference Result 452 states and 573 transitions. [2022-07-20 06:08:34,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:08:34,875 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-20 06:08:34,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:34,876 INFO L225 Difference]: With dead ends: 452 [2022-07-20 06:08:34,876 INFO L226 Difference]: Without dead ends: 452 [2022-07-20 06:08:34,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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-20 06:08:34,881 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 58 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 300 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-20 06:08:34,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 300 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:08:34,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2022-07-20 06:08:34,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 335. [2022-07-20 06:08:34,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 308 states have (on average 1.4285714285714286) internal successors, (440), 334 states have internal predecessors, (440), 0 states have call successors, (0), 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-20 06:08:34,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 440 transitions. [2022-07-20 06:08:34,888 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 440 transitions. Word has length 42 [2022-07-20 06:08:34,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:34,888 INFO L495 AbstractCegarLoop]: Abstraction has 335 states and 440 transitions. [2022-07-20 06:08:34,888 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-20 06:08:34,888 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 440 transitions. [2022-07-20 06:08:34,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-20 06:08:34,889 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:34,889 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] [2022-07-20 06:08:34,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (39)] Forceful destruction successful, exit code 0 [2022-07-20 06:08:35,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:08:35,096 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:08:35,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:35,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1784462763, now seen corresponding path program 1 times [2022-07-20 06:08:35,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:35,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [699374151] [2022-07-20 06:08:35,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:35,097 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:35,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:35,098 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:08:35,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2022-07-20 06:08:35,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:35,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-20 06:08:35,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:35,237 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 19 treesize of output 7 [2022-07-20 06:08:35,239 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 19 treesize of output 7 [2022-07-20 06:08:35,260 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-20 06:08:35,260 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:35,260 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:35,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [699374151] [2022-07-20 06:08:35,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [699374151] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:35,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:35,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 06:08:35,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663768804] [2022-07-20 06:08:35,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:35,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:08:35,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:35,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:08:35,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:08:35,261 INFO L87 Difference]: Start difference. First operand 335 states and 440 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:35,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:35,473 INFO L93 Difference]: Finished difference Result 259 states and 301 transitions. [2022-07-20 06:08:35,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 06:08:35,474 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-07-20 06:08:35,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:35,474 INFO L225 Difference]: With dead ends: 259 [2022-07-20 06:08:35,475 INFO L226 Difference]: Without dead ends: 259 [2022-07-20 06:08:35,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 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-20 06:08:35,475 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 58 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:35,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 497 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:08:35,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-07-20 06:08:35,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2022-07-20 06:08:35,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 233 states have (on average 1.2918454935622317) internal successors, (301), 258 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:35,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 301 transitions. [2022-07-20 06:08:35,478 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 301 transitions. Word has length 44 [2022-07-20 06:08:35,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:35,478 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 301 transitions. [2022-07-20 06:08:35,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:35,478 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 301 transitions. [2022-07-20 06:08:35,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-20 06:08:35,479 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:35,479 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] [2022-07-20 06:08:35,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (40)] Ended with exit code 0 [2022-07-20 06:08:35,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:08:35,686 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:08:35,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:35,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1661396287, now seen corresponding path program 1 times [2022-07-20 06:08:35,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:35,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1663579758] [2022-07-20 06:08:35,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:35,687 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:35,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:35,688 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:08:35,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (41)] Waiting until timeout for monitored process [2022-07-20 06:08:35,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:35,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-20 06:08:35,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:35,840 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-20 06:08:35,861 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-20 06:08:35,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 06:08:35,958 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:08:35,958 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-20 06:08:35,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:08:35,986 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 06:08:35,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:08:35,997 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 06:08:36,093 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:08:36,093 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-20 06:08:36,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:08:36,104 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 16 treesize of output 18 [2022-07-20 06:08:36,175 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:08:36,175 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 38 treesize of output 37 [2022-07-20 06:08:36,178 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 20 treesize of output 22 [2022-07-20 06:08:36,307 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-07-20 06:08:36,310 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-20 06:08:36,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:36,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:08:36,443 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1069 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1069) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|)))) (forall ((v_ArrVal_1068 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1068) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|)) (_ bv0 32)))) is different from false [2022-07-20 06:08:36,484 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1069 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1069) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|)))) (forall ((v_ArrVal_1068 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1068) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|)) (_ bv0 32)))) is different from false [2022-07-20 06:08:36,494 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1069 (Array (_ BitVec 32) (_ BitVec 32)))) (= (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_1069) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|)) (_ bv0 32))) (forall ((v_ArrVal_1068 (Array (_ BitVec 32) (_ BitVec 32)))) (= (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_1068) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|)) (_ bv0 32)))) is different from false [2022-07-20 06:08:36,513 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1069 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_#t~malloc10#1.base|)) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1069) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|)) (_ bv0 32))) (forall ((v_ArrVal_1068 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1065 (_ BitVec 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1065)) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1068) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|)) (_ bv0 32)))) is different from false [2022-07-20 06:08:36,548 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc10#1.base_7| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_7|))) (and (forall ((v_ArrVal_1068 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1065 (_ BitVec 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1065)) |v_ULTIMATE.start_main_#t~malloc10#1.base_7| v_ArrVal_1068) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|)) (_ bv0 32))) (forall ((v_ArrVal_1069 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| |v_ULTIMATE.start_main_#t~malloc10#1.base_7|)) |v_ULTIMATE.start_main_#t~malloc10#1.base_7| v_ArrVal_1069) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))))))) is different from false [2022-07-20 06:08:36,827 INFO L356 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2022-07-20 06:08:36,827 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 25 treesize of output 31 [2022-07-20 06:08:36,833 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-20 06:08:36,834 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 44 treesize of output 28 [2022-07-20 06:08:36,838 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 7 treesize of output 3 [2022-07-20 06:08:36,846 INFO L356 Elim1Store]: treesize reduction 41, result has 2.4 percent of original size [2022-07-20 06:08:36,847 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 1 [2022-07-20 06:08:36,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-20 06:08:36,872 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:36,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1663579758] [2022-07-20 06:08:36,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1663579758] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:08:36,872 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:08:36,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2022-07-20 06:08:36,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538824716] [2022-07-20 06:08:36,872 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:08:36,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-20 06:08:36,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:36,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-20 06:08:36,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=221, Unknown=6, NotChecked=170, Total=462 [2022-07-20 06:08:36,873 INFO L87 Difference]: Start difference. First operand 259 states and 301 transitions. Second operand has 22 states, 22 states have (on average 3.8636363636363638) internal successors, (85), 22 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:38,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:38,544 INFO L93 Difference]: Finished difference Result 557 states and 634 transitions. [2022-07-20 06:08:38,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-20 06:08:38,545 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.8636363636363638) internal successors, (85), 22 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-07-20 06:08:38,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:38,546 INFO L225 Difference]: With dead ends: 557 [2022-07-20 06:08:38,546 INFO L226 Difference]: Without dead ends: 557 [2022-07-20 06:08:38,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 72 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=239, Invalid=897, Unknown=6, NotChecked=340, Total=1482 [2022-07-20 06:08:38,547 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 659 mSDsluCounter, 1181 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 1317 SdHoareTripleChecker+Invalid, 2287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1452 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:38,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [659 Valid, 1317 Invalid, 2287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 783 Invalid, 0 Unknown, 1452 Unchecked, 1.0s Time] [2022-07-20 06:08:38,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2022-07-20 06:08:38,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 314. [2022-07-20 06:08:38,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 288 states have (on average 1.2534722222222223) internal successors, (361), 313 states have internal predecessors, (361), 0 states have call successors, (0), 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-20 06:08:38,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 361 transitions. [2022-07-20 06:08:38,555 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 361 transitions. Word has length 46 [2022-07-20 06:08:38,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:38,555 INFO L495 AbstractCegarLoop]: Abstraction has 314 states and 361 transitions. [2022-07-20 06:08:38,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.8636363636363638) internal successors, (85), 22 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:38,555 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 361 transitions. [2022-07-20 06:08:38,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-20 06:08:38,556 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:38,556 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] [2022-07-20 06:08:38,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (41)] Forceful destruction successful, exit code 0 [2022-07-20 06:08:38,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:08:38,764 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:08:38,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:38,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1192729599, now seen corresponding path program 1 times [2022-07-20 06:08:38,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:38,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1290742129] [2022-07-20 06:08:38,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:38,765 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:38,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:38,766 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:08:38,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (42)] Waiting until timeout for monitored process [2022-07-20 06:08:38,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:38,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-20 06:08:38,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:38,889 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-20 06:08:38,902 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:08:38,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 06:08:38,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-20 06:08:38,953 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:08:38,953 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 33 treesize of output 34 [2022-07-20 06:08:38,991 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:08:38,991 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 33 treesize of output 34 [2022-07-20 06:08:39,000 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 30 treesize of output 12 [2022-07-20 06:08:39,018 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-20 06:08:39,018 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:39,018 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:39,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1290742129] [2022-07-20 06:08:39,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1290742129] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:39,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:39,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 06:08:39,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817061397] [2022-07-20 06:08:39,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:39,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 06:08:39,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:39,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 06:08:39,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-20 06:08:39,020 INFO L87 Difference]: Start difference. First operand 314 states and 361 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 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-20 06:08:39,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:39,550 INFO L93 Difference]: Finished difference Result 315 states and 359 transitions. [2022-07-20 06:08:39,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 06:08:39,551 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 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-20 06:08:39,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:39,561 INFO L225 Difference]: With dead ends: 315 [2022-07-20 06:08:39,561 INFO L226 Difference]: Without dead ends: 315 [2022-07-20 06:08:39,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2022-07-20 06:08:39,562 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 238 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:39,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 492 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-20 06:08:39,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2022-07-20 06:08:39,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 280. [2022-07-20 06:08:39,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 254 states have (on average 1.2755905511811023) internal successors, (324), 279 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:39,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 324 transitions. [2022-07-20 06:08:39,565 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 324 transitions. Word has length 47 [2022-07-20 06:08:39,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:39,565 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 324 transitions. [2022-07-20 06:08:39,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 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-20 06:08:39,565 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 324 transitions. [2022-07-20 06:08:39,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-20 06:08:39,566 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:39,566 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] [2022-07-20 06:08:39,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (42)] Forceful destruction successful, exit code 0 [2022-07-20 06:08:39,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:08:39,767 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:08:39,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:39,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1591734132, now seen corresponding path program 1 times [2022-07-20 06:08:39,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:39,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1049509060] [2022-07-20 06:08:39,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:39,767 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:39,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:39,768 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:08:39,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (43)] Waiting until timeout for monitored process [2022-07-20 06:08:39,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:39,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-20 06:08:39,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:39,904 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-20 06:08:39,958 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-20 06:08:39,959 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 24 [2022-07-20 06:08:39,980 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-20 06:08:40,054 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:08:40,054 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-20 06:08:40,100 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:08:40,101 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-20 06:08:40,201 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 25 treesize of output 13 [2022-07-20 06:08:40,259 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:40,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:08:40,429 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:40,429 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 20 treesize of output 21 [2022-07-20 06:08:40,437 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:40,437 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 34 treesize of output 37 [2022-07-20 06:08:40,441 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 11 treesize of output 9 [2022-07-20 06:08:58,639 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:58,639 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:58,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1049509060] [2022-07-20 06:08:58,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1049509060] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:08:58,639 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:08:58,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2022-07-20 06:08:58,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416955179] [2022-07-20 06:08:58,640 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:08:58,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-20 06:08:58,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:58,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-20 06:08:58,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=370, Unknown=7, NotChecked=0, Total=462 [2022-07-20 06:08:58,641 INFO L87 Difference]: Start difference. First operand 280 states and 324 transitions. Second operand has 22 states, 21 states have (on average 4.523809523809524) internal successors, (95), 22 states have internal predecessors, (95), 0 states have call successors, (0), 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-20 06:09:01,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:09:01,546 INFO L93 Difference]: Finished difference Result 445 states and 496 transitions. [2022-07-20 06:09:01,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 06:09:01,546 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 4.523809523809524) internal successors, (95), 22 states have internal predecessors, (95), 0 states have call successors, (0), 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 48 [2022-07-20 06:09:01,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:09:01,547 INFO L225 Difference]: With dead ends: 445 [2022-07-20 06:09:01,547 INFO L226 Difference]: Without dead ends: 445 [2022-07-20 06:09:01,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 20.5s TimeCoverageRelationStatistics Valid=159, Invalid=535, Unknown=8, NotChecked=0, Total=702 [2022-07-20 06:09:01,548 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 767 mSDsluCounter, 1017 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 767 SdHoareTripleChecker+Valid, 1130 SdHoareTripleChecker+Invalid, 1480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 715 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-20 06:09:01,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [767 Valid, 1130 Invalid, 1480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 708 Invalid, 0 Unknown, 715 Unchecked, 0.7s Time] [2022-07-20 06:09:01,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2022-07-20 06:09:01,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 330. [2022-07-20 06:09:01,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 304 states have (on average 1.2730263157894737) internal successors, (387), 329 states have internal predecessors, (387), 0 states have call successors, (0), 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-20 06:09:01,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 387 transitions. [2022-07-20 06:09:01,551 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 387 transitions. Word has length 48 [2022-07-20 06:09:01,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:09:01,552 INFO L495 AbstractCegarLoop]: Abstraction has 330 states and 387 transitions. [2022-07-20 06:09:01,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 4.523809523809524) internal successors, (95), 22 states have internal predecessors, (95), 0 states have call successors, (0), 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-20 06:09:01,552 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 387 transitions. [2022-07-20 06:09:01,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-20 06:09:01,552 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:09:01,552 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] [2022-07-20 06:09:01,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (43)] Ended with exit code 0 [2022-07-20 06:09:01,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:09:01,765 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:09:01,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:09:01,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1591734133, now seen corresponding path program 1 times [2022-07-20 06:09:01,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:09:01,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1648144987] [2022-07-20 06:09:01,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:09:01,765 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:09:01,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:09:01,766 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:09:01,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (44)] Waiting until timeout for monitored process [2022-07-20 06:09:01,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:09:01,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-20 06:09:01,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:09:01,900 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-20 06:09:01,929 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-20 06:09:01,938 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:09:01,938 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-20 06:09:01,961 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-20 06:09:01,967 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-20 06:09:02,048 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:09:02,048 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 14 treesize of output 20 [2022-07-20 06:09:02,052 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 5 treesize of output 3 [2022-07-20 06:09:02,063 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:09:02,063 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-20 06:09:02,125 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:09:02,125 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 38 treesize of output 37 [2022-07-20 06:09:02,128 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 18 treesize of output 20 [2022-07-20 06:09:02,246 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-20 06:09:02,248 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 25 treesize of output 13 [2022-07-20 06:09:02,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:09:02,283 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:09:02,593 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1187 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1186) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1187) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)))) (forall ((v_ArrVal_1186 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1186) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0))))) is different from false [2022-07-20 06:09:02,671 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1186 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1186) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_1186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1187 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1186) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1187) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))))) is different from false [2022-07-20 06:09:02,718 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1186 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (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_1186) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_1186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1187 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1186) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1187) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)))))) is different from false [2022-07-20 06:09:02,741 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:09:02,742 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 37 treesize of output 30 [2022-07-20 06:09:02,754 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:09:02,755 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 44 treesize of output 43 [2022-07-20 06:09:02,760 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 15 treesize of output 11 [2022-07-20 06:09:02,808 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:09:02,808 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 37 treesize of output 38 [2022-07-20 06:09:02,815 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:09:02,816 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-07-20 06:09:02,818 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:09:02,820 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-07-20 06:09:02,823 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:09:02,825 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2022-07-20 06:09:02,967 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:09:02,967 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:09:02,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1648144987] [2022-07-20 06:09:02,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1648144987] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:09:02,967 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:09:02,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-07-20 06:09:02,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31877695] [2022-07-20 06:09:02,967 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:09:02,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-20 06:09:02,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:09:02,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-20 06:09:02,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=260, Unknown=3, NotChecked=102, Total=420 [2022-07-20 06:09:02,968 INFO L87 Difference]: Start difference. First operand 330 states and 387 transitions. Second operand has 21 states, 20 states have (on average 4.1) internal successors, (82), 21 states have internal predecessors, (82), 0 states have call successors, (0), 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-20 06:09:05,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:09:05,502 INFO L93 Difference]: Finished difference Result 452 states and 524 transitions. [2022-07-20 06:09:05,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-20 06:09:05,502 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 4.1) internal successors, (82), 21 states have internal predecessors, (82), 0 states have call successors, (0), 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 48 [2022-07-20 06:09:05,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:09:05,503 INFO L225 Difference]: With dead ends: 452 [2022-07-20 06:09:05,503 INFO L226 Difference]: Without dead ends: 452 [2022-07-20 06:09:05,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 73 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=122, Invalid=537, Unknown=3, NotChecked=150, Total=812 [2022-07-20 06:09:05,504 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 357 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 1004 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 1250 SdHoareTripleChecker+Invalid, 1715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 678 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-20 06:09:05,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 1250 Invalid, 1715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1004 Invalid, 0 Unknown, 678 Unchecked, 1.8s Time] [2022-07-20 06:09:05,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2022-07-20 06:09:05,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 354. [2022-07-20 06:09:05,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 328 states have (on average 1.2835365853658536) internal successors, (421), 353 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:09:05,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 421 transitions. [2022-07-20 06:09:05,508 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 421 transitions. Word has length 48 [2022-07-20 06:09:05,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:09:05,508 INFO L495 AbstractCegarLoop]: Abstraction has 354 states and 421 transitions. [2022-07-20 06:09:05,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 4.1) internal successors, (82), 21 states have internal predecessors, (82), 0 states have call successors, (0), 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-20 06:09:05,508 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 421 transitions. [2022-07-20 06:09:05,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-20 06:09:05,508 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:09:05,509 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] [2022-07-20 06:09:05,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (44)] Ended with exit code 0 [2022-07-20 06:09:05,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:09:05,716 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:09:05,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:09:05,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1355378246, now seen corresponding path program 1 times [2022-07-20 06:09:05,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:09:05,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1085252965] [2022-07-20 06:09:05,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:09:05,717 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:09:05,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:09:05,719 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:09:05,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (45)] Waiting until timeout for monitored process [2022-07-20 06:09:05,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:09:05,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 06:09:05,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:09:05,831 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-20 06:09:05,831 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:09:05,831 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:09:05,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1085252965] [2022-07-20 06:09:05,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1085252965] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:09:05,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:09:05,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:09:05,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899351001] [2022-07-20 06:09:05,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:09:05,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:09:05,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:09:05,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:09:05,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:09:05,832 INFO L87 Difference]: Start difference. First operand 354 states and 421 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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-20 06:09:05,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:09:05,908 INFO L93 Difference]: Finished difference Result 352 states and 417 transitions. [2022-07-20 06:09:05,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:09:05,908 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2022-07-20 06:09:05,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:09:05,909 INFO L225 Difference]: With dead ends: 352 [2022-07-20 06:09:05,909 INFO L226 Difference]: Without dead ends: 352 [2022-07-20 06:09:05,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 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-20 06:09:05,909 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 79 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:09:05,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 152 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:09:05,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2022-07-20 06:09:05,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2022-07-20 06:09:05,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 327 states have (on average 1.275229357798165) internal successors, (417), 351 states have internal predecessors, (417), 0 states have call successors, (0), 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-20 06:09:05,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 417 transitions. [2022-07-20 06:09:05,913 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 417 transitions. Word has length 51 [2022-07-20 06:09:05,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:09:05,913 INFO L495 AbstractCegarLoop]: Abstraction has 352 states and 417 transitions. [2022-07-20 06:09:05,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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-20 06:09:05,913 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 417 transitions. [2022-07-20 06:09:05,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-20 06:09:05,913 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:09:05,913 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] [2022-07-20 06:09:05,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (45)] Forceful destruction successful, exit code 0 [2022-07-20 06:09:06,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:09:06,121 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:09:06,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:09:06,121 INFO L85 PathProgramCache]: Analyzing trace with hash -98133092, now seen corresponding path program 1 times [2022-07-20 06:09:06,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:09:06,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1261023723] [2022-07-20 06:09:06,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:09:06,121 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:09:06,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:09:06,122 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:09:06,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (46)] Waiting until timeout for monitored process [2022-07-20 06:09:06,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:09:06,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-20 06:09:06,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:09:06,294 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-20 06:09:06,318 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-20 06:09:06,318 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 24 [2022-07-20 06:09:06,334 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-20 06:09:06,384 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:09:06,385 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 34 treesize of output 35 [2022-07-20 06:09:06,432 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:09:06,432 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 37 treesize of output 38 [2022-07-20 06:09:06,539 INFO L356 Elim1Store]: treesize reduction 48, result has 43.5 percent of original size [2022-07-20 06:09:06,539 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 53 [2022-07-20 06:09:06,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:09:06,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 31 [2022-07-20 06:09:06,772 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:09:06,772 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 58 treesize of output 50 [2022-07-20 06:09:06,874 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:09:06,875 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 55 treesize of output 50 [2022-07-20 06:09:07,098 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 22 [2022-07-20 06:09:07,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:09:07,168 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:09:07,259 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1274 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1274) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (_ bv1 1))) is different from false [2022-07-20 06:09:07,314 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1274 (Array (_ BitVec 32) (_ BitVec 32)))) (= (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_1274) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (_ bv1 1))) is different from false [2022-07-20 06:09:07,378 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1270 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc10#1.base_16| (_ BitVec 32)) (v_ArrVal_1274 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_16| v_ArrVal_1270) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| |v_ULTIMATE.start_main_#t~malloc10#1.base_16|)) |v_ULTIMATE.start_main_#t~malloc10#1.base_16| v_ArrVal_1274) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (_ bv1 1)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_16|))))) is different from false [2022-07-20 06:09:07,387 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1270 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc10#1.base_16| (_ BitVec 32)) (v_ArrVal_1274 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_16| v_ArrVal_1270) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_#t~malloc10#1.base_16|)) |v_ULTIMATE.start_main_#t~malloc10#1.base_16| v_ArrVal_1274) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (_ bv1 1)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_16|))))) is different from false [2022-07-20 06:09:07,427 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1270 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc10#1.base_16| (_ BitVec 32)) (v_ArrVal_1274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1269 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_16| v_ArrVal_1270) (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1269))) (store .cse0 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_#t~malloc10#1.base_16|))) |v_ULTIMATE.start_main_#t~malloc10#1.base_16| v_ArrVal_1274) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (_ bv1 1)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_16|))))) is different from false [2022-07-20 06:09:07,640 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:09:07,640 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 95 treesize of output 66 [2022-07-20 06:09:07,642 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:09:07,649 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 318 treesize of output 264 [2022-07-20 06:09:07,653 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 206 treesize of output 190 [2022-07-20 06:09:07,657 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 190 treesize of output 158 [2022-07-20 06:09:13,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-20 06:09:13,367 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:09:13,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1261023723] [2022-07-20 06:09:13,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1261023723] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:09:13,368 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:09:13,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 31 [2022-07-20 06:09:13,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18857721] [2022-07-20 06:09:13,368 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:09:13,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-20 06:09:13,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:09:13,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-20 06:09:13,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=575, Unknown=14, NotChecked=270, Total=992 [2022-07-20 06:09:13,369 INFO L87 Difference]: Start difference. First operand 352 states and 417 transitions. Second operand has 32 states, 31 states have (on average 3.2580645161290325) internal successors, (101), 32 states have internal predecessors, (101), 0 states have call successors, (0), 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-20 06:09:15,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:09:15,461 INFO L93 Difference]: Finished difference Result 634 states and 722 transitions. [2022-07-20 06:09:15,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-20 06:09:15,461 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.2580645161290325) internal successors, (101), 32 states have internal predecessors, (101), 0 states have call successors, (0), 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 51 [2022-07-20 06:09:15,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:09:15,463 INFO L225 Difference]: With dead ends: 634 [2022-07-20 06:09:15,463 INFO L226 Difference]: Without dead ends: 634 [2022-07-20 06:09:15,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 69 SyntacticMatches, 8 SemanticMatches, 39 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=249, Invalid=1017, Unknown=14, NotChecked=360, Total=1640 [2022-07-20 06:09:15,463 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 647 mSDsluCounter, 2066 mSDsCounter, 0 mSdLazyCounter, 1225 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 647 SdHoareTripleChecker+Valid, 2210 SdHoareTripleChecker+Invalid, 2984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1720 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-20 06:09:15,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [647 Valid, 2210 Invalid, 2984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1225 Invalid, 0 Unknown, 1720 Unchecked, 1.5s Time] [2022-07-20 06:09:15,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2022-07-20 06:09:15,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 350. [2022-07-20 06:09:15,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 327 states have (on average 1.2477064220183487) internal successors, (408), 349 states have internal predecessors, (408), 0 states have call successors, (0), 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-20 06:09:15,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 408 transitions. [2022-07-20 06:09:15,467 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 408 transitions. Word has length 51 [2022-07-20 06:09:15,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:09:15,467 INFO L495 AbstractCegarLoop]: Abstraction has 350 states and 408 transitions. [2022-07-20 06:09:15,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.2580645161290325) internal successors, (101), 32 states have internal predecessors, (101), 0 states have call successors, (0), 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-20 06:09:15,467 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 408 transitions. [2022-07-20 06:09:15,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-20 06:09:15,468 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:09:15,468 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] [2022-07-20 06:09:15,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (46)] Forceful destruction successful, exit code 0 [2022-07-20 06:09:15,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:09:15,676 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-20 06:09:15,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:09:15,676 INFO L85 PathProgramCache]: Analyzing trace with hash -98133091, now seen corresponding path program 1 times [2022-07-20 06:09:15,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:09:15,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1672422793] [2022-07-20 06:09:15,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:09:15,676 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:09:15,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:09:15,679 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:09:15,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (47)] Waiting until timeout for monitored process [2022-07-20 06:09:15,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:09:15,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-20 06:09:15,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:09:15,846 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-20 06:09:15,861 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-20 06:09:15,876 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-20 06:09:15,876 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 24 [2022-07-20 06:09:15,901 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-20 06:09:15,909 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-20 06:09:15,973 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:09:15,973 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 57 treesize of output 54 [2022-07-20 06:09:15,976 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-20 06:09:16,040 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:09:16,040 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 60 treesize of output 57 [2022-07-20 06:09:16,043 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-20 06:09:16,177 INFO L356 Elim1Store]: treesize reduction 23, result has 47.7 percent of original size [2022-07-20 06:09:16,177 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 18 treesize of output 30 [2022-07-20 06:09:16,197 INFO L356 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2022-07-20 06:09:16,198 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 26 [2022-07-20 06:09:16,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:09:16,258 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-20 06:09:16,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:09:16,264 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-07-20 06:09:16,409 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:09:16,409 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 57 treesize of output 49 [2022-07-20 06:09:16,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:09:16,426 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 16 treesize of output 18 [2022-07-20 06:09:16,513 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:09:16,513 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 64 treesize of output 57 [2022-07-20 06:09:16,523 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-07-20 06:09:16,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 21 [2022-07-20 06:09:16,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2022-07-20 06:09:16,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:09:16,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:09:17,144 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1341 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1342) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1341) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0))))) (forall ((v_ArrVal_1342 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1342) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|)))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd .cse1 (_ bv8 32)))))) is different from false [2022-07-20 06:09:17,213 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1341 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1342) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1341) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0))))) (forall ((v_ArrVal_1342 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1342) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|)))) (bvule (bvadd .cse1 (_ bv4 32)) (bvadd .cse1 (_ bv8 32)))))) is different from false [2022-07-20 06:09:17,236 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1341 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|)) (.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1342) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1341) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))))) (forall ((v_ArrVal_1342 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (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_1342) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|)))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))) is different from false [2022-07-20 06:09:17,292 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1337 (_ BitVec 32)) (v_ArrVal_1341 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1337)) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1342) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) (_ bv8 32)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_#t~malloc10#1.base|)) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1341) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0))))) (forall ((v_ArrVal_1342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1337 (_ BitVec 32))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1337)) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1342) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|)))) (bvule (bvadd .cse1 (_ bv4 32)) (bvadd .cse1 (_ bv8 32)))))) is different from false [2022-07-20 06:09:17,349 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1334 (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc10#1.base_19| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_19|))) (and (forall ((v_ArrVal_1342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1337 (_ BitVec 32))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1337)) |v_ULTIMATE.start_main_#t~malloc10#1.base_19| v_ArrVal_1342) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|)))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_1342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1337 (_ BitVec 32)) (v_ArrVal_1341 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1337)) |v_ULTIMATE.start_main_#t~malloc10#1.base_19| v_ArrVal_1342) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv8 32)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc10#1.base_19| v_ArrVal_1334) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| |v_ULTIMATE.start_main_#t~malloc10#1.base_19|)) |v_ULTIMATE.start_main_#t~malloc10#1.base_19| v_ArrVal_1341) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))))))) is different from false [2022-07-20 06:09:17,391 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc10#1.base_19| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_19|))) (and (forall ((v_ArrVal_1334 (_ BitVec 32)) (v_ArrVal_1342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1337 (_ BitVec 32)) (v_ArrVal_1341 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_1337)) |v_ULTIMATE.start_main_#t~malloc10#1.base_19| v_ArrVal_1342) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc10#1.base_19| v_ArrVal_1334) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_#t~malloc10#1.base_19|)) |v_ULTIMATE.start_main_#t~malloc10#1.base_19| v_ArrVal_1341) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0))))) (forall ((v_ArrVal_1342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1337 (_ BitVec 32))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_1337)) |v_ULTIMATE.start_main_#t~malloc10#1.base_19| v_ArrVal_1342) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|)))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1))))))) is different from false [2022-07-20 06:09:17,562 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc10#1.base_19| (_ BitVec 32)) (v_ArrVal_1332 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1333 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_19|))) (and (forall ((v_ArrVal_1342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1337 (_ BitVec 32))) (let ((.cse0 (select (select (store (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1332))) (store .cse1 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_1337))) |v_ULTIMATE.start_main_#t~malloc10#1.base_19| v_ArrVal_1342) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|)))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_1334 (_ BitVec 32)) (v_ArrVal_1342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1337 (_ BitVec 32)) (v_ArrVal_1341 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (bvule (bvadd (_ bv8 32) (select (select (store (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1332))) (store .cse2 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_1337))) |v_ULTIMATE.start_main_#t~malloc10#1.base_19| v_ArrVal_1342) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc10#1.base_19| v_ArrVal_1334) (select (select (store (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1333))) (store .cse4 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_#t~malloc10#1.base_19|))) |v_ULTIMATE.start_main_#t~malloc10#1.base_19| v_ArrVal_1341) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)))))))) is different from false [2022-07-20 06:09:28,034 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:09:28,034 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 181 treesize of output 152 [2022-07-20 06:09:28,155 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:09:28,155 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 141 treesize of output 112 [2022-07-20 06:09:28,214 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 190 treesize of output 160 [2022-07-20 06:09:28,243 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:09:28,273 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 174 treesize of output 144 [2022-07-20 06:09:28,339 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 102 treesize of output 86 [2022-07-20 06:09:28,393 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 124 treesize of output 100 [2022-07-20 06:09:28,482 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 70 treesize of output 62 [2022-07-20 06:09:28,952 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:09:28,952 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 184 treesize of output 175 [2022-07-20 06:09:29,067 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:09:29,068 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 164 treesize of output 115 [2022-07-20 06:09:29,095 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:09:29,096 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:09:29,125 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 144 treesize of output 96 [2022-07-20 06:09:29,155 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:09:29,155 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:09:29,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 56 treesize of output 38 [2022-07-20 06:09:29,244 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 18 treesize of output 14 [2022-07-20 06:09:38,126 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:09:38,127 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 187 treesize of output 178 [2022-07-20 06:09:38,256 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:09:38,257 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 167 treesize of output 118 [2022-07-20 06:09:38,351 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:09:38,386 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 1202 treesize of output 1040 [2022-07-20 06:09:38,487 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:09:38,522 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 2688 treesize of output 2538 [2022-07-20 06:09:38,575 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:09:38,821 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:09:38,821 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 12742 treesize of output 12038 [2022-07-20 06:09:39,176 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 10670 treesize of output 8626 [2022-07-20 06:09:39,265 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 8614 treesize of output 8230 [2022-07-20 06:09:39,355 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 8242 treesize of output 7102 [2022-07-20 06:09:39,445 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 7094 treesize of output 6198