./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/dll-queue-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a31fd051 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/dll-queue-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 c858394bc83ab2c402eb20052f936c0a6aa98b2b6b6c704be79c039778bcff97 --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 13:14:02,463 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 13:14:02,465 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 13:14:02,506 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 13:14:02,507 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 13:14:02,511 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 13:14:02,513 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 13:14:02,515 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 13:14:02,517 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 13:14:02,523 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 13:14:02,524 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 13:14:02,526 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 13:14:02,526 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 13:14:02,528 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 13:14:02,530 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 13:14:02,531 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 13:14:02,532 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 13:14:02,533 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 13:14:02,535 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 13:14:02,540 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 13:14:02,541 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 13:14:02,542 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 13:14:02,543 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 13:14:02,544 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 13:14:02,548 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 13:14:02,548 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 13:14:02,549 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 13:14:02,550 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 13:14:02,551 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 13:14:02,551 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 13:14:02,552 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 13:14:02,552 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 13:14:02,554 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 13:14:02,554 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 13:14:02,555 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 13:14:02,555 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 13:14:02,556 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 13:14:02,556 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 13:14:02,556 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 13:14:02,557 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 13:14:02,558 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 13:14:02,559 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 13:14:02,587 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 13:14:02,588 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 13:14:02,588 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 13:14:02,588 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 13:14:02,589 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 13:14:02,589 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 13:14:02,590 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 13:14:02,590 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 13:14:02,590 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 13:14:02,590 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 13:14:02,591 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 13:14:02,591 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 13:14:02,591 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 13:14:02,592 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 13:14:02,592 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 13:14:02,592 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 13:14:02,592 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 13:14:02,592 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 13:14:02,592 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 13:14:02,593 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 13:14:02,593 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 13:14:02,593 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 13:14:02,593 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 13:14:02,593 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 13:14:02,594 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 13:14:02,594 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 13:14:02,594 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 13:14:02,594 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 13:14:02,594 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 13:14:02,594 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 13:14:02,595 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 13:14:02,595 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 13:14:02,595 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 13:14:02,595 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 13:14:02,595 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> c858394bc83ab2c402eb20052f936c0a6aa98b2b6b6c704be79c039778bcff97 [2023-02-15 13:14:02,825 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 13:14:02,849 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 13:14:02,851 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 13:14:02,852 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 13:14:02,852 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 13:14:02,853 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-queue-1.i [2023-02-15 13:14:03,947 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 13:14:04,151 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 13:14:04,152 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-1.i [2023-02-15 13:14:04,167 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55e40a69f/a36e14e4be7246b883877b667a5bd326/FLAGcfd12b3aa [2023-02-15 13:14:04,180 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55e40a69f/a36e14e4be7246b883877b667a5bd326 [2023-02-15 13:14:04,183 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 13:14:04,184 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 13:14:04,185 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 13:14:04,185 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 13:14:04,188 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 13:14:04,189 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:14:04" (1/1) ... [2023-02-15 13:14:04,189 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32278855 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:14:04, skipping insertion in model container [2023-02-15 13:14:04,190 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:14:04" (1/1) ... [2023-02-15 13:14:04,195 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 13:14:04,232 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 13:14:04,453 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-1.i[22460,22473] [2023-02-15 13:14:04,459 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-1.i[22531,22544] [2023-02-15 13:14:04,460 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-1.i[22605,22618] [2023-02-15 13:14:04,461 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-1.i[22697,22710] [2023-02-15 13:14:04,461 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-1.i[22774,22787] [2023-02-15 13:14:04,462 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-1.i[22869,22882] [2023-02-15 13:14:04,462 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-1.i[22946,22959] [2023-02-15 13:14:04,463 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-1.i[23029,23042] [2023-02-15 13:14:04,463 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-1.i[23124,23137] [2023-02-15 13:14:04,464 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-1.i[23201,23214] [2023-02-15 13:14:04,464 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-1.i[23284,23297] [2023-02-15 13:14:04,465 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-1.i[23373,23386] [2023-02-15 13:14:04,466 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-1.i[23459,23472] [2023-02-15 13:14:04,467 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-1.i[23604,23617] [2023-02-15 13:14:04,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:14:04,480 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 13:14:04,511 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-1.i[22460,22473] [2023-02-15 13:14:04,512 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-1.i[22531,22544] [2023-02-15 13:14:04,513 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-1.i[22605,22618] [2023-02-15 13:14:04,513 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-1.i[22697,22710] [2023-02-15 13:14:04,514 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-1.i[22774,22787] [2023-02-15 13:14:04,515 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-1.i[22869,22882] [2023-02-15 13:14:04,516 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-1.i[22946,22959] [2023-02-15 13:14:04,516 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-1.i[23029,23042] [2023-02-15 13:14:04,517 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-1.i[23124,23137] [2023-02-15 13:14:04,518 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-1.i[23201,23214] [2023-02-15 13:14:04,518 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-1.i[23284,23297] [2023-02-15 13:14:04,519 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-1.i[23373,23386] [2023-02-15 13:14:04,520 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-1.i[23459,23472] [2023-02-15 13:14:04,521 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-1.i[23604,23617] [2023-02-15 13:14:04,523 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:14:04,545 INFO L208 MainTranslator]: Completed translation [2023-02-15 13:14:04,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:14:04 WrapperNode [2023-02-15 13:14:04,546 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 13:14:04,547 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 13:14:04,547 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 13:14:04,547 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 13:14:04,551 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:14:04" (1/1) ... [2023-02-15 13:14:04,563 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:14:04" (1/1) ... [2023-02-15 13:14:04,587 INFO L138 Inliner]: procedures = 119, calls = 38, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 226 [2023-02-15 13:14:04,588 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 13:14:04,589 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 13:14:04,589 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 13:14:04,589 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 13:14:04,597 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:14:04" (1/1) ... [2023-02-15 13:14:04,599 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:14:04" (1/1) ... [2023-02-15 13:14:04,604 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:14:04" (1/1) ... [2023-02-15 13:14:04,604 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:14:04" (1/1) ... [2023-02-15 13:14:04,612 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:14:04" (1/1) ... [2023-02-15 13:14:04,617 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:14:04" (1/1) ... [2023-02-15 13:14:04,619 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:14:04" (1/1) ... [2023-02-15 13:14:04,620 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:14:04" (1/1) ... [2023-02-15 13:14:04,623 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 13:14:04,624 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 13:14:04,624 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 13:14:04,624 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 13:14:04,625 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:14:04" (1/1) ... [2023-02-15 13:14:04,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 13:14:04,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:14:04,654 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) [2023-02-15 13:14:04,667 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 [2023-02-15 13:14:04,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 13:14:04,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 13:14:04,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 13:14:04,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 13:14:04,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 13:14:04,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 13:14:04,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 13:14:04,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 13:14:04,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 13:14:04,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 13:14:04,836 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 13:14:04,838 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 13:14:05,208 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 13:14:05,215 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 13:14:05,215 INFO L300 CfgBuilder]: Removed 31 assume(true) statements. [2023-02-15 13:14:05,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:14:05 BoogieIcfgContainer [2023-02-15 13:14:05,217 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 13:14:05,219 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 13:14:05,219 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 13:14:05,227 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 13:14:05,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 01:14:04" (1/3) ... [2023-02-15 13:14:05,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b633325 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:14:05, skipping insertion in model container [2023-02-15 13:14:05,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:14:04" (2/3) ... [2023-02-15 13:14:05,230 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b633325 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:14:05, skipping insertion in model container [2023-02-15 13:14:05,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:14:05" (3/3) ... [2023-02-15 13:14:05,231 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-queue-1.i [2023-02-15 13:14:05,247 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 13:14:05,249 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 76 error locations. [2023-02-15 13:14:05,303 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 13:14:05,309 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=PETRI_NET, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@34e61f25, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 13:14:05,310 INFO L358 AbstractCegarLoop]: Starting to check reachability of 76 error locations. [2023-02-15 13:14:05,315 INFO L276 IsEmpty]: Start isEmpty. Operand has 181 states, 104 states have (on average 2.269230769230769) internal successors, (236), 180 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:05,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-15 13:14:05,320 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:14:05,321 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-15 13:14:05,322 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 13:14:05,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:14:05,329 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2023-02-15 13:14:05,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:14:05,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661337605] [2023-02-15 13:14:05,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:14:05,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:14:05,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:14:05,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:05,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:14:05,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661337605] [2023-02-15 13:14:05,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661337605] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:14:05,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:14:05,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:14:05,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772772589] [2023-02-15 13:14:05,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:14:05,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:14:05,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:14:05,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:14:05,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:14:05,591 INFO L87 Difference]: Start difference. First operand has 181 states, 104 states have (on average 2.269230769230769) internal successors, (236), 180 states have internal predecessors, (236), 0 states have call successors, (0), 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) [2023-02-15 13:14:05,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:14:05,764 INFO L93 Difference]: Finished difference Result 178 states and 188 transitions. [2023-02-15 13:14:05,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:14:05,766 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 [2023-02-15 13:14:05,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:14:05,775 INFO L225 Difference]: With dead ends: 178 [2023-02-15 13:14:05,775 INFO L226 Difference]: Without dead ends: 174 [2023-02-15 13:14:05,776 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 [2023-02-15 13:14:05,779 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 169 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:14:05,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 112 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:14:05,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2023-02-15 13:14:05,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 170. [2023-02-15 13:14:05,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 105 states have (on average 1.7333333333333334) internal successors, (182), 169 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:05,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 182 transitions. [2023-02-15 13:14:05,812 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 182 transitions. Word has length 3 [2023-02-15 13:14:05,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:14:05,812 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 182 transitions. [2023-02-15 13:14:05,813 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) [2023-02-15 13:14:05,813 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 182 transitions. [2023-02-15 13:14:05,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-15 13:14:05,813 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:14:05,813 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-15 13:14:05,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 13:14:05,814 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 13:14:05,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:14:05,814 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2023-02-15 13:14:05,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:14:05,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707585986] [2023-02-15 13:14:05,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:14:05,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:14:05,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:14:05,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:05,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:14:05,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707585986] [2023-02-15 13:14:05,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707585986] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:14:05,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:14:05,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:14:05,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806112423] [2023-02-15 13:14:05,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:14:05,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:14:05,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:14:05,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:14:05,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:14:05,926 INFO L87 Difference]: Start difference. First operand 170 states and 182 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) [2023-02-15 13:14:06,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:14:06,037 INFO L93 Difference]: Finished difference Result 163 states and 173 transitions. [2023-02-15 13:14:06,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:14:06,038 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 [2023-02-15 13:14:06,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:14:06,043 INFO L225 Difference]: With dead ends: 163 [2023-02-15 13:14:06,043 INFO L226 Difference]: Without dead ends: 163 [2023-02-15 13:14:06,043 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 [2023-02-15 13:14:06,045 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 155 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:14:06,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 115 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:14:06,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2023-02-15 13:14:06,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 159. [2023-02-15 13:14:06,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 105 states have (on average 1.619047619047619) internal successors, (170), 158 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:06,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 170 transitions. [2023-02-15 13:14:06,071 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 170 transitions. Word has length 3 [2023-02-15 13:14:06,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:14:06,074 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 170 transitions. [2023-02-15 13:14:06,074 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) [2023-02-15 13:14:06,074 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 170 transitions. [2023-02-15 13:14:06,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-15 13:14:06,075 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:14:06,075 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:14:06,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 13:14:06,075 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 13:14:06,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:14:06,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112042, now seen corresponding path program 1 times [2023-02-15 13:14:06,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:14:06,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668454576] [2023-02-15 13:14:06,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:14:06,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:14:06,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:14:06,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:06,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:14:06,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668454576] [2023-02-15 13:14:06,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668454576] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:14:06,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:14:06,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 13:14:06,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713802324] [2023-02-15 13:14:06,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:14:06,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:14:06,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:14:06,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:14:06,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:14:06,238 INFO L87 Difference]: Start difference. First operand 159 states and 170 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:06,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:14:06,413 INFO L93 Difference]: Finished difference Result 168 states and 178 transitions. [2023-02-15 13:14:06,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 13:14:06,414 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-15 13:14:06,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:14:06,415 INFO L225 Difference]: With dead ends: 168 [2023-02-15 13:14:06,415 INFO L226 Difference]: Without dead ends: 168 [2023-02-15 13:14:06,415 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 [2023-02-15 13:14:06,416 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 272 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:14:06,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 118 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:14:06,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2023-02-15 13:14:06,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 160. [2023-02-15 13:14:06,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 112 states have (on average 1.5625) internal successors, (175), 159 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:06,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 175 transitions. [2023-02-15 13:14:06,423 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 175 transitions. Word has length 9 [2023-02-15 13:14:06,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:14:06,423 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 175 transitions. [2023-02-15 13:14:06,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:06,423 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 175 transitions. [2023-02-15 13:14:06,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-15 13:14:06,424 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:14:06,424 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:14:06,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 13:14:06,424 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 13:14:06,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:14:06,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112043, now seen corresponding path program 1 times [2023-02-15 13:14:06,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:14:06,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667032676] [2023-02-15 13:14:06,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:14:06,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:14:06,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:14:06,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:06,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:14:06,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667032676] [2023-02-15 13:14:06,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667032676] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:14:06,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:14:06,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 13:14:06,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847233537] [2023-02-15 13:14:06,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:14:06,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 13:14:06,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:14:06,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 13:14:06,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:14:06,709 INFO L87 Difference]: Start difference. First operand 160 states and 175 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:06,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:14:06,959 INFO L93 Difference]: Finished difference Result 256 states and 272 transitions. [2023-02-15 13:14:06,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 13:14:06,959 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-15 13:14:06,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:14:06,960 INFO L225 Difference]: With dead ends: 256 [2023-02-15 13:14:06,960 INFO L226 Difference]: Without dead ends: 256 [2023-02-15 13:14:06,961 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 [2023-02-15 13:14:06,961 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 334 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:14:06,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 244 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:14:06,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2023-02-15 13:14:06,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 168. [2023-02-15 13:14:06,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 120 states have (on average 1.5416666666666667) internal successors, (185), 167 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:06,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 185 transitions. [2023-02-15 13:14:06,976 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 185 transitions. Word has length 9 [2023-02-15 13:14:06,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:14:06,977 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 185 transitions. [2023-02-15 13:14:06,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:06,977 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 185 transitions. [2023-02-15 13:14:06,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-15 13:14:06,978 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:14:06,978 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:14:06,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 13:14:06,978 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 13:14:06,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:14:06,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1115899309, now seen corresponding path program 1 times [2023-02-15 13:14:06,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:14:06,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972853328] [2023-02-15 13:14:06,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:14:06,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:14:06,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:14:07,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:07,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:14:07,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972853328] [2023-02-15 13:14:07,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972853328] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:14:07,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:14:07,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 13:14:07,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373912088] [2023-02-15 13:14:07,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:14:07,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:14:07,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:14:07,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:14:07,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:14:07,049 INFO L87 Difference]: Start difference. First operand 168 states and 185 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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) [2023-02-15 13:14:07,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:14:07,081 INFO L93 Difference]: Finished difference Result 158 states and 174 transitions. [2023-02-15 13:14:07,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:14:07,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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 [2023-02-15 13:14:07,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:14:07,082 INFO L225 Difference]: With dead ends: 158 [2023-02-15 13:14:07,082 INFO L226 Difference]: Without dead ends: 158 [2023-02-15 13:14:07,083 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 [2023-02-15 13:14:07,085 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 131 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:14:07,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 141 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:14:07,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2023-02-15 13:14:07,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2023-02-15 13:14:07,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 115 states have (on average 1.5130434782608695) internal successors, (174), 157 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:07,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 174 transitions. [2023-02-15 13:14:07,103 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 174 transitions. Word has length 10 [2023-02-15 13:14:07,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:14:07,103 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 174 transitions. [2023-02-15 13:14:07,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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) [2023-02-15 13:14:07,103 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 174 transitions. [2023-02-15 13:14:07,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 13:14:07,104 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:14:07,104 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:14:07,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 13:14:07,105 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 13:14:07,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:14:07,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413642, now seen corresponding path program 1 times [2023-02-15 13:14:07,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:14:07,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729431232] [2023-02-15 13:14:07,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:14:07,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:14:07,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:14:07,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:07,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:14:07,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729431232] [2023-02-15 13:14:07,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729431232] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:14:07,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:14:07,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:14:07,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864543470] [2023-02-15 13:14:07,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:14:07,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 13:14:07,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:14:07,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 13:14:07,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:14:07,339 INFO L87 Difference]: Start difference. First operand 158 states and 174 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:07,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:14:07,496 INFO L93 Difference]: Finished difference Result 157 states and 172 transitions. [2023-02-15 13:14:07,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:14:07,496 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-02-15 13:14:07,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:14:07,497 INFO L225 Difference]: With dead ends: 157 [2023-02-15 13:14:07,497 INFO L226 Difference]: Without dead ends: 157 [2023-02-15 13:14:07,498 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 [2023-02-15 13:14:07,501 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 7 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:14:07,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 424 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:14:07,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2023-02-15 13:14:07,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2023-02-15 13:14:07,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 115 states have (on average 1.4956521739130435) internal successors, (172), 156 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:07,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 172 transitions. [2023-02-15 13:14:07,510 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 172 transitions. Word has length 12 [2023-02-15 13:14:07,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:14:07,510 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 172 transitions. [2023-02-15 13:14:07,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:07,510 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 172 transitions. [2023-02-15 13:14:07,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 13:14:07,511 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:14:07,511 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:14:07,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-15 13:14:07,512 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 13:14:07,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:14:07,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413643, now seen corresponding path program 1 times [2023-02-15 13:14:07,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:14:07,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062582032] [2023-02-15 13:14:07,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:14:07,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:14:07,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:14:07,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:07,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:14:07,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062582032] [2023-02-15 13:14:07,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062582032] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:14:07,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:14:07,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:14:07,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429598537] [2023-02-15 13:14:07,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:14:07,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 13:14:07,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:14:07,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 13:14:07,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:14:07,597 INFO L87 Difference]: Start difference. First operand 157 states and 172 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:07,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:14:07,701 INFO L93 Difference]: Finished difference Result 156 states and 170 transitions. [2023-02-15 13:14:07,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 13:14:07,702 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-02-15 13:14:07,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:14:07,703 INFO L225 Difference]: With dead ends: 156 [2023-02-15 13:14:07,703 INFO L226 Difference]: Without dead ends: 156 [2023-02-15 13:14:07,704 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 [2023-02-15 13:14:07,705 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 8 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:14:07,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 422 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:14:07,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-02-15 13:14:07,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2023-02-15 13:14:07,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 115 states have (on average 1.4782608695652173) internal successors, (170), 155 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:07,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 170 transitions. [2023-02-15 13:14:07,709 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 170 transitions. Word has length 12 [2023-02-15 13:14:07,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:14:07,710 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 170 transitions. [2023-02-15 13:14:07,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:07,710 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 170 transitions. [2023-02-15 13:14:07,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 13:14:07,711 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:14:07,711 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:14:07,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-15 13:14:07,712 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 13:14:07,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:14:07,715 INFO L85 PathProgramCache]: Analyzing trace with hash -794856606, now seen corresponding path program 1 times [2023-02-15 13:14:07,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:14:07,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248906765] [2023-02-15 13:14:07,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:14:07,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:14:07,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:14:07,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:07,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:14:07,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248906765] [2023-02-15 13:14:07,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248906765] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:14:07,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:14:07,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 13:14:07,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395149835] [2023-02-15 13:14:07,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:14:07,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:14:07,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:14:07,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:14:07,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:14:07,764 INFO L87 Difference]: Start difference. First operand 156 states and 170 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:07,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:14:07,791 INFO L93 Difference]: Finished difference Result 208 states and 228 transitions. [2023-02-15 13:14:07,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:14:07,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-15 13:14:07,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:14:07,792 INFO L225 Difference]: With dead ends: 208 [2023-02-15 13:14:07,792 INFO L226 Difference]: Without dead ends: 208 [2023-02-15 13:14:07,793 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 [2023-02-15 13:14:07,794 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 53 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:14:07,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 273 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:14:07,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2023-02-15 13:14:07,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 164. [2023-02-15 13:14:07,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 123 states have (on average 1.4634146341463414) internal successors, (180), 163 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:07,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 180 transitions. [2023-02-15 13:14:07,798 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 180 transitions. Word has length 16 [2023-02-15 13:14:07,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:14:07,799 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 180 transitions. [2023-02-15 13:14:07,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:07,799 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 180 transitions. [2023-02-15 13:14:07,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 13:14:07,800 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:14:07,800 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:14:07,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-15 13:14:07,800 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 13:14:07,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:14:07,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362871, now seen corresponding path program 1 times [2023-02-15 13:14:07,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:14:07,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141475280] [2023-02-15 13:14:07,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:14:07,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:14:07,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:14:08,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:08,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:14:08,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141475280] [2023-02-15 13:14:08,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141475280] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:14:08,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:14:08,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 13:14:08,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289662343] [2023-02-15 13:14:08,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:14:08,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 13:14:08,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:14:08,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 13:14:08,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-02-15 13:14:08,011 INFO L87 Difference]: Start difference. First operand 164 states and 180 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:08,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:14:08,281 INFO L93 Difference]: Finished difference Result 167 states and 179 transitions. [2023-02-15 13:14:08,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 13:14:08,282 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-15 13:14:08,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:14:08,283 INFO L225 Difference]: With dead ends: 167 [2023-02-15 13:14:08,283 INFO L226 Difference]: Without dead ends: 167 [2023-02-15 13:14:08,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2023-02-15 13:14:08,285 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 252 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:14:08,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 521 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:14:08,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2023-02-15 13:14:08,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 163. [2023-02-15 13:14:08,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 123 states have (on average 1.4471544715447155) internal successors, (178), 162 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:08,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 178 transitions. [2023-02-15 13:14:08,289 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 178 transitions. Word has length 16 [2023-02-15 13:14:08,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:14:08,290 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 178 transitions. [2023-02-15 13:14:08,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:08,290 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 178 transitions. [2023-02-15 13:14:08,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 13:14:08,291 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:14:08,291 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:14:08,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-15 13:14:08,291 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 13:14:08,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:14:08,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362872, now seen corresponding path program 1 times [2023-02-15 13:14:08,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:14:08,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307220957] [2023-02-15 13:14:08,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:14:08,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:14:08,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:14:08,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:08,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:14:08,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307220957] [2023-02-15 13:14:08,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307220957] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:14:08,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:14:08,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-15 13:14:08,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53392983] [2023-02-15 13:14:08,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:14:08,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 13:14:08,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:14:08,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 13:14:08,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-02-15 13:14:08,589 INFO L87 Difference]: Start difference. First operand 163 states and 178 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:09,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:14:09,019 INFO L93 Difference]: Finished difference Result 162 states and 173 transitions. [2023-02-15 13:14:09,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-15 13:14:09,020 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-15 13:14:09,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:14:09,021 INFO L225 Difference]: With dead ends: 162 [2023-02-15 13:14:09,021 INFO L226 Difference]: Without dead ends: 162 [2023-02-15 13:14:09,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2023-02-15 13:14:09,022 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 333 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:14:09,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 398 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:14:09,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-02-15 13:14:09,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 156. [2023-02-15 13:14:09,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 123 states have (on average 1.3821138211382114) internal successors, (170), 155 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:09,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 170 transitions. [2023-02-15 13:14:09,025 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 170 transitions. Word has length 16 [2023-02-15 13:14:09,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:14:09,025 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 170 transitions. [2023-02-15 13:14:09,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:09,026 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 170 transitions. [2023-02-15 13:14:09,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 13:14:09,026 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:14:09,026 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] [2023-02-15 13:14:09,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-15 13:14:09,026 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 13:14:09,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:14:09,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1461793571, now seen corresponding path program 1 times [2023-02-15 13:14:09,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:14:09,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468704134] [2023-02-15 13:14:09,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:14:09,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:14:09,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:14:09,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:09,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:14:09,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468704134] [2023-02-15 13:14:09,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468704134] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:14:09,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:14:09,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 13:14:09,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035335732] [2023-02-15 13:14:09,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:14:09,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:14:09,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:14:09,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:14:09,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:14:09,057 INFO L87 Difference]: Start difference. First operand 156 states and 170 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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) [2023-02-15 13:14:09,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:14:09,064 INFO L93 Difference]: Finished difference Result 157 states and 171 transitions. [2023-02-15 13:14:09,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:14:09,064 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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 [2023-02-15 13:14:09,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:14:09,066 INFO L225 Difference]: With dead ends: 157 [2023-02-15 13:14:09,066 INFO L226 Difference]: Without dead ends: 157 [2023-02-15 13:14:09,066 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 [2023-02-15 13:14:09,067 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:14:09,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 275 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:14:09,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2023-02-15 13:14:09,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2023-02-15 13:14:09,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 124 states have (on average 1.3790322580645162) internal successors, (171), 156 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:09,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 171 transitions. [2023-02-15 13:14:09,071 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 171 transitions. Word has length 21 [2023-02-15 13:14:09,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:14:09,071 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 171 transitions. [2023-02-15 13:14:09,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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) [2023-02-15 13:14:09,071 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 171 transitions. [2023-02-15 13:14:09,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 13:14:09,074 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:14:09,074 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] [2023-02-15 13:14:09,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-15 13:14:09,075 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 13:14:09,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:14:09,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1463640613, now seen corresponding path program 1 times [2023-02-15 13:14:09,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:14:09,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409447480] [2023-02-15 13:14:09,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:14:09,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:14:09,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:14:09,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:09,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:14:09,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409447480] [2023-02-15 13:14:09,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409447480] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:14:09,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:14:09,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 13:14:09,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522939706] [2023-02-15 13:14:09,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:14:09,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 13:14:09,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:14:09,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 13:14:09,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:14:09,234 INFO L87 Difference]: Start difference. First operand 157 states and 171 transitions. Second operand has 6 states, 6 states have (on average 3.5) 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) [2023-02-15 13:14:09,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:14:09,344 INFO L93 Difference]: Finished difference Result 165 states and 179 transitions. [2023-02-15 13:14:09,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 13:14:09,345 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) 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 [2023-02-15 13:14:09,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:14:09,347 INFO L225 Difference]: With dead ends: 165 [2023-02-15 13:14:09,347 INFO L226 Difference]: Without dead ends: 165 [2023-02-15 13:14:09,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-02-15 13:14:09,348 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 13 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:14:09,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 589 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:14:09,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2023-02-15 13:14:09,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 161. [2023-02-15 13:14:09,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 128 states have (on average 1.3671875) internal successors, (175), 160 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:09,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 175 transitions. [2023-02-15 13:14:09,351 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 175 transitions. Word has length 21 [2023-02-15 13:14:09,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:14:09,352 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 175 transitions. [2023-02-15 13:14:09,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) 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) [2023-02-15 13:14:09,352 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 175 transitions. [2023-02-15 13:14:09,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-15 13:14:09,353 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:14:09,353 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] [2023-02-15 13:14:09,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-15 13:14:09,354 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 13:14:09,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:14:09,355 INFO L85 PathProgramCache]: Analyzing trace with hash -348511767, now seen corresponding path program 1 times [2023-02-15 13:14:09,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:14:09,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398842212] [2023-02-15 13:14:09,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:14:09,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:14:09,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:14:09,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:09,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:14:09,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398842212] [2023-02-15 13:14:09,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398842212] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:14:09,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:14:09,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:14:09,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677583793] [2023-02-15 13:14:09,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:14:09,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 13:14:09,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:14:09,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 13:14:09,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:14:09,427 INFO L87 Difference]: Start difference. First operand 161 states and 175 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:09,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:14:09,500 INFO L93 Difference]: Finished difference Result 161 states and 174 transitions. [2023-02-15 13:14:09,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 13:14:09,501 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-02-15 13:14:09,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:14:09,502 INFO L225 Difference]: With dead ends: 161 [2023-02-15 13:14:09,502 INFO L226 Difference]: Without dead ends: 161 [2023-02-15 13:14:09,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:14:09,503 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 155 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:14:09,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 212 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:14:09,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2023-02-15 13:14:09,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2023-02-15 13:14:09,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 128 states have (on average 1.359375) internal successors, (174), 160 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:09,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 174 transitions. [2023-02-15 13:14:09,507 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 174 transitions. Word has length 23 [2023-02-15 13:14:09,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:14:09,507 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 174 transitions. [2023-02-15 13:14:09,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:09,508 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 174 transitions. [2023-02-15 13:14:09,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-15 13:14:09,509 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:14:09,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] [2023-02-15 13:14:09,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-15 13:14:09,510 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 13:14:09,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:14:09,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1959765219, now seen corresponding path program 1 times [2023-02-15 13:14:09,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:14:09,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485427638] [2023-02-15 13:14:09,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:14:09,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:14:09,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:14:09,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:09,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:14:09,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485427638] [2023-02-15 13:14:09,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485427638] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:14:09,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:14:09,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 13:14:09,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942781736] [2023-02-15 13:14:09,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:14:09,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 13:14:09,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:14:09,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 13:14:09,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:14:09,601 INFO L87 Difference]: Start difference. First operand 161 states and 174 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:09,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:14:09,703 INFO L93 Difference]: Finished difference Result 162 states and 173 transitions. [2023-02-15 13:14:09,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 13:14:09,704 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-02-15 13:14:09,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:14:09,705 INFO L225 Difference]: With dead ends: 162 [2023-02-15 13:14:09,705 INFO L226 Difference]: Without dead ends: 162 [2023-02-15 13:14:09,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:14:09,706 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 257 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:14:09,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 235 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:14:09,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-02-15 13:14:09,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 159. [2023-02-15 13:14:09,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 127 states have (on average 1.3543307086614174) internal successors, (172), 158 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:09,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 172 transitions. [2023-02-15 13:14:09,709 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 172 transitions. Word has length 23 [2023-02-15 13:14:09,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:14:09,710 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 172 transitions. [2023-02-15 13:14:09,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:09,710 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 172 transitions. [2023-02-15 13:14:09,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 13:14:09,711 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:14:09,711 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] [2023-02-15 13:14:09,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-15 13:14:09,711 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 13:14:09,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:14:09,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1577640795, now seen corresponding path program 1 times [2023-02-15 13:14:09,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:14:09,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734273616] [2023-02-15 13:14:09,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:14:09,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:14:09,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:14:09,860 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:09,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:14:09,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734273616] [2023-02-15 13:14:09,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734273616] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:14:09,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478100957] [2023-02-15 13:14:09,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:14:09,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:14:09,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:14:09,867 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) [2023-02-15 13:14:09,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 13:14:09,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:14:09,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-15 13:14:09,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:14:10,154 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:14:10,171 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:14:10,188 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:10,188 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:14:10,323 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:10,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478100957] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:14:10,324 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:14:10,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 11 [2023-02-15 13:14:10,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769857230] [2023-02-15 13:14:10,326 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:14:10,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 13:14:10,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:14:10,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 13:14:10,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-02-15 13:14:10,328 INFO L87 Difference]: Start difference. First operand 159 states and 172 transitions. Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:10,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:14:10,649 INFO L93 Difference]: Finished difference Result 188 states and 206 transitions. [2023-02-15 13:14:10,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 13:14:10,649 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-02-15 13:14:10,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:14:10,650 INFO L225 Difference]: With dead ends: 188 [2023-02-15 13:14:10,650 INFO L226 Difference]: Without dead ends: 188 [2023-02-15 13:14:10,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2023-02-15 13:14:10,651 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 109 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:14:10,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 753 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:14:10,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2023-02-15 13:14:10,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 169. [2023-02-15 13:14:10,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 137 states have (on average 1.3357664233576643) internal successors, (183), 168 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:10,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 183 transitions. [2023-02-15 13:14:10,654 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 183 transitions. Word has length 26 [2023-02-15 13:14:10,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:14:10,654 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 183 transitions. [2023-02-15 13:14:10,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:10,655 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 183 transitions. [2023-02-15 13:14:10,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-15 13:14:10,655 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:14:10,655 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] [2023-02-15 13:14:10,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-15 13:14:10,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-02-15 13:14:10,856 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 13:14:10,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:14:10,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1662225504, now seen corresponding path program 1 times [2023-02-15 13:14:10,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:14:10,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126623064] [2023-02-15 13:14:10,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:14:10,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:14:10,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:14:10,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:10,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:14:10,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126623064] [2023-02-15 13:14:10,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126623064] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:14:10,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446349277] [2023-02-15 13:14:10,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:14:10,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:14:10,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:14:10,925 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) [2023-02-15 13:14:10,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 13:14:11,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:14:11,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-15 13:14:11,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:14:11,096 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:14:11,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:11,116 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:14:11,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:11,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446349277] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:14:11,154 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:14:11,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-02-15 13:14:11,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65045960] [2023-02-15 13:14:11,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:14:11,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 13:14:11,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:14:11,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 13:14:11,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:14:11,156 INFO L87 Difference]: Start difference. First operand 169 states and 183 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 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) [2023-02-15 13:14:11,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:14:11,281 INFO L93 Difference]: Finished difference Result 179 states and 192 transitions. [2023-02-15 13:14:11,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 13:14:11,282 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 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 27 [2023-02-15 13:14:11,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:14:11,283 INFO L225 Difference]: With dead ends: 179 [2023-02-15 13:14:11,283 INFO L226 Difference]: Without dead ends: 160 [2023-02-15 13:14:11,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:14:11,283 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 12 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:14:11,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 384 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:14:11,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2023-02-15 13:14:11,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2023-02-15 13:14:11,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 128 states have (on average 1.3515625) internal successors, (173), 159 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:11,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 173 transitions. [2023-02-15 13:14:11,286 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 173 transitions. Word has length 27 [2023-02-15 13:14:11,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:14:11,287 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 173 transitions. [2023-02-15 13:14:11,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 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) [2023-02-15 13:14:11,287 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 173 transitions. [2023-02-15 13:14:11,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-15 13:14:11,287 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:14:11,287 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] [2023-02-15 13:14:11,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-15 13:14:11,488 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,SelfDestructingSolverStorable15 [2023-02-15 13:14:11,488 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 13:14:11,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:14:11,489 INFO L85 PathProgramCache]: Analyzing trace with hash -112828615, now seen corresponding path program 1 times [2023-02-15 13:14:11,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:14:11,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055338851] [2023-02-15 13:14:11,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:14:11,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:14:11,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:14:11,827 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:11,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:14:11,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055338851] [2023-02-15 13:14:11,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055338851] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:14:11,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120259549] [2023-02-15 13:14:11,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:14:11,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:14:11,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:14:11,829 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) [2023-02-15 13:14:11,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 13:14:11,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:14:11,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-15 13:14:11,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:14:11,951 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:14:12,023 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:14:12,023 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:14:12,058 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 7 [2023-02-15 13:14:12,137 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:14:12,138 INFO L350 Elim1Store]: Elim1 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 27 treesize of output 28 [2023-02-15 13:14:12,212 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:14:12,213 INFO L350 Elim1Store]: Elim1 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 30 treesize of output 28 [2023-02-15 13:14:12,238 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:14:12,238 INFO L350 Elim1Store]: Elim1 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 27 treesize of output 28 [2023-02-15 13:14:12,314 INFO L350 Elim1Store]: Elim1 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 24 treesize of output 12 [2023-02-15 13:14:12,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:12,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:14:12,339 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_502 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_502) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2023-02-15 13:14:12,352 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_502 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_502) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2023-02-15 13:14:12,388 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_500 (Array Int Int))) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_500))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_502)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2023-02-15 13:14:12,457 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:14:12,457 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:14:12,473 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:14:12,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 245 treesize of output 220 [2023-02-15 13:14:12,481 INFO L350 Elim1Store]: Elim1 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 204 treesize of output 196 [2023-02-15 13:14:12,490 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:14:12,490 INFO L350 Elim1Store]: Elim1 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 196 treesize of output 189 [2023-02-15 13:14:12,706 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:12,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120259549] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:14:12,707 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:14:12,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 28 [2023-02-15 13:14:12,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024139728] [2023-02-15 13:14:12,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:14:12,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-02-15 13:14:12,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:14:12,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-02-15 13:14:12,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=515, Unknown=15, NotChecked=144, Total=756 [2023-02-15 13:14:12,709 INFO L87 Difference]: Start difference. First operand 160 states and 173 transitions. Second operand has 28 states, 28 states have (on average 3.0) internal successors, (84), 28 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:13,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:14:13,640 INFO L93 Difference]: Finished difference Result 273 states and 296 transitions. [2023-02-15 13:14:13,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-15 13:14:13,641 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.0) internal successors, (84), 28 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have 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 [2023-02-15 13:14:13,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:14:13,642 INFO L225 Difference]: With dead ends: 273 [2023-02-15 13:14:13,642 INFO L226 Difference]: Without dead ends: 273 [2023-02-15 13:14:13,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=234, Invalid=953, Unknown=15, NotChecked=204, Total=1406 [2023-02-15 13:14:13,643 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 812 mSDsluCounter, 1192 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 812 SdHoareTripleChecker+Valid, 1285 SdHoareTripleChecker+Invalid, 1851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 765 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 13:14:13,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [812 Valid, 1285 Invalid, 1851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1060 Invalid, 0 Unknown, 765 Unchecked, 0.6s Time] [2023-02-15 13:14:13,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2023-02-15 13:14:13,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 175. [2023-02-15 13:14:13,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 143 states have (on average 1.3286713286713288) internal successors, (190), 174 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:13,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 190 transitions. [2023-02-15 13:14:13,647 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 190 transitions. Word has length 33 [2023-02-15 13:14:13,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:14:13,647 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 190 transitions. [2023-02-15 13:14:13,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.0) internal successors, (84), 28 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:13,647 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 190 transitions. [2023-02-15 13:14:13,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-15 13:14:13,648 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:14:13,648 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] [2023-02-15 13:14:13,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 13:14:13,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:14:13,854 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 13:14:13,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:14:13,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1345804944, now seen corresponding path program 1 times [2023-02-15 13:14:13,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:14:13,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450043670] [2023-02-15 13:14:13,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:14:13,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:14:13,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:14:13,891 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:13,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:14:13,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450043670] [2023-02-15 13:14:13,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450043670] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:14:13,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:14:13,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 13:14:13,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143428539] [2023-02-15 13:14:13,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:14:13,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:14:13,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:14:13,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:14:13,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:14:13,894 INFO L87 Difference]: Start difference. First operand 175 states and 190 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 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) [2023-02-15 13:14:13,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:14:13,915 INFO L93 Difference]: Finished difference Result 249 states and 270 transitions. [2023-02-15 13:14:13,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:14:13,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 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 [2023-02-15 13:14:13,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:14:13,916 INFO L225 Difference]: With dead ends: 249 [2023-02-15 13:14:13,916 INFO L226 Difference]: Without dead ends: 249 [2023-02-15 13:14:13,917 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 [2023-02-15 13:14:13,917 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 58 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:14:13,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 256 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:14:13,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2023-02-15 13:14:13,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 196. [2023-02-15 13:14:13,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 164 states have (on average 1.2865853658536586) internal successors, (211), 195 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) [2023-02-15 13:14:13,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 211 transitions. [2023-02-15 13:14:13,921 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 211 transitions. Word has length 34 [2023-02-15 13:14:13,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:14:13,922 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 211 transitions. [2023-02-15 13:14:13,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 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) [2023-02-15 13:14:13,923 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 211 transitions. [2023-02-15 13:14:13,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-15 13:14:13,923 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:14:13,923 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] [2023-02-15 13:14:13,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-02-15 13:14:13,925 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 13:14:13,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:14:13,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1598443618, now seen corresponding path program 1 times [2023-02-15 13:14:13,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:14:13,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767420359] [2023-02-15 13:14:13,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:14:13,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:14:13,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:14:14,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:14,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:14:14,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767420359] [2023-02-15 13:14:14,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767420359] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:14:14,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412232860] [2023-02-15 13:14:14,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:14:14,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:14:14,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:14:14,324 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) [2023-02-15 13:14:14,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 13:14:14,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:14:14,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 37 conjunts are in the unsatisfiable core [2023-02-15 13:14:14,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:14:14,580 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-15 13:14:14,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 26 [2023-02-15 13:14:14,593 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:14:14,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:14:14,665 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 13:14:14,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2023-02-15 13:14:14,671 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:14:14,946 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:14:14,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 59 [2023-02-15 13:14:15,242 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-02-15 13:14:15,242 INFO L350 Elim1Store]: Elim1 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 69 treesize of output 60 [2023-02-15 13:14:15,303 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:15,303 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:14:15,544 INFO L350 Elim1Store]: Elim1 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 230 treesize of output 222 [2023-02-15 13:14:19,289 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:14:19,289 INFO L350 Elim1Store]: Elim1 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 170 treesize of output 137 [2023-02-15 13:14:19,641 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:14:19,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 54 treesize of output 208 [2023-02-15 13:14:21,097 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:21,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [412232860] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:14:21,098 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:14:21,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 32 [2023-02-15 13:14:21,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145480523] [2023-02-15 13:14:21,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:14:21,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-02-15 13:14:21,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:14:21,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-02-15 13:14:21,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=908, Unknown=3, NotChecked=0, Total=1056 [2023-02-15 13:14:21,101 INFO L87 Difference]: Start difference. First operand 196 states and 211 transitions. Second operand has 33 states, 32 states have (on average 3.71875) internal successors, (119), 33 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:34,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:14:34,934 INFO L93 Difference]: Finished difference Result 405 states and 446 transitions. [2023-02-15 13:14:34,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-02-15 13:14:34,934 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 3.71875) internal successors, (119), 33 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2023-02-15 13:14:34,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:14:34,936 INFO L225 Difference]: With dead ends: 405 [2023-02-15 13:14:34,936 INFO L226 Difference]: Without dead ends: 405 [2023-02-15 13:14:34,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1279 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=1157, Invalid=3949, Unknown=6, NotChecked=0, Total=5112 [2023-02-15 13:14:34,938 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 1174 mSDsluCounter, 1365 mSDsCounter, 0 mSdLazyCounter, 1364 mSolverCounterSat, 106 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1174 SdHoareTripleChecker+Valid, 1450 SdHoareTripleChecker+Invalid, 1471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 1364 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2023-02-15 13:14:34,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1174 Valid, 1450 Invalid, 1471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 1364 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2023-02-15 13:14:34,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2023-02-15 13:14:34,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 232. [2023-02-15 13:14:34,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 200 states have (on average 1.27) internal successors, (254), 231 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) [2023-02-15 13:14:34,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 254 transitions. [2023-02-15 13:14:34,943 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 254 transitions. Word has length 43 [2023-02-15 13:14:34,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:14:34,944 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 254 transitions. [2023-02-15 13:14:34,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 3.71875) internal successors, (119), 33 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:34,944 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 254 transitions. [2023-02-15 13:14:34,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-15 13:14:34,945 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:14:34,945 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] [2023-02-15 13:14:34,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-15 13:14:35,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:14:35,151 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 13:14:35,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:14:35,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1598443619, now seen corresponding path program 1 times [2023-02-15 13:14:35,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:14:35,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772487943] [2023-02-15 13:14:35,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:14:35,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:14:35,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:14:35,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:35,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:14:35,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772487943] [2023-02-15 13:14:35,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772487943] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:14:35,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118702] [2023-02-15 13:14:35,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:14:35,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:14:35,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:14:35,668 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) [2023-02-15 13:14:35,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 13:14:35,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:14:35,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 48 conjunts are in the unsatisfiable core [2023-02-15 13:14:35,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:14:35,792 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:14:35,860 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:14:35,871 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:14:35,871 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:14:35,910 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:14:35,919 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:14:36,010 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:14:36,011 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:14:36,014 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:14:36,114 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 13:14:36,115 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:14:36,119 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:14:36,129 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:14:36,129 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:14:36,169 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:14:36,169 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:14:36,175 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:14:36,299 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:14:36,302 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:14:36,359 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:36,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:14:36,496 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_751 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_751) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 8))) (forall ((v_ArrVal_751 (Array Int Int)) (v_ArrVal_752 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_751) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_752) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2023-02-15 13:14:36,593 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (and (forall ((v_ArrVal_751 (Array Int Int)) (v_ArrVal_752 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_751) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_752) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_751 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_751) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 8))))) is different from false [2023-02-15 13:14:36,608 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_748 (Array Int Int)) (v_ArrVal_747 (Array Int Int)) (v_ArrVal_751 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_747) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_748) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_751) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 8))) (forall ((v_ArrVal_748 (Array Int Int)) (v_ArrVal_747 (Array Int Int)) (v_ArrVal_751 (Array Int Int)) (v_ArrVal_752 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_748))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_747) .cse0 v_ArrVal_751) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 12) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_752) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))))) is different from false [2023-02-15 13:14:36,621 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (and (forall ((v_ArrVal_748 (Array Int Int)) (v_ArrVal_747 (Array Int Int)) (v_ArrVal_751 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_747) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_748) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_751) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 8))) (forall ((v_ArrVal_748 (Array Int Int)) (v_ArrVal_747 (Array Int Int)) (v_ArrVal_751 (Array Int Int)) (v_ArrVal_752 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_748))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_747) .cse1 v_ArrVal_751) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 12) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_752) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))) is different from false [2023-02-15 13:14:36,636 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:14:36,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2023-02-15 13:14:36,642 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:14:36,642 INFO L350 Elim1Store]: Elim1 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 30 treesize of output 31 [2023-02-15 13:14:36,646 INFO L350 Elim1Store]: Elim1 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 54 treesize of output 46 [2023-02-15 13:14:36,653 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:14:36,654 INFO L350 Elim1Store]: Elim1 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 112 treesize of output 111 [2023-02-15 13:14:36,657 INFO L350 Elim1Store]: Elim1 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 68 treesize of output 60 [2023-02-15 13:14:36,659 INFO L350 Elim1Store]: Elim1 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 88 treesize of output 82 [2023-02-15 13:14:36,668 INFO L350 Elim1Store]: Elim1 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 56 treesize of output 54 [2023-02-15 13:14:36,734 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:14:36,735 INFO L350 Elim1Store]: Elim1 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 73 treesize of output 74 [2023-02-15 13:14:36,742 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:14:36,742 INFO L350 Elim1Store]: Elim1 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 65 treesize of output 50 [2023-02-15 13:14:36,745 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:14:36,746 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:14:36,749 INFO L350 Elim1Store]: Elim1 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 74 treesize of output 50 [2023-02-15 13:14:36,752 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:14:36,754 INFO L350 Elim1Store]: Elim1 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 42 treesize of output 30 [2023-02-15 13:14:36,758 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 13:14:36,888 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:36,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1118702] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:14:36,888 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:14:36,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 12] total 35 [2023-02-15 13:14:36,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965136616] [2023-02-15 13:14:36,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:14:36,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-02-15 13:14:36,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:14:36,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-02-15 13:14:36,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=867, Unknown=25, NotChecked=252, Total=1260 [2023-02-15 13:14:36,891 INFO L87 Difference]: Start difference. First operand 232 states and 254 transitions. Second operand has 36 states, 35 states have (on average 3.6285714285714286) internal successors, (127), 36 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:41,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:15:04,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:15:04,220 INFO L93 Difference]: Finished difference Result 369 states and 403 transitions. [2023-02-15 13:15:04,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-02-15 13:15:04,220 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 3.6285714285714286) internal successors, (127), 36 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2023-02-15 13:15:04,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:15:04,223 INFO L225 Difference]: With dead ends: 369 [2023-02-15 13:15:04,223 INFO L226 Difference]: Without dead ends: 369 [2023-02-15 13:15:04,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 20.5s TimeCoverageRelationStatistics Valid=530, Invalid=2760, Unknown=32, NotChecked=460, Total=3782 [2023-02-15 13:15:04,227 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 615 mSDsluCounter, 1393 mSDsCounter, 0 mSdLazyCounter, 1690 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 1475 SdHoareTripleChecker+Invalid, 2829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1690 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 1075 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2023-02-15 13:15:04,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 1475 Invalid, 2829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1690 Invalid, 1 Unknown, 1075 Unchecked, 7.3s Time] [2023-02-15 13:15:04,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2023-02-15 13:15:04,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 247. [2023-02-15 13:15:04,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 215 states have (on average 1.2697674418604652) internal successors, (273), 246 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:15:04,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 273 transitions. [2023-02-15 13:15:04,237 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 273 transitions. Word has length 43 [2023-02-15 13:15:04,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:15:04,237 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 273 transitions. [2023-02-15 13:15:04,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 3.6285714285714286) internal successors, (127), 36 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:15:04,237 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 273 transitions. [2023-02-15 13:15:04,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-15 13:15:04,238 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:15:04,238 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] [2023-02-15 13:15:04,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-15 13:15:04,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:15:04,445 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 13:15:04,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:15:04,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1987856737, now seen corresponding path program 1 times [2023-02-15 13:15:04,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:15:04,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514082906] [2023-02-15 13:15:04,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:15:04,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:15:04,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:15:04,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 13:15:04,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:15:04,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514082906] [2023-02-15 13:15:04,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514082906] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:15:04,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:15:04,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 13:15:04,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775440372] [2023-02-15 13:15:04,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:15:04,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:15:04,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:15:04,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:15:04,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:15:04,501 INFO L87 Difference]: Start difference. First operand 247 states and 273 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:15:04,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:15:04,532 INFO L93 Difference]: Finished difference Result 249 states and 274 transitions. [2023-02-15 13:15:04,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:15:04,533 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2023-02-15 13:15:04,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:15:04,534 INFO L225 Difference]: With dead ends: 249 [2023-02-15 13:15:04,534 INFO L226 Difference]: Without dead ends: 249 [2023-02-15 13:15:04,534 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 [2023-02-15 13:15:04,534 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 270 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 [2023-02-15 13:15:04,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 270 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:15:04,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2023-02-15 13:15:04,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2023-02-15 13:15:04,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 217 states have (on average 1.262672811059908) internal successors, (274), 248 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:15:04,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 274 transitions. [2023-02-15 13:15:04,538 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 274 transitions. Word has length 44 [2023-02-15 13:15:04,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:15:04,538 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 274 transitions. [2023-02-15 13:15:04,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:15:04,538 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 274 transitions. [2023-02-15 13:15:04,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 13:15:04,539 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:15:04,539 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] [2023-02-15 13:15:04,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-02-15 13:15:04,539 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 13:15:04,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:15:04,539 INFO L85 PathProgramCache]: Analyzing trace with hash 931768708, now seen corresponding path program 1 times [2023-02-15 13:15:04,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:15:04,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138799977] [2023-02-15 13:15:04,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:15:04,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:15:04,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:15:07,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:15:07,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:15:07,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138799977] [2023-02-15 13:15:07,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138799977] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:15:07,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613295973] [2023-02-15 13:15:07,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:15:07,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:15:07,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:15:07,753 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) [2023-02-15 13:15:07,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-15 13:15:07,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:15:07,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 46 conjunts are in the unsatisfiable core [2023-02-15 13:15:07,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:15:08,718 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-15 13:15:08,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 26 [2023-02-15 13:15:08,824 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-02-15 13:15:08,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2023-02-15 13:15:09,208 INFO L321 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2023-02-15 13:15:09,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 100 treesize of output 84 [2023-02-15 13:15:09,228 INFO L350 Elim1Store]: Elim1 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 17 treesize of output 13 [2023-02-15 13:15:09,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:15:09,262 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-02-15 13:15:09,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 50 [2023-02-15 13:15:11,211 INFO L321 Elim1Store]: treesize reduction 3, result has 81.3 percent of original size [2023-02-15 13:15:11,212 INFO L350 Elim1Store]: Elim1 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 72 treesize of output 60 [2023-02-15 13:15:11,222 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 13:15:11,222 INFO L350 Elim1Store]: Elim1 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 65 treesize of output 40 [2023-02-15 13:15:11,816 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:15:12,008 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:15:12,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:15:13,378 INFO L350 Elim1Store]: Elim1 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 114 treesize of output 80 [2023-02-15 13:15:15,115 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:15:15,115 INFO L350 Elim1Store]: Elim1 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 679 treesize of output 515 [2023-02-15 13:15:15,182 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:15:15,185 INFO L350 Elim1Store]: Elim1 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 941 treesize of output 672 [2023-02-15 13:15:18,536 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:15:18,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613295973] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:15:18,536 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:15:18,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 14, 14] total 42 [2023-02-15 13:15:18,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078298925] [2023-02-15 13:15:18,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:15:18,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-02-15 13:15:18,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:15:18,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-02-15 13:15:18,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1547, Unknown=0, NotChecked=0, Total=1722 [2023-02-15 13:15:18,538 INFO L87 Difference]: Start difference. First operand 249 states and 274 transitions. Second operand has 42 states, 42 states have (on average 3.119047619047619) internal successors, (131), 42 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:15:40,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:15:40,643 INFO L93 Difference]: Finished difference Result 374 states and 406 transitions. [2023-02-15 13:15:40,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-02-15 13:15:40,644 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 3.119047619047619) internal successors, (131), 42 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have 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 [2023-02-15 13:15:40,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:15:40,645 INFO L225 Difference]: With dead ends: 374 [2023-02-15 13:15:40,645 INFO L226 Difference]: Without dead ends: 374 [2023-02-15 13:15:40,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1262 ImplicationChecksByTransitivity, 20.9s TimeCoverageRelationStatistics Valid=863, Invalid=4837, Unknown=0, NotChecked=0, Total=5700 [2023-02-15 13:15:40,647 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 1315 mSDsluCounter, 1504 mSDsCounter, 0 mSdLazyCounter, 1847 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1315 SdHoareTripleChecker+Valid, 1584 SdHoareTripleChecker+Invalid, 1932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:15:40,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1315 Valid, 1584 Invalid, 1932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1847 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2023-02-15 13:15:40,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2023-02-15 13:15:40,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 248. [2023-02-15 13:15:40,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 216 states have (on average 1.2592592592592593) internal successors, (272), 247 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:15:40,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 272 transitions. [2023-02-15 13:15:40,652 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 272 transitions. Word has length 46 [2023-02-15 13:15:40,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:15:40,652 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 272 transitions. [2023-02-15 13:15:40,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 3.119047619047619) internal successors, (131), 42 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:15:40,652 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 272 transitions. [2023-02-15 13:15:40,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-15 13:15:40,653 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:15:40,653 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] [2023-02-15 13:15:40,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-15 13:15:40,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:15:40,861 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 13:15:40,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:15:40,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1102971968, now seen corresponding path program 1 times [2023-02-15 13:15:40,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:15:40,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124161982] [2023-02-15 13:15:40,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:15:40,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:15:40,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:15:42,366 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:15:42,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:15:42,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124161982] [2023-02-15 13:15:42,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124161982] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:15:42,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166747071] [2023-02-15 13:15:42,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:15:42,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:15:42,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:15:42,369 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) [2023-02-15 13:15:42,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-15 13:15:42,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:15:42,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 37 conjunts are in the unsatisfiable core [2023-02-15 13:15:42,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:15:42,524 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:15:42,975 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 13:15:42,976 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:15:43,141 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:15:43,594 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:15:43,594 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:15:44,021 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:15:44,021 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:15:44,135 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:15:44,136 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:15:45,092 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:15:45,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2023-02-15 13:15:45,447 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:15:45,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:15:46,051 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1001 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1001) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~head~0#1.base|))) (forall ((v_ArrVal_1001 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1001) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1))) is different from false [2023-02-15 13:15:46,397 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_999 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_999) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) (forall ((v_ArrVal_999 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_999) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) |c_ULTIMATE.start_main_~head~0#1.base|))) (forall ((v_ArrVal_999 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_999) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~head~0#1.base|)))) is different from false [2023-02-15 13:15:46,441 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (and (forall ((v_ArrVal_999 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_999) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~head~0#1.base|))) (forall ((v_ArrVal_999 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_999) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) |c_ULTIMATE.start_main_~head~0#1.base|))) (forall ((v_ArrVal_999 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_999) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)))) is different from false [2023-02-15 13:15:46,485 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:15:46,485 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:15:46,521 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:15:46,521 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:15:46,529 INFO L350 Elim1Store]: Elim1 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 5 [2023-02-15 13:15:46,626 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:15:46,626 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 20 [2023-02-15 13:15:46,637 INFO L350 Elim1Store]: Elim1 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 33 treesize of output 25 [2023-02-15 13:15:46,647 INFO L350 Elim1Store]: Elim1 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 6 treesize of output 4 [2023-02-15 13:15:46,711 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:15:46,711 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2023-02-15 13:15:46,717 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:15:46,784 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-02-15 13:15:46,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 16 [2023-02-15 13:15:47,147 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:15:47,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166747071] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:15:47,148 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:15:47,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 14] total 30 [2023-02-15 13:15:47,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555182184] [2023-02-15 13:15:47,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:15:47,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-02-15 13:15:47,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:15:47,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-02-15 13:15:47,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=615, Unknown=3, NotChecked=162, Total=930 [2023-02-15 13:15:47,150 INFO L87 Difference]: Start difference. First operand 248 states and 272 transitions. Second operand has 31 states, 30 states have (on average 3.6666666666666665) internal successors, (110), 31 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:15:53,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:15:53,496 INFO L93 Difference]: Finished difference Result 290 states and 318 transitions. [2023-02-15 13:15:53,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-15 13:15:53,496 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.6666666666666665) internal successors, (110), 31 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have 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 [2023-02-15 13:15:53,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:15:53,497 INFO L225 Difference]: With dead ends: 290 [2023-02-15 13:15:53,497 INFO L226 Difference]: Without dead ends: 290 [2023-02-15 13:15:53,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 77 SyntacticMatches, 6 SemanticMatches, 34 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=222, Invalid=843, Unknown=3, NotChecked=192, Total=1260 [2023-02-15 13:15:53,498 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 443 mSDsluCounter, 1030 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 1516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 535 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2023-02-15 13:15:53,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 1119 Invalid, 1516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 951 Invalid, 0 Unknown, 535 Unchecked, 3.4s Time] [2023-02-15 13:15:53,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2023-02-15 13:15:53,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 271. [2023-02-15 13:15:53,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 239 states have (on average 1.2803347280334727) internal successors, (306), 270 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) [2023-02-15 13:15:53,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 306 transitions. [2023-02-15 13:15:53,507 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 306 transitions. Word has length 48 [2023-02-15 13:15:53,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:15:53,507 INFO L495 AbstractCegarLoop]: Abstraction has 271 states and 306 transitions. [2023-02-15 13:15:53,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.6666666666666665) internal successors, (110), 31 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:15:53,508 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 306 transitions. [2023-02-15 13:15:53,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-15 13:15:53,508 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:15:53,508 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] [2023-02-15 13:15:53,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-15 13:15:53,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:15:53,716 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 13:15:53,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:15:53,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1102971969, now seen corresponding path program 1 times [2023-02-15 13:15:53,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:15:53,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674266747] [2023-02-15 13:15:53,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:15:53,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:15:53,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:15:54,892 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:15:54,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:15:54,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674266747] [2023-02-15 13:15:54,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674266747] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:15:54,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375277901] [2023-02-15 13:15:54,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:15:54,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:15:54,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:15:54,894 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) [2023-02-15 13:15:54,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-15 13:15:55,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:15:55,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 48 conjunts are in the unsatisfiable core [2023-02-15 13:15:55,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:15:55,021 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:15:55,376 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:15:55,377 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:15:55,405 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:15:55,550 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:15:55,581 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:15:56,043 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:15:56,043 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:15:56,073 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:15:56,657 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 13:15:56,657 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:15:56,672 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:15:56,726 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:15:56,726 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:15:56,925 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:15:56,925 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:15:56,947 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:15:57,802 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:15:57,818 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:15:58,137 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:15:58,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:15:59,024 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1108 (Array Int Int)) (v_ArrVal_1107 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1107) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1108) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_1107 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1107) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2023-02-15 13:15:59,402 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (and (forall ((v_ArrVal_1108 (Array Int Int)) (v_ArrVal_1107 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1107) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1108) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_1107 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1107) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2023-02-15 13:15:59,459 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1108 (Array Int Int)) (v_ArrVal_1107 (Array Int Int)) (v_ArrVal_1104 (Array Int Int)) (v_ArrVal_1103 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1104))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1103) .cse0 v_ArrVal_1107) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_1108) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_ArrVal_1107 (Array Int Int)) (v_ArrVal_1104 (Array Int Int)) (v_ArrVal_1103 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1103) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1104) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1107) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2023-02-15 13:15:59,498 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (and (forall ((v_ArrVal_1108 (Array Int Int)) (v_ArrVal_1107 (Array Int Int)) (v_ArrVal_1104 (Array Int Int)) (v_ArrVal_1103 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1104))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1103) .cse1 v_ArrVal_1107) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1108) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_ArrVal_1107 (Array Int Int)) (v_ArrVal_1104 (Array Int Int)) (v_ArrVal_1103 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1103) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1104) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1107) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2023-02-15 13:15:59,548 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:15:59,548 INFO L350 Elim1Store]: Elim1 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 73 treesize of output 74 [2023-02-15 13:15:59,570 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:15:59,570 INFO L350 Elim1Store]: Elim1 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 65 treesize of output 50 [2023-02-15 13:15:59,618 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:15:59,618 INFO L350 Elim1Store]: Elim1 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 334 treesize of output 301 [2023-02-15 13:15:59,691 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:15:59,691 INFO L350 Elim1Store]: Elim1 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 598 treesize of output 573 [2023-02-15 13:15:59,704 INFO L350 Elim1Store]: Elim1 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 558 treesize of output 534 [2023-02-15 13:15:59,716 INFO L350 Elim1Store]: Elim1 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 534 treesize of output 510 [2023-02-15 13:15:59,728 INFO L350 Elim1Store]: Elim1 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 510 treesize of output 502 [2023-02-15 13:15:59,779 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:15:59,779 INFO L350 Elim1Store]: Elim1 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 502 treesize of output 458 [2023-02-15 13:16:19,662 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:16:19,663 INFO L350 Elim1Store]: Elim1 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 36 treesize of output 37 [2023-02-15 13:16:19,682 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:16:19,682 INFO L350 Elim1Store]: Elim1 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 28 treesize of output 29 [2023-02-15 13:16:19,687 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:16:19,693 INFO L350 Elim1Store]: Elim1 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 26 treesize of output 18 [2023-02-15 13:16:19,698 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:16:19,703 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 8 [2023-02-15 13:16:20,315 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:16:20,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375277901] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:16:20,315 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:16:20,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 32 [2023-02-15 13:16:20,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636707976] [2023-02-15 13:16:20,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:16:20,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-02-15 13:16:20,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:16:20,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-02-15 13:16:20,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=708, Unknown=15, NotChecked=228, Total=1056 [2023-02-15 13:16:20,317 INFO L87 Difference]: Start difference. First operand 271 states and 306 transitions. Second operand has 33 states, 32 states have (on average 4.4375) internal successors, (142), 33 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:16:27,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:16:27,912 INFO L93 Difference]: Finished difference Result 417 states and 458 transitions. [2023-02-15 13:16:27,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-15 13:16:27,913 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 4.4375) internal successors, (142), 33 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have 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 [2023-02-15 13:16:27,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:16:27,914 INFO L225 Difference]: With dead ends: 417 [2023-02-15 13:16:27,915 INFO L226 Difference]: Without dead ends: 417 [2023-02-15 13:16:27,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 76 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=325, Invalid=1398, Unknown=15, NotChecked=332, Total=2070 [2023-02-15 13:16:27,916 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 786 mSDsluCounter, 1475 mSDsCounter, 0 mSdLazyCounter, 1277 mSolverCounterSat, 37 mSolverCounterUnsat, 32 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 1558 SdHoareTripleChecker+Invalid, 2007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1277 IncrementalHoareTripleChecker+Invalid, 32 IncrementalHoareTripleChecker+Unknown, 661 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2023-02-15 13:16:27,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [786 Valid, 1558 Invalid, 2007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1277 Invalid, 32 Unknown, 661 Unchecked, 4.9s Time] [2023-02-15 13:16:27,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2023-02-15 13:16:27,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 271. [2023-02-15 13:16:27,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 239 states have (on average 1.2761506276150627) internal successors, (305), 270 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) [2023-02-15 13:16:27,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 305 transitions. [2023-02-15 13:16:27,921 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 305 transitions. Word has length 48 [2023-02-15 13:16:27,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:16:27,921 INFO L495 AbstractCegarLoop]: Abstraction has 271 states and 305 transitions. [2023-02-15 13:16:27,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 4.4375) internal successors, (142), 33 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:16:27,921 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 305 transitions. [2023-02-15 13:16:27,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-15 13:16:27,922 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:16:27,922 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] [2023-02-15 13:16:27,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-15 13:16:28,128 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,SelfDestructingSolverStorable23 [2023-02-15 13:16:28,128 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 13:16:28,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:16:28,129 INFO L85 PathProgramCache]: Analyzing trace with hash 533456103, now seen corresponding path program 1 times [2023-02-15 13:16:28,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:16:28,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169122761] [2023-02-15 13:16:28,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:16:28,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:16:28,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:16:28,453 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 13:16:28,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:16:28,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169122761] [2023-02-15 13:16:28,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169122761] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:16:28,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518011699] [2023-02-15 13:16:28,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:16:28,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:16:28,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:16:28,457 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:16:28,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-15 13:16:28,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:16:28,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-15 13:16:28,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:16:28,699 INFO L350 Elim1Store]: Elim1 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 17 [2023-02-15 13:16:28,708 INFO L350 Elim1Store]: Elim1 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 13 [2023-02-15 13:16:28,951 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 13:16:28,951 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:16:28,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518011699] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:16:28,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 13:16:28,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 9 [2023-02-15 13:16:28,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609858086] [2023-02-15 13:16:28,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:16:28,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 13:16:28,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:16:28,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 13:16:28,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-02-15 13:16:28,953 INFO L87 Difference]: Start difference. First operand 271 states and 305 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:16:30,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:16:30,050 INFO L93 Difference]: Finished difference Result 320 states and 359 transitions. [2023-02-15 13:16:30,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 13:16:30,050 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have 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 [2023-02-15 13:16:30,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:16:30,052 INFO L225 Difference]: With dead ends: 320 [2023-02-15 13:16:30,052 INFO L226 Difference]: Without dead ends: 320 [2023-02-15 13:16:30,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2023-02-15 13:16:30,053 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 155 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-15 13:16:30,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 607 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-02-15 13:16:30,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2023-02-15 13:16:30,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 275. [2023-02-15 13:16:30,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 243 states have (on average 1.2633744855967077) internal successors, (307), 274 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) [2023-02-15 13:16:30,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 307 transitions. [2023-02-15 13:16:30,057 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 307 transitions. Word has length 49 [2023-02-15 13:16:30,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:16:30,058 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 307 transitions. [2023-02-15 13:16:30,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:16:30,058 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 307 transitions. [2023-02-15 13:16:30,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-15 13:16:30,058 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:16:30,059 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] [2023-02-15 13:16:30,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-15 13:16:30,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-02-15 13:16:30,269 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 13:16:30,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:16:30,269 INFO L85 PathProgramCache]: Analyzing trace with hash -167608475, now seen corresponding path program 1 times [2023-02-15 13:16:30,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:16:30,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921330937] [2023-02-15 13:16:30,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:16:30,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:16:30,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:16:30,562 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 13:16:30,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:16:30,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921330937] [2023-02-15 13:16:30,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921330937] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:16:30,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273131998] [2023-02-15 13:16:30,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:16:30,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:16:30,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:16:30,565 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:16:30,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-15 13:16:30,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:16:30,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-15 13:16:30,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:16:30,857 INFO L350 Elim1Store]: Elim1 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 17 [2023-02-15 13:16:30,866 INFO L350 Elim1Store]: Elim1 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 13 [2023-02-15 13:16:30,937 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 13:16:30,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:16:31,258 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 13:16:31,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273131998] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:16:31,259 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:16:31,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2023-02-15 13:16:31,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015700961] [2023-02-15 13:16:31,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:16:31,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 13:16:31,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:16:31,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 13:16:31,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:16:31,261 INFO L87 Difference]: Start difference. First operand 275 states and 307 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:16:31,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:16:31,812 INFO L93 Difference]: Finished difference Result 303 states and 338 transitions. [2023-02-15 13:16:31,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 13:16:31,812 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2023-02-15 13:16:31,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:16:31,813 INFO L225 Difference]: With dead ends: 303 [2023-02-15 13:16:31,813 INFO L226 Difference]: Without dead ends: 303 [2023-02-15 13:16:31,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-02-15 13:16:31,815 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 189 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 13:16:31,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 356 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 13:16:31,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2023-02-15 13:16:31,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 297. [2023-02-15 13:16:31,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 265 states have (on average 1.271698113207547) internal successors, (337), 296 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:16:31,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 337 transitions. [2023-02-15 13:16:31,822 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 337 transitions. Word has length 49 [2023-02-15 13:16:31,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:16:31,822 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 337 transitions. [2023-02-15 13:16:31,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:16:31,823 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 337 transitions. [2023-02-15 13:16:31,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-02-15 13:16:31,823 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:16:31,823 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:16:31,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-15 13:16:32,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-02-15 13:16:32,029 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 13:16:32,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:16:32,030 INFO L85 PathProgramCache]: Analyzing trace with hash -900848288, now seen corresponding path program 1 times [2023-02-15 13:16:32,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:16:32,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829712785] [2023-02-15 13:16:32,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:16:32,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:16:32,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:16:33,094 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:16:33,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:16:33,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829712785] [2023-02-15 13:16:33,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829712785] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:16:33,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [309991081] [2023-02-15 13:16:33,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:16:33,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:16:33,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:16:33,096 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:16:33,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-15 13:16:33,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:16:33,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 40 conjunts are in the unsatisfiable core [2023-02-15 13:16:33,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:16:33,230 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:16:33,568 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:16:33,569 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:16:33,743 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:16:33,768 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:16:34,194 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:16:34,194 INFO L350 Elim1Store]: Elim1 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 29 treesize of output 30 [2023-02-15 13:16:34,211 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:16:34,272 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:16:34,522 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2023-02-15 13:16:34,579 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2023-02-15 13:16:35,011 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:16:35,065 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:16:35,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:16:35,292 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1399 (Array Int Int))) (= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1399) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) is different from false [2023-02-15 13:16:35,324 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1399 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1399) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0)) is different from false [2023-02-15 13:16:35,342 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1399 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1399) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0)) is different from false [2023-02-15 13:16:35,367 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1399 (Array Int Int)) (v_ArrVal_1397 (Array Int Int)) (v_ArrVal_1396 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1397) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1396) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1399) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0)) is different from false [2023-02-15 13:16:35,385 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1399 (Array Int Int)) (v_ArrVal_1397 (Array Int Int)) (v_ArrVal_1396 (Array Int Int))) (= (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1397) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1396) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1399)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0)) is different from false [2023-02-15 13:16:35,413 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:16:35,413 INFO L350 Elim1Store]: Elim1 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 36 treesize of output 37 [2023-02-15 13:16:35,430 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:16:35,430 INFO L350 Elim1Store]: Elim1 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 28 treesize of output 29 [2023-02-15 13:16:35,441 INFO L350 Elim1Store]: Elim1 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 50 treesize of output 42 [2023-02-15 13:16:35,474 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:16:35,475 INFO L350 Elim1Store]: Elim1 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 100 treesize of output 99 [2023-02-15 13:16:35,484 INFO L350 Elim1Store]: Elim1 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 60 treesize of output 52 [2023-02-15 13:16:35,493 INFO L350 Elim1Store]: Elim1 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 76 treesize of output 70 [2023-02-15 13:16:35,502 INFO L350 Elim1Store]: Elim1 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 48 treesize of output 46 [2023-02-15 13:16:36,000 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:16:36,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [309991081] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:16:36,000 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:16:36,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 27 [2023-02-15 13:16:36,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336522210] [2023-02-15 13:16:36,001 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:16:36,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-02-15 13:16:36,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:16:36,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-02-15 13:16:36,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=423, Unknown=5, NotChecked=230, Total=756 [2023-02-15 13:16:36,002 INFO L87 Difference]: Start difference. First operand 297 states and 337 transitions. Second operand has 28 states, 27 states have (on average 4.0) internal successors, (108), 28 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:16:39,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:16:39,919 INFO L93 Difference]: Finished difference Result 305 states and 340 transitions. [2023-02-15 13:16:39,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-15 13:16:39,920 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 4.0) internal successors, (108), 28 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have 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 [2023-02-15 13:16:39,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:16:39,921 INFO L225 Difference]: With dead ends: 305 [2023-02-15 13:16:39,921 INFO L226 Difference]: Without dead ends: 305 [2023-02-15 13:16:39,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 85 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=279, Invalid=926, Unknown=5, NotChecked=350, Total=1560 [2023-02-15 13:16:39,922 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 602 mSDsluCounter, 928 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 31 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 602 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 1515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 726 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-02-15 13:16:39,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [602 Valid, 1019 Invalid, 1515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 748 Invalid, 10 Unknown, 726 Unchecked, 2.6s Time] [2023-02-15 13:16:39,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2023-02-15 13:16:39,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 299. [2023-02-15 13:16:39,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 267 states have (on average 1.2696629213483146) internal successors, (339), 298 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) [2023-02-15 13:16:39,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 339 transitions. [2023-02-15 13:16:39,927 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 339 transitions. Word has length 50 [2023-02-15 13:16:39,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:16:39,927 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 339 transitions. [2023-02-15 13:16:39,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 4.0) internal successors, (108), 28 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:16:39,927 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 339 transitions. [2023-02-15 13:16:39,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-15 13:16:39,928 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:16:39,928 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:16:39,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-02-15 13:16:40,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-02-15 13:16:40,137 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 13:16:40,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:16:40,137 INFO L85 PathProgramCache]: Analyzing trace with hash 2138474601, now seen corresponding path program 1 times [2023-02-15 13:16:40,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:16:40,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076174412] [2023-02-15 13:16:40,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:16:40,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:16:40,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:16:41,100 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:16:41,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:16:41,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076174412] [2023-02-15 13:16:41,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076174412] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:16:41,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003504892] [2023-02-15 13:16:41,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:16:41,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:16:41,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:16:41,102 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:16:41,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-15 13:16:41,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:16:41,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-15 13:16:41,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:16:41,240 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:16:41,562 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:16:41,563 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:16:41,717 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:16:42,113 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:16:42,113 INFO L350 Elim1Store]: Elim1 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 26 treesize of output 27 [2023-02-15 13:16:42,499 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:16:42,499 INFO L350 Elim1Store]: Elim1 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 29 treesize of output 27 [2023-02-15 13:16:42,598 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:16:42,599 INFO L350 Elim1Store]: Elim1 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 26 treesize of output 27 [2023-02-15 13:16:43,217 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 11 [2023-02-15 13:16:43,279 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:16:43,279 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:16:44,143 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1499 (Array Int Int))) (<= (+ 1 (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1499) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) |c_#StackHeapBarrier|)) is different from false [2023-02-15 13:16:44,170 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1499 (Array Int Int)) (v_ArrVal_1497 (Array Int Int))) (<= (+ (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1497))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1499)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 1) |c_#StackHeapBarrier|)) is different from false [2023-02-15 13:16:44,189 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1499 (Array Int Int)) (v_ArrVal_1497 (Array Int Int))) (<= (+ (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1497))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1499)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 1) |c_#StackHeapBarrier|)) is different from false [2023-02-15 13:16:44,216 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:16:44,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 31 [2023-02-15 13:16:44,250 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:16:44,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 131 [2023-02-15 13:16:44,285 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:16:44,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 114 [2023-02-15 13:16:44,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 102 [2023-02-15 13:16:45,125 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:16:45,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003504892] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:16:45,125 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:16:45,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 27 [2023-02-15 13:16:45,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583439379] [2023-02-15 13:16:45,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:16:45,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-02-15 13:16:45,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:16:45,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-02-15 13:16:45,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=504, Unknown=17, NotChecked=144, Total=756 [2023-02-15 13:16:45,127 INFO L87 Difference]: Start difference. First operand 299 states and 339 transitions. Second operand has 28 states, 27 states have (on average 4.037037037037037) internal successors, (109), 28 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:16:49,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:16:49,743 INFO L93 Difference]: Finished difference Result 306 states and 341 transitions. [2023-02-15 13:16:49,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-15 13:16:49,744 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 4.037037037037037) internal successors, (109), 28 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have 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 [2023-02-15 13:16:49,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:16:49,744 INFO L225 Difference]: With dead ends: 306 [2023-02-15 13:16:49,745 INFO L226 Difference]: Without dead ends: 306 [2023-02-15 13:16:49,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 84 SyntacticMatches, 7 SemanticMatches, 40 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=308, Invalid=1169, Unknown=17, NotChecked=228, Total=1722 [2023-02-15 13:16:49,745 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 669 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 730 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 1291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 529 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-02-15 13:16:49,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 893 Invalid, 1291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 730 Invalid, 0 Unknown, 529 Unchecked, 2.5s Time] [2023-02-15 13:16:49,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2023-02-15 13:16:49,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 300. [2023-02-15 13:16:49,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 268 states have (on average 1.2686567164179106) internal successors, (340), 299 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:16:49,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 340 transitions. [2023-02-15 13:16:49,750 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 340 transitions. Word has length 51 [2023-02-15 13:16:49,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:16:49,751 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 340 transitions. [2023-02-15 13:16:49,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 4.037037037037037) internal successors, (109), 28 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:16:49,751 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 340 transitions. [2023-02-15 13:16:49,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-15 13:16:49,756 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:16:49,756 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-02-15 13:16:49,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-02-15 13:16:49,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-02-15 13:16:49,962 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 13:16:49,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:16:49,963 INFO L85 PathProgramCache]: Analyzing trace with hash -805075436, now seen corresponding path program 1 times [2023-02-15 13:16:49,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:16:49,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084924291] [2023-02-15 13:16:49,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:16:49,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:16:49,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:16:50,030 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-02-15 13:16:50,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:16:50,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084924291] [2023-02-15 13:16:50,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084924291] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:16:50,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:16:50,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 13:16:50,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479208830] [2023-02-15 13:16:50,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:16:50,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:16:50,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:16:50,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:16:50,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:16:50,032 INFO L87 Difference]: Start difference. First operand 300 states and 340 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) [2023-02-15 13:16:50,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:16:50,139 INFO L93 Difference]: Finished difference Result 361 states and 402 transitions. [2023-02-15 13:16:50,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:16:50,140 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 51 [2023-02-15 13:16:50,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:16:50,141 INFO L225 Difference]: With dead ends: 361 [2023-02-15 13:16:50,141 INFO L226 Difference]: Without dead ends: 361 [2023-02-15 13:16:50,141 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 [2023-02-15 13:16:50,142 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 67 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:16:50,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 293 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:16:50,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2023-02-15 13:16:50,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 285. [2023-02-15 13:16:50,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 253 states have (on average 1.2648221343873518) internal successors, (320), 284 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:16:50,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 320 transitions. [2023-02-15 13:16:50,146 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 320 transitions. Word has length 51 [2023-02-15 13:16:50,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:16:50,146 INFO L495 AbstractCegarLoop]: Abstraction has 285 states and 320 transitions. [2023-02-15 13:16:50,146 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) [2023-02-15 13:16:50,147 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 320 transitions. [2023-02-15 13:16:50,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-15 13:16:50,147 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:16:50,147 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 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] [2023-02-15 13:16:50,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-02-15 13:16:50,147 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 13:16:50,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:16:50,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1868203650, now seen corresponding path program 1 times [2023-02-15 13:16:50,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:16:50,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560633592] [2023-02-15 13:16:50,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:16:50,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:16:50,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:16:50,246 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 13:16:50,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:16:50,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560633592] [2023-02-15 13:16:50,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560633592] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:16:50,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:16:50,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 13:16:50,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509369590] [2023-02-15 13:16:50,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:16:50,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:16:50,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:16:50,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:16:50,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:16:50,248 INFO L87 Difference]: Start difference. First operand 285 states and 320 transitions. Second operand has 4 states, 3 states have (on average 17.0) internal successors, (51), 4 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) [2023-02-15 13:16:50,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:16:50,644 INFO L93 Difference]: Finished difference Result 289 states and 323 transitions. [2023-02-15 13:16:50,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 13:16:50,644 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.0) internal successors, (51), 4 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 52 [2023-02-15 13:16:50,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:16:50,645 INFO L225 Difference]: With dead ends: 289 [2023-02-15 13:16:50,645 INFO L226 Difference]: Without dead ends: 289 [2023-02-15 13:16:50,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:16:50,645 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 165 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 13:16:50,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 159 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 13:16:50,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2023-02-15 13:16:50,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 278. [2023-02-15 13:16:50,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 247 states have (on average 1.2672064777327936) internal successors, (313), 277 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) [2023-02-15 13:16:50,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 313 transitions. [2023-02-15 13:16:50,654 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 313 transitions. Word has length 52 [2023-02-15 13:16:50,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:16:50,655 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 313 transitions. [2023-02-15 13:16:50,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.0) internal successors, (51), 4 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) [2023-02-15 13:16:50,655 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 313 transitions. [2023-02-15 13:16:50,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-15 13:16:50,655 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:16:50,655 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:16:50,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-02-15 13:16:50,656 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 13:16:50,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:16:50,656 INFO L85 PathProgramCache]: Analyzing trace with hash 455461742, now seen corresponding path program 1 times [2023-02-15 13:16:50,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:16:50,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014233495] [2023-02-15 13:16:50,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:16:50,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:16:50,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:16:50,758 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:16:50,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:16:50,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014233495] [2023-02-15 13:16:50,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014233495] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:16:50,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:16:50,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:16:50,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863527643] [2023-02-15 13:16:50,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:16:50,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:16:50,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:16:50,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:16:50,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:16:50,760 INFO L87 Difference]: Start difference. First operand 278 states and 313 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:16:50,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:16:50,938 INFO L93 Difference]: Finished difference Result 295 states and 319 transitions. [2023-02-15 13:16:50,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 13:16:50,939 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2023-02-15 13:16:50,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:16:50,940 INFO L225 Difference]: With dead ends: 295 [2023-02-15 13:16:50,940 INFO L226 Difference]: Without dead ends: 295 [2023-02-15 13:16:50,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:16:50,940 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 49 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:16:50,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 386 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:16:50,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2023-02-15 13:16:50,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 272. [2023-02-15 13:16:50,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 241 states have (on average 1.2448132780082988) internal successors, (300), 271 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) [2023-02-15 13:16:50,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 300 transitions. [2023-02-15 13:16:50,944 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 300 transitions. Word has length 52 [2023-02-15 13:16:50,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:16:50,944 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 300 transitions. [2023-02-15 13:16:50,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:16:50,945 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 300 transitions. [2023-02-15 13:16:50,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-15 13:16:50,946 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:16:50,946 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-02-15 13:16:50,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-02-15 13:16:50,946 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 13:16:50,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:16:50,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1330619915, now seen corresponding path program 1 times [2023-02-15 13:16:50,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:16:50,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136475022] [2023-02-15 13:16:50,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:16:50,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:16:50,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:16:54,729 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:16:54,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:16:54,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136475022] [2023-02-15 13:16:54,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136475022] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:16:54,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368251224] [2023-02-15 13:16:54,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:16:54,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:16:54,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:16:54,731 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:16:54,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-02-15 13:16:54,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:16:54,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 48 conjunts are in the unsatisfiable core [2023-02-15 13:16:54,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:16:54,898 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:16:55,054 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:16:55,055 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:16:55,231 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 7 [2023-02-15 13:16:55,743 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:16:55,743 INFO L350 Elim1Store]: Elim1 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 27 treesize of output 28 [2023-02-15 13:16:56,230 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:16:56,231 INFO L350 Elim1Store]: Elim1 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 30 treesize of output 28 [2023-02-15 13:16:56,523 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:16:56,524 INFO L350 Elim1Store]: Elim1 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 30 treesize of output 28 [2023-02-15 13:16:56,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:16:56,899 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-02-15 13:16:56,899 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 18 [2023-02-15 13:16:57,151 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-02-15 13:16:57,152 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 35 treesize of output 26 [2023-02-15 13:16:57,700 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-15 13:16:57,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 50 [2023-02-15 13:16:58,336 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-15 13:16:58,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 52 [2023-02-15 13:16:58,607 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-15 13:16:58,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 52 [2023-02-15 13:16:59,366 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 13:16:59,367 INFO L350 Elim1Store]: Elim1 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 52 treesize of output 23 [2023-02-15 13:16:59,374 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:16:59,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:16:59,701 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1819 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1819) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2023-02-15 13:16:59,720 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1819 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1819) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2023-02-15 13:16:59,748 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1819 (Array Int Int)) (v_ArrVal_1817 (Array Int Int))) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1817))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1819)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2023-02-15 13:16:59,768 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1819 (Array Int Int)) (v_ArrVal_1817 (Array Int Int))) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1817))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1819)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2023-02-15 13:16:59,801 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1819 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.offset| Int) (v_ArrVal_1817 (Array Int Int))) (not (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_#t~malloc3#1.base|)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1817))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1819)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2023-02-15 13:17:00,215 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:17:00,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2023-02-15 13:17:00,253 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_16 (Array Int Int)) (v_ArrVal_1819 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.offset| Int) (v_ArrVal_1817 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_16 |ULTIMATE.start_main_~item~0#1.offset|))) (or (not (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_arrayElimArr_16) .cse1 v_ArrVal_1817))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1819)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0)) (not (= (select |c_#valid| .cse1) 0))))) is different from false [2023-02-15 13:17:01,300 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:17:01,300 INFO L350 Elim1Store]: Elim1 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 120 treesize of output 80 [2023-02-15 13:17:01,348 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:17:01,349 INFO L350 Elim1Store]: Elim1 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 16103 treesize of output 14122 [2023-02-15 13:17:01,396 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:17:01,397 INFO L350 Elim1Store]: Elim1 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 14107 treesize of output 13121 [2023-02-15 13:17:01,417 INFO L350 Elim1Store]: Elim1 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 13090 treesize of output 12834 [2023-02-15 13:17:01,476 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:17:01,476 INFO L350 Elim1Store]: Elim1 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 12834 treesize of output 12491 [2023-02-15 13:17:01,531 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:17:01,532 INFO L350 Elim1Store]: Elim1 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 12491 treesize of output 11285 [2023-02-15 13:17:01,790 INFO L321 Elim1Store]: treesize reduction 14, result has 71.4 percent of original size [2023-02-15 13:17:01,791 INFO L350 Elim1Store]: Elim1 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 35 treesize of output 61 [2023-02-15 13:17:05,944 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2023-02-15 13:17:05,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368251224] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:17:05,944 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:17:05,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 17, 20] total 51 [2023-02-15 13:17:05,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645614565] [2023-02-15 13:17:05,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:17:05,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-02-15 13:17:05,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:17:05,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-02-15 13:17:05,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=1751, Unknown=14, NotChecked=546, Total=2550 [2023-02-15 13:17:05,947 INFO L87 Difference]: Start difference. First operand 272 states and 300 transitions. Second operand has 51 states, 51 states have (on average 2.6666666666666665) internal successors, (136), 51 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:17:08,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 13:17:11,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 13:17:15,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 13:17:18,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 13:17:20,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 13:17:35,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:17:35,209 INFO L93 Difference]: Finished difference Result 361 states and 391 transitions. [2023-02-15 13:17:35,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-02-15 13:17:35,210 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.6666666666666665) internal successors, (136), 51 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2023-02-15 13:17:35,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:17:35,211 INFO L225 Difference]: With dead ends: 361 [2023-02-15 13:17:35,211 INFO L226 Difference]: Without dead ends: 361 [2023-02-15 13:17:35,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 78 SyntacticMatches, 7 SemanticMatches, 84 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 2069 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=974, Invalid=5319, Unknown=51, NotChecked=966, Total=7310 [2023-02-15 13:17:35,213 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 569 mSDsluCounter, 2156 mSDsCounter, 0 mSdLazyCounter, 2096 mSolverCounterSat, 100 mSolverCounterUnsat, 37 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 2269 SdHoareTripleChecker+Invalid, 3475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 2096 IncrementalHoareTripleChecker+Invalid, 37 IncrementalHoareTripleChecker+Unknown, 1242 IncrementalHoareTripleChecker+Unchecked, 17.9s IncrementalHoareTripleChecker+Time [2023-02-15 13:17:35,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [569 Valid, 2269 Invalid, 3475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 2096 Invalid, 37 Unknown, 1242 Unchecked, 17.9s Time] [2023-02-15 13:17:35,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2023-02-15 13:17:35,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 298. [2023-02-15 13:17:35,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 267 states have (on average 1.2247191011235956) internal successors, (327), 297 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:17:35,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 327 transitions. [2023-02-15 13:17:35,219 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 327 transitions. Word has length 52 [2023-02-15 13:17:35,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:17:35,219 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 327 transitions. [2023-02-15 13:17:35,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 2.6666666666666665) internal successors, (136), 51 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:17:35,219 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 327 transitions. [2023-02-15 13:17:35,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-02-15 13:17:35,220 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:17:35,220 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 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] [2023-02-15 13:17:35,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-02-15 13:17:35,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2023-02-15 13:17:35,426 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 13:17:35,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:17:35,426 INFO L85 PathProgramCache]: Analyzing trace with hash 47392293, now seen corresponding path program 2 times [2023-02-15 13:17:35,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:17:35,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258104975] [2023-02-15 13:17:35,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:17:35,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:17:35,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:17:37,423 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:17:37,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:17:37,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258104975] [2023-02-15 13:17:37,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258104975] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:17:37,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700518111] [2023-02-15 13:17:37,426 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 13:17:37,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:17:37,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:17:37,427 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:17:37,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-02-15 13:17:37,582 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 13:17:37,582 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 13:17:37,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 67 conjunts are in the unsatisfiable core [2023-02-15 13:17:37,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:17:37,601 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:17:37,947 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:17:37,947 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:17:38,132 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:17:38,155 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:17:38,597 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:17:38,598 INFO L350 Elim1Store]: Elim1 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 29 treesize of output 30 [2023-02-15 13:17:38,606 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:17:39,053 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-02-15 13:17:39,054 INFO L350 Elim1Store]: Elim1 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 27 treesize of output 22 [2023-02-15 13:17:39,088 INFO L350 Elim1Store]: Elim1 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 26 treesize of output 21 [2023-02-15 13:17:39,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:17:39,317 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 13:17:39,317 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 89 treesize of output 70 [2023-02-15 13:17:39,363 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2023-02-15 13:17:39,363 INFO L350 Elim1Store]: Elim1 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 63 treesize of output 55 [2023-02-15 13:17:41,191 INFO L321 Elim1Store]: treesize reduction 21, result has 36.4 percent of original size [2023-02-15 13:17:41,192 INFO L350 Elim1Store]: Elim1 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 61 treesize of output 44 [2023-02-15 13:17:41,218 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:17:41,219 INFO L350 Elim1Store]: Elim1 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 38 treesize of output 29 [2023-02-15 13:17:41,702 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:17:41,702 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:17:52,494 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1922 (Array Int Int)) (v_ArrVal_1921 (Array Int Int)) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int)) (= (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1922))) (let ((.cse2 (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1921))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse3 (+ .cse2 8))) (select (store .cse0 .cse1 (store (store (select .cse0 .cse1) .cse2 0) .cse3 v_ArrVal_1928)) (select (select (store .cse4 .cse1 (store (store (select .cse4 .cse1) .cse2 0) .cse3 v_ArrVal_1930)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) 0) 0)) (forall ((v_ArrVal_1922 (Array Int Int)) (v_ArrVal_1921 (Array Int Int)) (v_ArrVal_1930 Int)) (= (select (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1921))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store .cse6 .cse7 (let ((.cse8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1922) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store (store (select .cse6 .cse7) .cse8 0) (+ .cse8 8) v_ArrVal_1930))))))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) 0) 0))) is different from false [2023-02-15 13:17:52,531 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (and (forall ((v_ArrVal_1922 (Array Int Int)) (v_ArrVal_1921 (Array Int Int)) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int)) (= (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_1922))) (let ((.cse2 (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse4 (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_1921))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse3 (+ 8 .cse2))) (select (store .cse0 .cse1 (store (store (select .cse0 .cse1) .cse2 0) .cse3 v_ArrVal_1928)) (select (select (store .cse4 .cse1 (store (store (select .cse4 .cse1) .cse2 0) .cse3 v_ArrVal_1930)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) 0) 0)) (forall ((v_ArrVal_1922 (Array Int Int)) (v_ArrVal_1921 (Array Int Int)) (v_ArrVal_1930 Int)) (= (select (let ((.cse6 (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_1921))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store .cse7 .cse8 (let ((.cse9 (select (select (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_1922) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store (store (select .cse7 .cse8) .cse9 0) (+ 8 .cse9) v_ArrVal_1930))))))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) 0) 0)))) is different from false [2023-02-15 13:17:52,583 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:17:52,583 INFO L350 Elim1Store]: Elim1 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 201 treesize of output 162 [2023-02-15 13:17:52,601 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:17:52,601 INFO L350 Elim1Store]: Elim1 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 153 treesize of output 114 [2023-02-15 13:17:52,796 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:17:52,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 2372 treesize of output 2282 [2023-02-15 13:17:52,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:17:54,686 INFO L321 Elim1Store]: treesize reduction 330, result has 58.4 percent of original size [2023-02-15 13:17:54,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 13 new quantified variables, introduced 45 case distinctions, treesize of input 24336 treesize of output 21458 [2023-02-15 13:17:54,825 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:17:54,826 INFO L350 Elim1Store]: Elim1 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 28836 treesize of output 25620 [2023-02-15 13:17:55,003 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:17:55,005 INFO L350 Elim1Store]: Elim1 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 51128 treesize of output 47830 [2023-02-15 13:18:02,576 WARN L207 Elim1Store]: Array PQE input equivalent to true